./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/recursified_nla-digbench/recursified_geo1.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_68378dea-552e-4703-8f95-a6f51f78619b/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68378dea-552e-4703-8f95-a6f51f78619b/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_68378dea-552e-4703-8f95-a6f51f78619b/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68378dea-552e-4703-8f95-a6f51f78619b/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/recursified_nla-digbench/recursified_geo1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68378dea-552e-4703-8f95-a6f51f78619b/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_68378dea-552e-4703-8f95-a6f51f78619b/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 ba87ab61cc50ccb52aece6219e7fc9da23076f2342241139ee756008f0599342 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 23:44:17,220 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:44:17,351 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68378dea-552e-4703-8f95-a6f51f78619b/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Overflow-32bit-Kojak_Default.epf [2024-11-08 23:44:17,357 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:44:17,358 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 23:44:17,406 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:44:17,408 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:44:17,409 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-08 23:44:17,410 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:44:17,412 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:44:17,413 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:44:17,414 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:44:17,416 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:44:17,416 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:44:17,417 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:44:17,418 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:44:17,418 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:44:17,419 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:44:17,419 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:44:17,420 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:44:17,420 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-08 23:44:17,421 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 23:44:17,422 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:44:17,423 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:44:17,423 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:44:17,424 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 23:44:17,424 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 23:44:17,425 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 23:44:17,425 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:44:17,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 23:44:17,426 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:44:17,427 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:44:17,427 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:44:17,428 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 23:44:17,428 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:44:17,429 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_68378dea-552e-4703-8f95-a6f51f78619b/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_68378dea-552e-4703-8f95-a6f51f78619b/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 -> ba87ab61cc50ccb52aece6219e7fc9da23076f2342241139ee756008f0599342 [2024-11-08 23:44:17,775 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:44:17,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:44:17,813 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:44:17,814 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:44:17,818 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:44:17,820 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68378dea-552e-4703-8f95-a6f51f78619b/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/recursified_nla-digbench/recursified_geo1.c Unable to find full path for "g++" [2024-11-08 23:44:20,272 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:44:20,527 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:44:20,528 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68378dea-552e-4703-8f95-a6f51f78619b/sv-benchmarks/c/recursified_nla-digbench/recursified_geo1.c [2024-11-08 23:44:20,538 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68378dea-552e-4703-8f95-a6f51f78619b/bin/ukojak-verify-ImItNfHLgk/data/edafbf4b4/1fbbabc2989241f5bc31c5efd84bff17/FLAG7ae158c44 [2024-11-08 23:44:20,879 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68378dea-552e-4703-8f95-a6f51f78619b/bin/ukojak-verify-ImItNfHLgk/data/edafbf4b4/1fbbabc2989241f5bc31c5efd84bff17 [2024-11-08 23:44:20,882 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:44:20,884 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:44:20,886 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:44:20,886 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:44:20,896 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:44:20,897 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:44:20" (1/1) ... [2024-11-08 23:44:20,898 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@673f4954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:44:20, skipping insertion in model container [2024-11-08 23:44:20,899 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:44:20" (1/1) ... [2024-11-08 23:44:20,929 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:44:21,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:44:21,184 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:44:21,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:44:21,231 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:44:21,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:44:21 WrapperNode [2024-11-08 23:44:21,232 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:44:21,234 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:44:21,234 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:44:21,234 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:44:21,241 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:44:21" (1/1) ... [2024-11-08 23:44:21,250 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:44:21" (1/1) ... [2024-11-08 23:44:21,276 INFO L138 Inliner]: procedures = 16, calls = 59, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2024-11-08 23:44:21,277 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:44:21,278 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:44:21,278 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:44:21,278 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:44:21,291 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:44:21" (1/1) ... [2024-11-08 23:44:21,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:44:21" (1/1) ... [2024-11-08 23:44:21,294 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:44:21" (1/1) ... [2024-11-08 23:44:21,295 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:44:21" (1/1) ... [2024-11-08 23:44:21,302 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:44:21" (1/1) ... [2024-11-08 23:44:21,304 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:44:21" (1/1) ... [2024-11-08 23:44:21,306 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:44:21" (1/1) ... [2024-11-08 23:44:21,307 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:44:21" (1/1) ... [2024-11-08 23:44:21,310 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:44:21,312 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:44:21,312 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:44:21,312 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:44:21,313 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:44:21" (1/1) ... [2024-11-08 23:44:21,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 23:44:21,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68378dea-552e-4703-8f95-a6f51f78619b/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 23:44:21,353 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68378dea-552e-4703-8f95-a6f51f78619b/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:44:21,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68378dea-552e-4703-8f95-a6f51f78619b/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:44:21,387 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_28_to_36_0 [2024-11-08 23:44:21,387 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_28_to_36_0 [2024-11-08 23:44:21,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:44:21,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 23:44:21,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 23:44:21,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-08 23:44:21,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:44:21,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:44:21,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-08 23:44:21,389 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-08 23:44:21,389 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-08 23:44:21,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 23:44:21,482 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:44:21,485 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:44:21,909 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2024-11-08 23:44:21,910 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:44:22,020 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:44:22,020 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:44:22,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:44:22 BoogieIcfgContainer [2024-11-08 23:44:22,021 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:44:22,022 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 23:44:22,023 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 23:44:22,044 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 23:44:22,044 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:44:22" (1/1) ... [2024-11-08 23:44:22,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:44:22,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:44:22,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 64 states and 67 transitions. [2024-11-08 23:44:22,166 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2024-11-08 23:44:22,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-08 23:44:22,168 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:44:22,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:44:22,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:44:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:44:22,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-08 23:44:22,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:44:22,761 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-08 23:44:22,781 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-08 23:44:22,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:22,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 56 [2024-11-08 23:44:22,882 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 23:44:22,884 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2024-11-08 23:44:22,895 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-08 23:44:22,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:22,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:22,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 25 [2024-11-08 23:44:22,962 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 17 treesize of output 13 [2024-11-08 23:44:22,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:22,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:22,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:22,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:23,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:23,016 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 23:44:23,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 14 [2024-11-08 23:44:23,027 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:44:23,047 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 23:44:23,053 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-08 23:44:23,066 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 23:44:23,072 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-08 23:44:23,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:23,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 61 [2024-11-08 23:44:23,112 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 23:44:23,114 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 57 [2024-11-08 23:44:23,123 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-08 23:44:23,175 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 23:44:23,189 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-08 23:44:23,245 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 23:44:23,256 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-08 23:44:23,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:23,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:23,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:23,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 18 [2024-11-08 23:44:23,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:23,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-08 23:44:23,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:23,357 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 23:44:23,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:23,382 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-08 23:44:23,393 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-08 23:44:23,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-08 23:44:23,530 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:44:23,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:44:23,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 67 states and 71 transitions. [2024-11-08 23:44:23,729 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2024-11-08 23:44:23,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 23:44:23,729 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:44:23,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:44:23,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:44:23,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:44:23,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-08 23:44:23,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:44:23,981 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-08 23:44:24,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:24,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 61 [2024-11-08 23:44:24,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:24,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:24,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:24,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:24,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:24,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:24,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 58 [2024-11-08 23:44:24,068 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 23:44:24,069 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 132 [2024-11-08 23:44:24,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:24,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:24,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:24,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:24,120 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2024-11-08 23:44:24,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 37 [2024-11-08 23:44:24,242 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-08 23:44:24,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:24,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:24,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:24,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:24,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:24,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:24,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:24,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 29 [2024-11-08 23:44:24,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2024-11-08 23:44:24,776 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:44:24,831 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:44:27,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:44:27,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 72 states and 85 transitions. [2024-11-08 23:44:27,172 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. [2024-11-08 23:44:27,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 23:44:27,176 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:44:27,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:44:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:44:27,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:44:27,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-08 23:44:27,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:44:27,365 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-08 23:44:27,388 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 23:44:27,390 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 23:44:27,395 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-08 23:44:27,403 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 23:44:27,404 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 23:44:27,410 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-08 23:44:27,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:27,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:27,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:27,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:27,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:27,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:27,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 131 [2024-11-08 23:44:27,483 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 23:44:27,485 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 80 [2024-11-08 23:44:27,500 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 23:44:27,502 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 176 [2024-11-08 23:44:27,513 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-08 23:44:27,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:27,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:27,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:27,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:27,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:27,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:27,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:27,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:27,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 50 [2024-11-08 23:44:27,595 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 29 treesize of output 21 [2024-11-08 23:44:27,603 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 22 treesize of output 16 [2024-11-08 23:44:27,609 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 15 treesize of output 11 [2024-11-08 23:44:27,623 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:44:27,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:27,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:27,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:27,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:27,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:27,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:27,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:27,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:27,674 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2024-11-08 23:44:27,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 21 [2024-11-08 23:44:27,689 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:44:27,731 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 23:44:27,732 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 23:44:27,736 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 23:44:27,743 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-08 23:44:27,756 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 23:44:27,757 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 23:44:27,759 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 23:44:27,766 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-08 23:44:27,778 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 23:44:27,779 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 23:44:27,785 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-08 23:44:27,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:27,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:27,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:27,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:27,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 112 [2024-11-08 23:44:27,825 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 23:44:27,827 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 79 [2024-11-08 23:44:27,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:27,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:27,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:27,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:27,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:27,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:27,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 59 [2024-11-08 23:44:27,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:27,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:27,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:27,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:27,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 26 [2024-11-08 23:44:27,923 INFO L349 Elim1Store]: treesize reduction 13, result has 50.0 percent of original size [2024-11-08 23:44:27,923 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 1 case distinctions, treesize of input 13 treesize of output 21 [2024-11-08 23:44:27,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:27,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:27,952 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 23:44:27,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 26 [2024-11-08 23:44:27,966 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 35 treesize of output 27 [2024-11-08 23:44:27,974 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 28 treesize of output 22 [2024-11-08 23:44:28,011 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:44:28,028 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 23:44:28,029 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 23:44:28,033 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-08 23:44:28,041 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 23:44:28,042 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 23:44:28,046 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-08 23:44:28,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-08 23:44:28,592 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:44:30,520 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_func_to_recursive_line_28_to_36_0_~z.base))) (let ((.cse1 (select .cse0 c_func_to_recursive_line_28_to_36_0_~z.offset)) (.cse3 (select |c_#memory_int| c_func_to_recursive_line_28_to_36_0_~x.base))) (and (= c_func_to_recursive_line_28_to_36_0_~z.offset 0) (<= (select .cse0 0) 2147483647) (not (and (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_5 (Array Int Int)) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~#y~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse2 (store (store (store (store (store |c_#memory_int| c_func_to_recursive_line_28_to_36_0_~x.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_6) |ULTIMATE.start_main_~#c~0#1.base| v_DerPreprocessor_7) c_func_to_recursive_line_28_to_36_0_~z.base v_DerPreprocessor_8) |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_9))) (and (not (= |ULTIMATE.start_main_~#y~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)) (not (= |ULTIMATE.start_main_~#y~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= .cse1 (select (select .cse2 c_func_to_recursive_line_28_to_36_0_~z.base) c_func_to_recursive_line_28_to_36_0_~z.offset)) (not (= |ULTIMATE.start_main_~#k~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (not (= |ULTIMATE.start_main_~#k~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)) (= .cse3 (store (select .cse2 c_func_to_recursive_line_28_to_36_0_~x.base) c_func_to_recursive_line_28_to_36_0_~x.offset 1)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#y~0#1.base|))))) (<= .cse1 2147483647))) (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|) 0) 1) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)))) (= c_func_to_recursive_line_28_to_36_0_~x.offset 0) (= (select .cse3 c_func_to_recursive_line_28_to_36_0_~x.offset) 1) (not (= c_func_to_recursive_line_28_to_36_0_~z.base c_func_to_recursive_line_28_to_36_0_~x.base)) (<= 0 (+ .cse1 2147483648)) (= (select .cse3 0) 1)))) is different from false [2024-11-08 23:44:30,873 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse0 (select |c_#memory_int| c_func_to_recursive_line_28_to_36_0_~z.base))) (let ((.cse1 (select .cse0 c_func_to_recursive_line_28_to_36_0_~z.offset)) (.cse3 (select |c_#memory_int| c_func_to_recursive_line_28_to_36_0_~x.base))) (and (= c_func_to_recursive_line_28_to_36_0_~z.offset 0) (<= (select .cse0 0) 2147483647) (not (and (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_5 (Array Int Int)) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~#y~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse2 (store (store (store (store (store |c_#memory_int| c_func_to_recursive_line_28_to_36_0_~x.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_6) |ULTIMATE.start_main_~#c~0#1.base| v_DerPreprocessor_7) c_func_to_recursive_line_28_to_36_0_~z.base v_DerPreprocessor_8) |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_9))) (and (not (= |ULTIMATE.start_main_~#y~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)) (not (= |ULTIMATE.start_main_~#y~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= .cse1 (select (select .cse2 c_func_to_recursive_line_28_to_36_0_~z.base) c_func_to_recursive_line_28_to_36_0_~z.offset)) (not (= |ULTIMATE.start_main_~#k~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (not (= |ULTIMATE.start_main_~#k~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)) (= .cse3 (store (select .cse2 c_func_to_recursive_line_28_to_36_0_~x.base) c_func_to_recursive_line_28_to_36_0_~x.offset 1)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#y~0#1.base|))))) (<= .cse1 2147483647))) (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|) 0) 1) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)))) (= c_func_to_recursive_line_28_to_36_0_~x.offset 0) (= (select .cse3 c_func_to_recursive_line_28_to_36_0_~x.offset) 1) (not (= c_func_to_recursive_line_28_to_36_0_~z.base c_func_to_recursive_line_28_to_36_0_~x.base)) (<= 0 (+ .cse1 2147483648)) (= (select .cse3 0) 1))))) is different from true [2024-11-08 23:44:31,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:44:31,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 74 states and 93 transitions. [2024-11-08 23:44:31,125 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2024-11-08 23:44:31,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 23:44:31,125 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:44:31,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:44:31,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:44:31,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:44:31,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-08 23:44:31,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:44:31,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:31,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:31,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:31,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 35 [2024-11-08 23:44:31,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:31,303 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-08 23:44:31,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 57 treesize of output 49 [2024-11-08 23:44:31,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2024-11-08 23:44:31,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-08 23:44:31,703 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:44:31,708 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#z~0#1.base|) |c_ULTIMATE.start_main_~#z~0#1.offset|))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0#1.base|)) (.cse3 (<= .cse1 2147483647))) (and (not (and (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~#y~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse0 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_5) |ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_6) |ULTIMATE.start_main_~#c~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~#z~0#1.base| v_DerPreprocessor_8) |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_9))) (and (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_ULTIMATE.start_main_~#x~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_ULTIMATE.start_main_~#z~0#1.base|)) (= (select (select .cse0 |c_ULTIMATE.start_main_~#z~0#1.base|) |c_ULTIMATE.start_main_~#z~0#1.offset|) .cse1) (not (= |ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |ULTIMATE.start_main_~#y~0#1.base|)) (= (store (select .cse0 |c_ULTIMATE.start_main_~#x~0#1.base|) |c_ULTIMATE.start_main_~#x~0#1.offset| 1) .cse2) (not (= |ULTIMATE.start_main_~#c~0#1.base| |c_ULTIMATE.start_main_~#z~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |c_ULTIMATE.start_main_~#z~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#y~0#1.base|))))) .cse3)) (<= 0 (+ .cse1 2147483648)) (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |c_ULTIMATE.start_main_~#z~0#1.base|)) (= (select .cse2 |c_ULTIMATE.start_main_~#x~0#1.offset|) 1) .cse3))) is different from false [2024-11-08 23:44:31,956 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#z~0#1.base|) |c_ULTIMATE.start_main_~#z~0#1.offset|))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0#1.base|)) (.cse3 (<= .cse1 2147483647))) (and (not (and (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~#y~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse0 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_5) |ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_6) |ULTIMATE.start_main_~#c~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~#z~0#1.base| v_DerPreprocessor_8) |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_9))) (and (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_ULTIMATE.start_main_~#x~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_ULTIMATE.start_main_~#z~0#1.base|)) (= (select (select .cse0 |c_ULTIMATE.start_main_~#z~0#1.base|) |c_ULTIMATE.start_main_~#z~0#1.offset|) .cse1) (not (= |ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |ULTIMATE.start_main_~#y~0#1.base|)) (= (store (select .cse0 |c_ULTIMATE.start_main_~#x~0#1.base|) |c_ULTIMATE.start_main_~#x~0#1.offset| 1) .cse2) (not (= |ULTIMATE.start_main_~#c~0#1.base| |c_ULTIMATE.start_main_~#z~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |c_ULTIMATE.start_main_~#z~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#y~0#1.base|))))) .cse3)) (<= 0 (+ .cse1 2147483648)) (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |c_ULTIMATE.start_main_~#z~0#1.base|)) (= (select .cse2 |c_ULTIMATE.start_main_~#x~0#1.offset|) 1) .cse3)))) is different from true [2024-11-08 23:44:32,227 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_func_to_recursive_line_28_to_36_0_~z.base))) (let ((.cse1 (select .cse0 c_func_to_recursive_line_28_to_36_0_~z.offset))) (let ((.cse3 (select |c_#memory_int| c_func_to_recursive_line_28_to_36_0_~x.base)) (.cse4 (<= .cse1 2147483647))) (and (= c_func_to_recursive_line_28_to_36_0_~z.offset 0) (<= (select .cse0 0) 2147483647) (not (and (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_5 (Array Int Int)) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~#y~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse2 (store (store (store (store (store |c_#memory_int| c_func_to_recursive_line_28_to_36_0_~x.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_6) |ULTIMATE.start_main_~#c~0#1.base| v_DerPreprocessor_7) c_func_to_recursive_line_28_to_36_0_~z.base v_DerPreprocessor_8) |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_9))) (and (not (= |ULTIMATE.start_main_~#y~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)) (not (= |ULTIMATE.start_main_~#y~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= .cse1 (select (select .cse2 c_func_to_recursive_line_28_to_36_0_~z.base) c_func_to_recursive_line_28_to_36_0_~z.offset)) (not (= |ULTIMATE.start_main_~#k~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (not (= |ULTIMATE.start_main_~#k~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)) (= .cse3 (store (select .cse2 c_func_to_recursive_line_28_to_36_0_~x.base) c_func_to_recursive_line_28_to_36_0_~x.offset 1)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#y~0#1.base|))))) .cse4)) (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|) 0) 1) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)))) (= c_func_to_recursive_line_28_to_36_0_~x.offset 0) (= (select .cse3 c_func_to_recursive_line_28_to_36_0_~x.offset) 1) (not (= c_func_to_recursive_line_28_to_36_0_~z.base c_func_to_recursive_line_28_to_36_0_~x.base)) (<= 0 (+ .cse1 2147483648)) (= (select .cse3 0) 1) .cse4)))) is different from false [2024-11-08 23:44:32,364 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse0 (select |c_#memory_int| c_func_to_recursive_line_28_to_36_0_~z.base))) (let ((.cse1 (select .cse0 c_func_to_recursive_line_28_to_36_0_~z.offset))) (let ((.cse3 (select |c_#memory_int| c_func_to_recursive_line_28_to_36_0_~x.base)) (.cse4 (<= .cse1 2147483647))) (and (= c_func_to_recursive_line_28_to_36_0_~z.offset 0) (<= (select .cse0 0) 2147483647) (not (and (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_5 (Array Int Int)) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~#y~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse2 (store (store (store (store (store |c_#memory_int| c_func_to_recursive_line_28_to_36_0_~x.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_6) |ULTIMATE.start_main_~#c~0#1.base| v_DerPreprocessor_7) c_func_to_recursive_line_28_to_36_0_~z.base v_DerPreprocessor_8) |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_9))) (and (not (= |ULTIMATE.start_main_~#y~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)) (not (= |ULTIMATE.start_main_~#y~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= .cse1 (select (select .cse2 c_func_to_recursive_line_28_to_36_0_~z.base) c_func_to_recursive_line_28_to_36_0_~z.offset)) (not (= |ULTIMATE.start_main_~#k~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (not (= |ULTIMATE.start_main_~#k~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)) (= .cse3 (store (select .cse2 c_func_to_recursive_line_28_to_36_0_~x.base) c_func_to_recursive_line_28_to_36_0_~x.offset 1)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#y~0#1.base|))))) .cse4)) (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|) 0) 1) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)))) (= c_func_to_recursive_line_28_to_36_0_~x.offset 0) (= (select .cse3 c_func_to_recursive_line_28_to_36_0_~x.offset) 1) (not (= c_func_to_recursive_line_28_to_36_0_~z.base c_func_to_recursive_line_28_to_36_0_~x.base)) (<= 0 (+ .cse1 2147483648)) (= (select .cse3 0) 1) .cse4))))) is different from true [2024-11-08 23:44:32,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:44:32,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 74 states and 93 transitions. [2024-11-08 23:44:32,372 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2024-11-08 23:44:32,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 23:44:32,373 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:44:32,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:44:32,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:44:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:44:32,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-08 23:44:32,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:44:32,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:32,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:32,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:32,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:32,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:32,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:32,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:32,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:32,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 37 [2024-11-08 23:44:32,573 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2024-11-08 23:44:32,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 53 [2024-11-08 23:44:32,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2024-11-08 23:44:33,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2024-11-08 23:44:33,275 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:44:34,539 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_func_to_recursive_line_28_to_36_0_#in~z.base|))) (let ((.cse0 (select |c_#memory_int| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (.cse3 (select .cse2 |c_func_to_recursive_line_28_to_36_0_#in~z.offset|))) (and (= |c_func_to_recursive_line_28_to_36_0_#in~z.offset| 0) (= (select .cse0 |c_func_to_recursive_line_28_to_36_0_#in~x.offset|) 1) (exists ((|ULTIMATE.start_main_~#y~0#1.base| Int)) (let ((.cse1 (select (select |c_#memory_int| |ULTIMATE.start_main_~#y~0#1.base|) 0))) (and (not (= |c_func_to_recursive_line_28_to_36_0_#in~z.base| |ULTIMATE.start_main_~#y~0#1.base|)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (<= .cse1 2147483647) (= .cse1 (select .cse2 0))))) (<= 0 (+ .cse3 2147483648)) (not (and (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_5 (Array Int Int)) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~#y~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse4 (store (store (store (store (store |c_#memory_int| |c_func_to_recursive_line_28_to_36_0_#in~x.base| v_DerPreprocessor_5) |ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_6) |ULTIMATE.start_main_~#c~0#1.base| v_DerPreprocessor_7) |c_func_to_recursive_line_28_to_36_0_#in~z.base| v_DerPreprocessor_8) |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_9))) (and (not (= |c_func_to_recursive_line_28_to_36_0_#in~z.base| |ULTIMATE.start_main_~#y~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~z.base|)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (= .cse0 (store (select .cse4 |c_func_to_recursive_line_28_to_36_0_#in~x.base|) |c_func_to_recursive_line_28_to_36_0_#in~x.offset| 1)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#c~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (not (= |c_func_to_recursive_line_28_to_36_0_#in~z.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= (select (select .cse4 |c_func_to_recursive_line_28_to_36_0_#in~z.base|) |c_func_to_recursive_line_28_to_36_0_#in~z.offset|) .cse3) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#y~0#1.base|))))) (<= .cse3 2147483647))) (not (= |c_func_to_recursive_line_28_to_36_0_#in~z.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|))))) is different from false [2024-11-08 23:44:34,854 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse2 (select |c_#memory_int| |c_func_to_recursive_line_28_to_36_0_#in~z.base|))) (let ((.cse0 (select |c_#memory_int| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (.cse3 (select .cse2 |c_func_to_recursive_line_28_to_36_0_#in~z.offset|))) (and (= |c_func_to_recursive_line_28_to_36_0_#in~z.offset| 0) (= (select .cse0 |c_func_to_recursive_line_28_to_36_0_#in~x.offset|) 1) (exists ((|ULTIMATE.start_main_~#y~0#1.base| Int)) (let ((.cse1 (select (select |c_#memory_int| |ULTIMATE.start_main_~#y~0#1.base|) 0))) (and (not (= |c_func_to_recursive_line_28_to_36_0_#in~z.base| |ULTIMATE.start_main_~#y~0#1.base|)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (<= .cse1 2147483647) (= .cse1 (select .cse2 0))))) (<= 0 (+ .cse3 2147483648)) (not (and (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_5 (Array Int Int)) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~#y~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse4 (store (store (store (store (store |c_#memory_int| |c_func_to_recursive_line_28_to_36_0_#in~x.base| v_DerPreprocessor_5) |ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_6) |ULTIMATE.start_main_~#c~0#1.base| v_DerPreprocessor_7) |c_func_to_recursive_line_28_to_36_0_#in~z.base| v_DerPreprocessor_8) |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_9))) (and (not (= |c_func_to_recursive_line_28_to_36_0_#in~z.base| |ULTIMATE.start_main_~#y~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~z.base|)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (= .cse0 (store (select .cse4 |c_func_to_recursive_line_28_to_36_0_#in~x.base|) |c_func_to_recursive_line_28_to_36_0_#in~x.offset| 1)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#c~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (not (= |c_func_to_recursive_line_28_to_36_0_#in~z.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= (select (select .cse4 |c_func_to_recursive_line_28_to_36_0_#in~z.base|) |c_func_to_recursive_line_28_to_36_0_#in~z.offset|) .cse3) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#y~0#1.base|))))) (<= .cse3 2147483647))) (not (= |c_func_to_recursive_line_28_to_36_0_#in~z.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)))))) is different from true [2024-11-08 23:44:35,142 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| c_func_to_recursive_line_28_to_36_0_~z.base))) (let ((.cse0 (= c_func_to_recursive_line_28_to_36_0_~z.offset 0)) (.cse1 (select .cse6 0)) (.cse5 (select |c_#memory_int| c_func_to_recursive_line_28_to_36_0_~x.base)) (.cse3 (select .cse6 c_func_to_recursive_line_28_to_36_0_~z.offset))) (and (not (and .cse0 (<= .cse1 2147483647) (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|) 0) 1) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)))) (= c_func_to_recursive_line_28_to_36_0_~x.offset 0))) .cse0 (exists ((|ULTIMATE.start_main_~#y~0#1.base| Int)) (let ((.cse2 (select (select |c_#memory_int| |ULTIMATE.start_main_~#y~0#1.base|) 0))) (and (not (= |ULTIMATE.start_main_~#y~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)) (<= .cse2 2147483647) (not (= |ULTIMATE.start_main_~#y~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (= .cse2 .cse1)))) (not (and (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_5 (Array Int Int)) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~#y~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse4 (store (store (store (store (store |c_#memory_int| c_func_to_recursive_line_28_to_36_0_~x.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_6) |ULTIMATE.start_main_~#c~0#1.base| v_DerPreprocessor_7) c_func_to_recursive_line_28_to_36_0_~z.base v_DerPreprocessor_8) |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_9))) (and (not (= |ULTIMATE.start_main_~#y~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)) (not (= |ULTIMATE.start_main_~#y~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= .cse3 (select (select .cse4 c_func_to_recursive_line_28_to_36_0_~z.base) c_func_to_recursive_line_28_to_36_0_~z.offset)) (not (= |ULTIMATE.start_main_~#k~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (not (= |ULTIMATE.start_main_~#k~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)) (= .cse5 (store (select .cse4 c_func_to_recursive_line_28_to_36_0_~x.base) c_func_to_recursive_line_28_to_36_0_~x.offset 1)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#y~0#1.base|))))) (<= .cse3 2147483647))) (= (select .cse5 c_func_to_recursive_line_28_to_36_0_~x.offset) 1) (not (= c_func_to_recursive_line_28_to_36_0_~z.base c_func_to_recursive_line_28_to_36_0_~x.base)) (<= 0 (+ .cse3 2147483648))))) is different from false [2024-11-08 23:44:35,617 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse6 (select |c_#memory_int| c_func_to_recursive_line_28_to_36_0_~z.base))) (let ((.cse0 (= c_func_to_recursive_line_28_to_36_0_~z.offset 0)) (.cse1 (select .cse6 0)) (.cse5 (select |c_#memory_int| c_func_to_recursive_line_28_to_36_0_~x.base)) (.cse3 (select .cse6 c_func_to_recursive_line_28_to_36_0_~z.offset))) (and (not (and .cse0 (<= .cse1 2147483647) (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|) 0) 1) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)))) (= c_func_to_recursive_line_28_to_36_0_~x.offset 0))) .cse0 (exists ((|ULTIMATE.start_main_~#y~0#1.base| Int)) (let ((.cse2 (select (select |c_#memory_int| |ULTIMATE.start_main_~#y~0#1.base|) 0))) (and (not (= |ULTIMATE.start_main_~#y~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)) (<= .cse2 2147483647) (not (= |ULTIMATE.start_main_~#y~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (= .cse2 .cse1)))) (not (and (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_5 (Array Int Int)) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~#y~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse4 (store (store (store (store (store |c_#memory_int| c_func_to_recursive_line_28_to_36_0_~x.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_6) |ULTIMATE.start_main_~#c~0#1.base| v_DerPreprocessor_7) c_func_to_recursive_line_28_to_36_0_~z.base v_DerPreprocessor_8) |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_9))) (and (not (= |ULTIMATE.start_main_~#y~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)) (not (= |ULTIMATE.start_main_~#y~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= .cse3 (select (select .cse4 c_func_to_recursive_line_28_to_36_0_~z.base) c_func_to_recursive_line_28_to_36_0_~z.offset)) (not (= |ULTIMATE.start_main_~#k~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (not (= |ULTIMATE.start_main_~#k~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)) (= .cse5 (store (select .cse4 c_func_to_recursive_line_28_to_36_0_~x.base) c_func_to_recursive_line_28_to_36_0_~x.offset 1)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#y~0#1.base|))))) (<= .cse3 2147483647))) (= (select .cse5 c_func_to_recursive_line_28_to_36_0_~x.offset) 1) (not (= c_func_to_recursive_line_28_to_36_0_~z.base c_func_to_recursive_line_28_to_36_0_~x.base)) (<= 0 (+ .cse3 2147483648)))))) is different from true [2024-11-08 23:44:35,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:44:35,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 76 states and 103 transitions. [2024-11-08 23:44:35,931 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 103 transitions. [2024-11-08 23:44:35,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 23:44:35,932 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:44:35,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:44:35,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:44:36,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:44:36,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-08 23:44:36,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:44:36,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:36,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:36,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:36,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:36,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:36,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:36,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 37 [2024-11-08 23:44:36,058 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2024-11-08 23:44:36,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 53 [2024-11-08 23:44:36,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-11-08 23:44:36,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-08 23:44:36,113 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:44:36,126 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_func_to_recursive_line_28_to_36_0_#in~z.base|))) (let ((.cse3 (select .cse2 |c_func_to_recursive_line_28_to_36_0_#in~z.offset|))) (let ((.cse0 (select |c_#memory_int| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (.cse4 (<= .cse3 2147483647))) (and (= |c_func_to_recursive_line_28_to_36_0_#in~z.offset| 0) (= (select .cse0 |c_func_to_recursive_line_28_to_36_0_#in~x.offset|) 1) (exists ((|ULTIMATE.start_main_~#y~0#1.base| Int)) (let ((.cse1 (select (select |c_#memory_int| |ULTIMATE.start_main_~#y~0#1.base|) 0))) (and (not (= |c_func_to_recursive_line_28_to_36_0_#in~z.base| |ULTIMATE.start_main_~#y~0#1.base|)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (<= .cse1 2147483647) (= .cse1 (select .cse2 0))))) (<= 0 (+ .cse3 2147483648)) .cse4 (not (and (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_5 (Array Int Int)) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~#y~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse5 (store (store (store (store (store |c_#memory_int| |c_func_to_recursive_line_28_to_36_0_#in~x.base| v_DerPreprocessor_5) |ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_6) |ULTIMATE.start_main_~#c~0#1.base| v_DerPreprocessor_7) |c_func_to_recursive_line_28_to_36_0_#in~z.base| v_DerPreprocessor_8) |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_9))) (and (not (= |c_func_to_recursive_line_28_to_36_0_#in~z.base| |ULTIMATE.start_main_~#y~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~z.base|)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (= .cse0 (store (select .cse5 |c_func_to_recursive_line_28_to_36_0_#in~x.base|) |c_func_to_recursive_line_28_to_36_0_#in~x.offset| 1)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#c~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (not (= |c_func_to_recursive_line_28_to_36_0_#in~z.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= (select (select .cse5 |c_func_to_recursive_line_28_to_36_0_#in~z.base|) |c_func_to_recursive_line_28_to_36_0_#in~z.offset|) .cse3) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#y~0#1.base|))))) .cse4)) (not (= |c_func_to_recursive_line_28_to_36_0_#in~z.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)))))) is different from false [2024-11-08 23:44:36,141 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse2 (select |c_#memory_int| |c_func_to_recursive_line_28_to_36_0_#in~z.base|))) (let ((.cse3 (select .cse2 |c_func_to_recursive_line_28_to_36_0_#in~z.offset|))) (let ((.cse0 (select |c_#memory_int| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (.cse4 (<= .cse3 2147483647))) (and (= |c_func_to_recursive_line_28_to_36_0_#in~z.offset| 0) (= (select .cse0 |c_func_to_recursive_line_28_to_36_0_#in~x.offset|) 1) (exists ((|ULTIMATE.start_main_~#y~0#1.base| Int)) (let ((.cse1 (select (select |c_#memory_int| |ULTIMATE.start_main_~#y~0#1.base|) 0))) (and (not (= |c_func_to_recursive_line_28_to_36_0_#in~z.base| |ULTIMATE.start_main_~#y~0#1.base|)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (<= .cse1 2147483647) (= .cse1 (select .cse2 0))))) (<= 0 (+ .cse3 2147483648)) .cse4 (not (and (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_5 (Array Int Int)) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~#y~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse5 (store (store (store (store (store |c_#memory_int| |c_func_to_recursive_line_28_to_36_0_#in~x.base| v_DerPreprocessor_5) |ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_6) |ULTIMATE.start_main_~#c~0#1.base| v_DerPreprocessor_7) |c_func_to_recursive_line_28_to_36_0_#in~z.base| v_DerPreprocessor_8) |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_9))) (and (not (= |c_func_to_recursive_line_28_to_36_0_#in~z.base| |ULTIMATE.start_main_~#y~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~z.base|)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (= .cse0 (store (select .cse5 |c_func_to_recursive_line_28_to_36_0_#in~x.base|) |c_func_to_recursive_line_28_to_36_0_#in~x.offset| 1)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#c~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (not (= |c_func_to_recursive_line_28_to_36_0_#in~z.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= (select (select .cse5 |c_func_to_recursive_line_28_to_36_0_#in~z.base|) |c_func_to_recursive_line_28_to_36_0_#in~z.offset|) .cse3) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#y~0#1.base|))))) .cse4)) (not (= |c_func_to_recursive_line_28_to_36_0_#in~z.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|))))))) is different from true [2024-11-08 23:44:36,154 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| c_func_to_recursive_line_28_to_36_0_~z.base))) (let ((.cse3 (select .cse7 c_func_to_recursive_line_28_to_36_0_~z.offset))) (let ((.cse0 (= c_func_to_recursive_line_28_to_36_0_~z.offset 0)) (.cse1 (select .cse7 0)) (.cse5 (select |c_#memory_int| c_func_to_recursive_line_28_to_36_0_~x.base)) (.cse6 (<= .cse3 2147483647))) (and (not (and .cse0 (<= .cse1 2147483647) (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|) 0) 1) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)))) (= c_func_to_recursive_line_28_to_36_0_~x.offset 0))) .cse0 (exists ((|ULTIMATE.start_main_~#y~0#1.base| Int)) (let ((.cse2 (select (select |c_#memory_int| |ULTIMATE.start_main_~#y~0#1.base|) 0))) (and (not (= |ULTIMATE.start_main_~#y~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)) (<= .cse2 2147483647) (not (= |ULTIMATE.start_main_~#y~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (= .cse2 .cse1)))) (not (and (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_5 (Array Int Int)) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~#y~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse4 (store (store (store (store (store |c_#memory_int| c_func_to_recursive_line_28_to_36_0_~x.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_6) |ULTIMATE.start_main_~#c~0#1.base| v_DerPreprocessor_7) c_func_to_recursive_line_28_to_36_0_~z.base v_DerPreprocessor_8) |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_9))) (and (not (= |ULTIMATE.start_main_~#y~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)) (not (= |ULTIMATE.start_main_~#y~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= .cse3 (select (select .cse4 c_func_to_recursive_line_28_to_36_0_~z.base) c_func_to_recursive_line_28_to_36_0_~z.offset)) (not (= |ULTIMATE.start_main_~#k~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (not (= |ULTIMATE.start_main_~#k~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)) (= .cse5 (store (select .cse4 c_func_to_recursive_line_28_to_36_0_~x.base) c_func_to_recursive_line_28_to_36_0_~x.offset 1)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#y~0#1.base|))))) .cse6)) (= (select .cse5 c_func_to_recursive_line_28_to_36_0_~x.offset) 1) (not (= c_func_to_recursive_line_28_to_36_0_~z.base c_func_to_recursive_line_28_to_36_0_~x.base)) (<= 0 (+ .cse3 2147483648)) .cse6)))) is different from false [2024-11-08 23:44:36,169 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse7 (select |c_#memory_int| c_func_to_recursive_line_28_to_36_0_~z.base))) (let ((.cse3 (select .cse7 c_func_to_recursive_line_28_to_36_0_~z.offset))) (let ((.cse0 (= c_func_to_recursive_line_28_to_36_0_~z.offset 0)) (.cse1 (select .cse7 0)) (.cse5 (select |c_#memory_int| c_func_to_recursive_line_28_to_36_0_~x.base)) (.cse6 (<= .cse3 2147483647))) (and (not (and .cse0 (<= .cse1 2147483647) (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|) 0) 1) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)))) (= c_func_to_recursive_line_28_to_36_0_~x.offset 0))) .cse0 (exists ((|ULTIMATE.start_main_~#y~0#1.base| Int)) (let ((.cse2 (select (select |c_#memory_int| |ULTIMATE.start_main_~#y~0#1.base|) 0))) (and (not (= |ULTIMATE.start_main_~#y~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)) (<= .cse2 2147483647) (not (= |ULTIMATE.start_main_~#y~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (= .cse2 .cse1)))) (not (and (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_5 (Array Int Int)) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~#y~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse4 (store (store (store (store (store |c_#memory_int| c_func_to_recursive_line_28_to_36_0_~x.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_6) |ULTIMATE.start_main_~#c~0#1.base| v_DerPreprocessor_7) c_func_to_recursive_line_28_to_36_0_~z.base v_DerPreprocessor_8) |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_9))) (and (not (= |ULTIMATE.start_main_~#y~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)) (not (= |ULTIMATE.start_main_~#y~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= .cse3 (select (select .cse4 c_func_to_recursive_line_28_to_36_0_~z.base) c_func_to_recursive_line_28_to_36_0_~z.offset)) (not (= |ULTIMATE.start_main_~#k~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (not (= |ULTIMATE.start_main_~#k~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)) (= .cse5 (store (select .cse4 c_func_to_recursive_line_28_to_36_0_~x.base) c_func_to_recursive_line_28_to_36_0_~x.offset 1)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#y~0#1.base|))))) .cse6)) (= (select .cse5 c_func_to_recursive_line_28_to_36_0_~x.offset) 1) (not (= c_func_to_recursive_line_28_to_36_0_~z.base c_func_to_recursive_line_28_to_36_0_~x.base)) (<= 0 (+ .cse3 2147483648)) .cse6))))) is different from true [2024-11-08 23:44:36,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:44:36,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 76 states and 103 transitions. [2024-11-08 23:44:36,176 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 103 transitions. [2024-11-08 23:44:36,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 23:44:36,177 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:44:36,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:44:36,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:44:36,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:44:36,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-08 23:44:36,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:44:36,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:36,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 61 [2024-11-08 23:44:36,306 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 23:44:36,307 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 55 [2024-11-08 23:44:36,310 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-08 23:44:36,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:36,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:36,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:36,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 18 [2024-11-08 23:44:36,343 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:44:36,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:36,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:36,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:36,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:36,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:36,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:36,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:36,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:36,366 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2024-11-08 23:44:36,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 21 [2024-11-08 23:44:36,372 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 9 treesize of output 7 [2024-11-08 23:44:36,382 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 23:44:36,385 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-08 23:44:36,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:36,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:36,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:36,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:36,400 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 23:44:36,416 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 23:44:36,419 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-08 23:44:36,429 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-08 23:44:36,438 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-08 23:44:36,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-08 23:44:36,901 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:44:37,032 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_func_to_recursive_line_28_to_36_0_#in~z.base|))) (let ((.cse3 (select .cse6 |c_func_to_recursive_line_28_to_36_0_#in~z.offset|))) (let ((.cse0 (select |c_#memory_int| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (.cse4 (<= .cse3 2147483647)) (.cse2 (select .cse6 0))) (and (= |c_func_to_recursive_line_28_to_36_0_#in~z.offset| 0) (= (select .cse0 |c_func_to_recursive_line_28_to_36_0_#in~x.offset|) 1) (exists ((|ULTIMATE.start_main_~#y~0#1.base| Int)) (let ((.cse1 (select (select |c_#memory_int| |ULTIMATE.start_main_~#y~0#1.base|) 0))) (and (not (= |c_func_to_recursive_line_28_to_36_0_#in~z.base| |ULTIMATE.start_main_~#y~0#1.base|)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (<= .cse1 2147483647) (= .cse1 .cse2)))) (<= 0 (+ .cse3 2147483648)) .cse4 (= |c_func_to_recursive_line_28_to_36_0_#in~x.offset| 0) (= (select .cse0 0) 1) (not (and (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_5 (Array Int Int)) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~#y~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse5 (store (store (store (store (store |c_#memory_int| |c_func_to_recursive_line_28_to_36_0_#in~x.base| v_DerPreprocessor_5) |ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_6) |ULTIMATE.start_main_~#c~0#1.base| v_DerPreprocessor_7) |c_func_to_recursive_line_28_to_36_0_#in~z.base| v_DerPreprocessor_8) |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_9))) (and (not (= |c_func_to_recursive_line_28_to_36_0_#in~z.base| |ULTIMATE.start_main_~#y~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~z.base|)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (= .cse0 (store (select .cse5 |c_func_to_recursive_line_28_to_36_0_#in~x.base|) |c_func_to_recursive_line_28_to_36_0_#in~x.offset| 1)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#c~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (not (= |c_func_to_recursive_line_28_to_36_0_#in~z.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= (select (select .cse5 |c_func_to_recursive_line_28_to_36_0_#in~z.base|) |c_func_to_recursive_line_28_to_36_0_#in~z.offset|) .cse3) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#y~0#1.base|))))) .cse4)) (not (= |c_func_to_recursive_line_28_to_36_0_#in~z.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (<= .cse2 2147483647))))) is different from false [2024-11-08 23:44:37,208 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_func_to_recursive_line_28_to_36_0_#in~z.base|))) (let ((.cse5 (select .cse8 |c_func_to_recursive_line_28_to_36_0_#in~z.offset|))) (let ((.cse0 (= |c_func_to_recursive_line_28_to_36_0_#in~z.offset| 0)) (.cse3 (select .cse8 0)) (.cse1 (select |c_#memory_int| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (.cse6 (<= .cse5 2147483647)) (.cse2 (not (= |c_func_to_recursive_line_28_to_36_0_#in~z.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)))) (and (not (and .cse0 (= |c_func_to_recursive_line_28_to_36_0_#in~x.offset| 0) (= (select .cse1 0) 1) .cse2 (<= .cse3 2147483647))) .cse0 (= (select .cse1 |c_func_to_recursive_line_28_to_36_0_#in~x.offset|) 1) (exists ((|ULTIMATE.start_main_~#y~0#1.base| Int)) (let ((.cse4 (select (select |c_#memory_int| |ULTIMATE.start_main_~#y~0#1.base|) 0))) (and (not (= |c_func_to_recursive_line_28_to_36_0_#in~z.base| |ULTIMATE.start_main_~#y~0#1.base|)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (<= .cse4 2147483647) (= .cse4 .cse3)))) (<= 0 (+ .cse5 2147483648)) .cse6 (not (and (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_5 (Array Int Int)) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~#y~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse7 (store (store (store (store (store |c_#memory_int| |c_func_to_recursive_line_28_to_36_0_#in~x.base| v_DerPreprocessor_5) |ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_6) |ULTIMATE.start_main_~#c~0#1.base| v_DerPreprocessor_7) |c_func_to_recursive_line_28_to_36_0_#in~z.base| v_DerPreprocessor_8) |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_9))) (and (not (= |c_func_to_recursive_line_28_to_36_0_#in~z.base| |ULTIMATE.start_main_~#y~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~z.base|)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (= .cse1 (store (select .cse7 |c_func_to_recursive_line_28_to_36_0_#in~x.base|) |c_func_to_recursive_line_28_to_36_0_#in~x.offset| 1)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#c~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (not (= |c_func_to_recursive_line_28_to_36_0_#in~z.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= (select (select .cse7 |c_func_to_recursive_line_28_to_36_0_#in~z.base|) |c_func_to_recursive_line_28_to_36_0_#in~z.offset|) .cse5) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#y~0#1.base|))))) .cse6)) .cse2)))) is different from false [2024-11-08 23:44:37,217 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse6 (select |c_#memory_int| |c_func_to_recursive_line_28_to_36_0_#in~z.base|))) (let ((.cse3 (select .cse6 |c_func_to_recursive_line_28_to_36_0_#in~z.offset|))) (let ((.cse0 (select |c_#memory_int| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (.cse4 (<= .cse3 2147483647)) (.cse2 (select .cse6 0))) (and (= |c_func_to_recursive_line_28_to_36_0_#in~z.offset| 0) (= (select .cse0 |c_func_to_recursive_line_28_to_36_0_#in~x.offset|) 1) (exists ((|ULTIMATE.start_main_~#y~0#1.base| Int)) (let ((.cse1 (select (select |c_#memory_int| |ULTIMATE.start_main_~#y~0#1.base|) 0))) (and (not (= |c_func_to_recursive_line_28_to_36_0_#in~z.base| |ULTIMATE.start_main_~#y~0#1.base|)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (<= .cse1 2147483647) (= .cse1 .cse2)))) (<= 0 (+ .cse3 2147483648)) .cse4 (= |c_func_to_recursive_line_28_to_36_0_#in~x.offset| 0) (= (select .cse0 0) 1) (not (and (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_5 (Array Int Int)) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~#y~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse5 (store (store (store (store (store |c_#memory_int| |c_func_to_recursive_line_28_to_36_0_#in~x.base| v_DerPreprocessor_5) |ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_6) |ULTIMATE.start_main_~#c~0#1.base| v_DerPreprocessor_7) |c_func_to_recursive_line_28_to_36_0_#in~z.base| v_DerPreprocessor_8) |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_9))) (and (not (= |c_func_to_recursive_line_28_to_36_0_#in~z.base| |ULTIMATE.start_main_~#y~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~z.base|)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (= .cse0 (store (select .cse5 |c_func_to_recursive_line_28_to_36_0_#in~x.base|) |c_func_to_recursive_line_28_to_36_0_#in~x.offset| 1)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#c~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (not (= |c_func_to_recursive_line_28_to_36_0_#in~z.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= (select (select .cse5 |c_func_to_recursive_line_28_to_36_0_#in~z.base|) |c_func_to_recursive_line_28_to_36_0_#in~z.offset|) .cse3) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#y~0#1.base|))))) .cse4)) (not (= |c_func_to_recursive_line_28_to_36_0_#in~z.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (<= .cse2 2147483647)))))) is different from true [2024-11-08 23:44:37,226 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse8 (select |c_#memory_int| |c_func_to_recursive_line_28_to_36_0_#in~z.base|))) (let ((.cse5 (select .cse8 |c_func_to_recursive_line_28_to_36_0_#in~z.offset|))) (let ((.cse0 (= |c_func_to_recursive_line_28_to_36_0_#in~z.offset| 0)) (.cse3 (select .cse8 0)) (.cse1 (select |c_#memory_int| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (.cse6 (<= .cse5 2147483647)) (.cse2 (not (= |c_func_to_recursive_line_28_to_36_0_#in~z.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)))) (and (not (and .cse0 (= |c_func_to_recursive_line_28_to_36_0_#in~x.offset| 0) (= (select .cse1 0) 1) .cse2 (<= .cse3 2147483647))) .cse0 (= (select .cse1 |c_func_to_recursive_line_28_to_36_0_#in~x.offset|) 1) (exists ((|ULTIMATE.start_main_~#y~0#1.base| Int)) (let ((.cse4 (select (select |c_#memory_int| |ULTIMATE.start_main_~#y~0#1.base|) 0))) (and (not (= |c_func_to_recursive_line_28_to_36_0_#in~z.base| |ULTIMATE.start_main_~#y~0#1.base|)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (<= .cse4 2147483647) (= .cse4 .cse3)))) (<= 0 (+ .cse5 2147483648)) .cse6 (not (and (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_5 (Array Int Int)) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~#y~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse7 (store (store (store (store (store |c_#memory_int| |c_func_to_recursive_line_28_to_36_0_#in~x.base| v_DerPreprocessor_5) |ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_6) |ULTIMATE.start_main_~#c~0#1.base| v_DerPreprocessor_7) |c_func_to_recursive_line_28_to_36_0_#in~z.base| v_DerPreprocessor_8) |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_9))) (and (not (= |c_func_to_recursive_line_28_to_36_0_#in~z.base| |ULTIMATE.start_main_~#y~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~z.base|)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (= .cse1 (store (select .cse7 |c_func_to_recursive_line_28_to_36_0_#in~x.base|) |c_func_to_recursive_line_28_to_36_0_#in~x.offset| 1)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#c~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (not (= |c_func_to_recursive_line_28_to_36_0_#in~z.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= (select (select .cse7 |c_func_to_recursive_line_28_to_36_0_#in~z.base|) |c_func_to_recursive_line_28_to_36_0_#in~z.offset|) .cse5) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#y~0#1.base|))))) .cse6)) .cse2))))) is different from true [2024-11-08 23:44:37,252 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| c_func_to_recursive_line_28_to_36_0_~z.base))) (let ((.cse7 (select .cse8 0))) (let ((.cse1 (<= .cse7 2147483647)) (.cse2 (= c_func_to_recursive_line_28_to_36_0_~x.offset 0)) (.cse0 (= c_func_to_recursive_line_28_to_36_0_~z.offset 0)) (.cse3 (select .cse8 c_func_to_recursive_line_28_to_36_0_~z.offset)) (.cse5 (select |c_#memory_int| c_func_to_recursive_line_28_to_36_0_~x.base))) (and (not (and .cse0 .cse1 (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|) 0) 1) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)))) .cse2)) .cse0 .cse1 (not (and (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_5 (Array Int Int)) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~#y~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse4 (store (store (store (store (store |c_#memory_int| c_func_to_recursive_line_28_to_36_0_~x.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_6) |ULTIMATE.start_main_~#c~0#1.base| v_DerPreprocessor_7) c_func_to_recursive_line_28_to_36_0_~z.base v_DerPreprocessor_8) |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_9))) (and (not (= |ULTIMATE.start_main_~#y~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)) (not (= |ULTIMATE.start_main_~#y~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= .cse3 (select (select .cse4 c_func_to_recursive_line_28_to_36_0_~z.base) c_func_to_recursive_line_28_to_36_0_~z.offset)) (not (= |ULTIMATE.start_main_~#k~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (not (= |ULTIMATE.start_main_~#k~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)) (= .cse5 (store (select .cse4 c_func_to_recursive_line_28_to_36_0_~x.base) c_func_to_recursive_line_28_to_36_0_~x.offset 1)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#y~0#1.base|))))) (<= .cse3 2147483647))) .cse2 (= (select .cse5 c_func_to_recursive_line_28_to_36_0_~x.offset) 1) (not (and .cse0 (exists ((|ULTIMATE.start_main_~#y~0#1.base| Int)) (let ((.cse6 (select (select |c_#memory_int| |ULTIMATE.start_main_~#y~0#1.base|) 0))) (and (not (= |ULTIMATE.start_main_~#y~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)) (<= .cse6 2147483647) (not (= |ULTIMATE.start_main_~#y~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (= .cse6 .cse7)))))) (not (= c_func_to_recursive_line_28_to_36_0_~z.base c_func_to_recursive_line_28_to_36_0_~x.base)) (<= 0 (+ .cse3 2147483648)) (= (select .cse5 0) 1))))) is different from false [2024-11-08 23:44:37,702 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse8 (select |c_#memory_int| c_func_to_recursive_line_28_to_36_0_~z.base))) (let ((.cse7 (select .cse8 0))) (let ((.cse1 (<= .cse7 2147483647)) (.cse2 (= c_func_to_recursive_line_28_to_36_0_~x.offset 0)) (.cse0 (= c_func_to_recursive_line_28_to_36_0_~z.offset 0)) (.cse3 (select .cse8 c_func_to_recursive_line_28_to_36_0_~z.offset)) (.cse5 (select |c_#memory_int| c_func_to_recursive_line_28_to_36_0_~x.base))) (and (not (and .cse0 .cse1 (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|) 0) 1) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)))) .cse2)) .cse0 .cse1 (not (and (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_5 (Array Int Int)) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~#y~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse4 (store (store (store (store (store |c_#memory_int| c_func_to_recursive_line_28_to_36_0_~x.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_6) |ULTIMATE.start_main_~#c~0#1.base| v_DerPreprocessor_7) c_func_to_recursive_line_28_to_36_0_~z.base v_DerPreprocessor_8) |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_9))) (and (not (= |ULTIMATE.start_main_~#y~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)) (not (= |ULTIMATE.start_main_~#y~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= .cse3 (select (select .cse4 c_func_to_recursive_line_28_to_36_0_~z.base) c_func_to_recursive_line_28_to_36_0_~z.offset)) (not (= |ULTIMATE.start_main_~#k~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (not (= |ULTIMATE.start_main_~#k~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)) (= .cse5 (store (select .cse4 c_func_to_recursive_line_28_to_36_0_~x.base) c_func_to_recursive_line_28_to_36_0_~x.offset 1)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#y~0#1.base|))))) (<= .cse3 2147483647))) .cse2 (= (select .cse5 c_func_to_recursive_line_28_to_36_0_~x.offset) 1) (not (and .cse0 (exists ((|ULTIMATE.start_main_~#y~0#1.base| Int)) (let ((.cse6 (select (select |c_#memory_int| |ULTIMATE.start_main_~#y~0#1.base|) 0))) (and (not (= |ULTIMATE.start_main_~#y~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)) (<= .cse6 2147483647) (not (= |ULTIMATE.start_main_~#y~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (= .cse6 .cse7)))))) (not (= c_func_to_recursive_line_28_to_36_0_~z.base c_func_to_recursive_line_28_to_36_0_~x.base)) (<= 0 (+ .cse3 2147483648)) (= (select .cse5 0) 1)))))) is different from true [2024-11-08 23:44:38,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:44:38,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 78 states and 116 transitions. [2024-11-08 23:44:38,077 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 116 transitions. [2024-11-08 23:44:38,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 23:44:38,078 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:44:38,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:44:38,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:44:38,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:44:38,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-08 23:44:38,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:44:38,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:38,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:38,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:38,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 35 [2024-11-08 23:44:38,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:38,238 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-08 23:44:38,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 57 treesize of output 49 [2024-11-08 23:44:38,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2024-11-08 23:44:38,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-08 23:44:38,315 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:44:38,344 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| c_func_to_recursive_line_28_to_36_0_~z.base))) (let ((.cse0 (select .cse7 c_func_to_recursive_line_28_to_36_0_~z.offset))) (let ((.cse2 (select |c_#memory_int| c_func_to_recursive_line_28_to_36_0_~x.base)) (.cse3 (<= .cse0 2147483647)) (.cse4 (= c_func_to_recursive_line_28_to_36_0_~z.offset 0)) (.cse6 (select .cse7 0))) (and (not (and (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_5 (Array Int Int)) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~#y~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse1 (store (store (store (store (store |c_#memory_int| c_func_to_recursive_line_28_to_36_0_~x.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_6) |ULTIMATE.start_main_~#c~0#1.base| v_DerPreprocessor_7) c_func_to_recursive_line_28_to_36_0_~z.base v_DerPreprocessor_8) |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_9))) (and (not (= |ULTIMATE.start_main_~#y~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)) (not (= |ULTIMATE.start_main_~#y~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= .cse0 (select (select .cse1 c_func_to_recursive_line_28_to_36_0_~z.base) c_func_to_recursive_line_28_to_36_0_~z.offset)) (not (= |ULTIMATE.start_main_~#k~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (not (= |ULTIMATE.start_main_~#k~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)) (= .cse2 (store (select .cse1 c_func_to_recursive_line_28_to_36_0_~x.base) c_func_to_recursive_line_28_to_36_0_~x.offset 1)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#y~0#1.base|))))) .cse3)) (= (select .cse2 c_func_to_recursive_line_28_to_36_0_~x.offset) 1) (not (and .cse4 (exists ((|ULTIMATE.start_main_~#y~0#1.base| Int)) (let ((.cse5 (select (select |c_#memory_int| |ULTIMATE.start_main_~#y~0#1.base|) 0))) (and (not (= |ULTIMATE.start_main_~#y~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)) (<= .cse5 2147483647) (not (= |ULTIMATE.start_main_~#y~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (= .cse5 .cse6)))))) (not (= c_func_to_recursive_line_28_to_36_0_~z.base c_func_to_recursive_line_28_to_36_0_~x.base)) (<= 0 (+ .cse0 2147483648)) .cse3 (not (and .cse4 (<= .cse6 2147483647) (= c_func_to_recursive_line_28_to_36_0_~x.offset 0))))))) is different from false [2024-11-08 23:44:38,593 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse7 (select |c_#memory_int| c_func_to_recursive_line_28_to_36_0_~z.base))) (let ((.cse0 (select .cse7 c_func_to_recursive_line_28_to_36_0_~z.offset))) (let ((.cse2 (select |c_#memory_int| c_func_to_recursive_line_28_to_36_0_~x.base)) (.cse3 (<= .cse0 2147483647)) (.cse4 (= c_func_to_recursive_line_28_to_36_0_~z.offset 0)) (.cse6 (select .cse7 0))) (and (not (and (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_5 (Array Int Int)) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~#y~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse1 (store (store (store (store (store |c_#memory_int| c_func_to_recursive_line_28_to_36_0_~x.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_6) |ULTIMATE.start_main_~#c~0#1.base| v_DerPreprocessor_7) c_func_to_recursive_line_28_to_36_0_~z.base v_DerPreprocessor_8) |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_9))) (and (not (= |ULTIMATE.start_main_~#y~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)) (not (= |ULTIMATE.start_main_~#y~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= .cse0 (select (select .cse1 c_func_to_recursive_line_28_to_36_0_~z.base) c_func_to_recursive_line_28_to_36_0_~z.offset)) (not (= |ULTIMATE.start_main_~#k~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (not (= |ULTIMATE.start_main_~#k~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)) (= .cse2 (store (select .cse1 c_func_to_recursive_line_28_to_36_0_~x.base) c_func_to_recursive_line_28_to_36_0_~x.offset 1)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#y~0#1.base|))))) .cse3)) (= (select .cse2 c_func_to_recursive_line_28_to_36_0_~x.offset) 1) (not (and .cse4 (exists ((|ULTIMATE.start_main_~#y~0#1.base| Int)) (let ((.cse5 (select (select |c_#memory_int| |ULTIMATE.start_main_~#y~0#1.base|) 0))) (and (not (= |ULTIMATE.start_main_~#y~0#1.base| c_func_to_recursive_line_28_to_36_0_~x.base)) (<= .cse5 2147483647) (not (= |ULTIMATE.start_main_~#y~0#1.base| c_func_to_recursive_line_28_to_36_0_~z.base)) (= .cse5 .cse6)))))) (not (= c_func_to_recursive_line_28_to_36_0_~z.base c_func_to_recursive_line_28_to_36_0_~x.base)) (<= 0 (+ .cse0 2147483648)) .cse3 (not (and .cse4 (<= .cse6 2147483647) (= c_func_to_recursive_line_28_to_36_0_~x.offset 0)))))))) is different from true [2024-11-08 23:44:38,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:44:38,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 79 states and 120 transitions. [2024-11-08 23:44:38,847 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 120 transitions. [2024-11-08 23:44:38,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 23:44:38,848 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:44:38,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:44:38,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:44:38,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:44:38,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-08 23:44:38,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:44:38,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:38,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:38,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:38,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:38,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:38,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:38,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 37 [2024-11-08 23:44:39,012 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2024-11-08 23:44:39,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 53 [2024-11-08 23:44:39,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-11-08 23:44:39,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-08 23:44:39,075 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:44:39,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:44:39,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 79 states and 120 transitions. [2024-11-08 23:44:39,103 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 120 transitions. [2024-11-08 23:44:39,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 23:44:39,104 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:44:39,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:44:39,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:44:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:44:39,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-08 23:44:39,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:44:39,246 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 0 case distinctions, treesize of input 77 treesize of output 53 [2024-11-08 23:44:39,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:39,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:39,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:39,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:39,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:39,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:39,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:39,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:39,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:39,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:39,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:39,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:39,339 INFO L349 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2024-11-08 23:44:39,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 115 [2024-11-08 23:44:39,405 INFO L349 Elim1Store]: treesize reduction 41, result has 16.3 percent of original size [2024-11-08 23:44:39,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 258 treesize of output 256 [2024-11-08 23:44:39,472 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:44:39,499 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:44:39,688 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:44:39,786 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 23:44:39,787 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 155 [2024-11-08 23:44:39,900 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 23:44:39,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 21 [2024-11-08 23:44:50,622 WARN L286 SmtUtils]: Spent 10.16s on a formula simplification. DAG size of input: 68 DAG size of output: 28 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 23:44:51,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-08 23:44:51,167 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:44:51,173 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#z~0#1.base|) |c_ULTIMATE.start_main_~#z~0#1.offset|))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0#1.base|)) (.cse3 (<= .cse2 2147483647))) (and (= (select .cse0 0) 1) (not (and (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~#y~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse1 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_5) |ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_6) |ULTIMATE.start_main_~#c~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~#z~0#1.base| v_DerPreprocessor_8) |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_9))) (and (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_ULTIMATE.start_main_~#x~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_ULTIMATE.start_main_~#z~0#1.base|)) (= (select (select .cse1 |c_ULTIMATE.start_main_~#z~0#1.base|) |c_ULTIMATE.start_main_~#z~0#1.offset|) .cse2) (not (= |ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |ULTIMATE.start_main_~#y~0#1.base|)) (= (store (select .cse1 |c_ULTIMATE.start_main_~#x~0#1.base|) |c_ULTIMATE.start_main_~#x~0#1.offset| 1) .cse0) (not (= |ULTIMATE.start_main_~#c~0#1.base| |c_ULTIMATE.start_main_~#z~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |c_ULTIMATE.start_main_~#z~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#y~0#1.base|))))) .cse3)) (<= 0 (+ .cse2 2147483648)) (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |c_ULTIMATE.start_main_~#z~0#1.base|)) (= |c_ULTIMATE.start_main_~#x~0#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_main_~#x~0#1.offset|) 1) (exists ((|ULTIMATE.start_main_~#y~0#1.base| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#y~0#1.base|) 0) 1) (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |ULTIMATE.start_main_~#y~0#1.base|)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |c_ULTIMATE.start_main_~#z~0#1.base|)))) .cse3))) is different from false [2024-11-08 23:44:51,419 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#z~0#1.base|) |c_ULTIMATE.start_main_~#z~0#1.offset|))) (let ((.cse4 (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |c_ULTIMATE.start_main_~#z~0#1.base|))) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0#1.base|)) (.cse3 (<= .cse1 2147483647))) (and (not (and (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~#y~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse0 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_5) |ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_6) |ULTIMATE.start_main_~#c~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~#z~0#1.base| v_DerPreprocessor_8) |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_9))) (and (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_ULTIMATE.start_main_~#x~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_ULTIMATE.start_main_~#z~0#1.base|)) (= (select (select .cse0 |c_ULTIMATE.start_main_~#z~0#1.base|) |c_ULTIMATE.start_main_~#z~0#1.offset|) .cse1) (not (= |ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |ULTIMATE.start_main_~#y~0#1.base|)) (= (store (select .cse0 |c_ULTIMATE.start_main_~#x~0#1.base|) |c_ULTIMATE.start_main_~#x~0#1.offset| 1) .cse2) (not (= |ULTIMATE.start_main_~#c~0#1.base| |c_ULTIMATE.start_main_~#z~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |c_ULTIMATE.start_main_~#z~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#y~0#1.base|))))) .cse3)) (<= 0 (+ .cse1 2147483648)) .cse4 (not (and (= (select .cse2 0) 1) .cse4 (= |c_ULTIMATE.start_main_~#x~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#y~0#1.base| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#y~0#1.base|) 0) 1) (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |ULTIMATE.start_main_~#y~0#1.base|)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |c_ULTIMATE.start_main_~#z~0#1.base|)))) .cse3)) (= (select .cse2 |c_ULTIMATE.start_main_~#x~0#1.offset|) 1) .cse3))) is different from false [2024-11-08 23:44:51,432 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#z~0#1.base|) |c_ULTIMATE.start_main_~#z~0#1.offset|))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0#1.base|)) (.cse3 (<= .cse2 2147483647))) (and (= (select .cse0 0) 1) (not (and (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~#y~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse1 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_5) |ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_6) |ULTIMATE.start_main_~#c~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~#z~0#1.base| v_DerPreprocessor_8) |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_9))) (and (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_ULTIMATE.start_main_~#x~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_ULTIMATE.start_main_~#z~0#1.base|)) (= (select (select .cse1 |c_ULTIMATE.start_main_~#z~0#1.base|) |c_ULTIMATE.start_main_~#z~0#1.offset|) .cse2) (not (= |ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |ULTIMATE.start_main_~#y~0#1.base|)) (= (store (select .cse1 |c_ULTIMATE.start_main_~#x~0#1.base|) |c_ULTIMATE.start_main_~#x~0#1.offset| 1) .cse0) (not (= |ULTIMATE.start_main_~#c~0#1.base| |c_ULTIMATE.start_main_~#z~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |c_ULTIMATE.start_main_~#z~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#y~0#1.base|))))) .cse3)) (<= 0 (+ .cse2 2147483648)) (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |c_ULTIMATE.start_main_~#z~0#1.base|)) (= |c_ULTIMATE.start_main_~#x~0#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_main_~#x~0#1.offset|) 1) (exists ((|ULTIMATE.start_main_~#y~0#1.base| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#y~0#1.base|) 0) 1) (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |ULTIMATE.start_main_~#y~0#1.base|)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |c_ULTIMATE.start_main_~#z~0#1.base|)))) .cse3)))) is different from true [2024-11-08 23:44:51,452 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#z~0#1.base|) |c_ULTIMATE.start_main_~#z~0#1.offset|))) (let ((.cse4 (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |c_ULTIMATE.start_main_~#z~0#1.base|))) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0#1.base|)) (.cse3 (<= .cse1 2147483647))) (and (not (and (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~#y~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse0 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_5) |ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_6) |ULTIMATE.start_main_~#c~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~#z~0#1.base| v_DerPreprocessor_8) |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_9))) (and (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_ULTIMATE.start_main_~#x~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_ULTIMATE.start_main_~#z~0#1.base|)) (= (select (select .cse0 |c_ULTIMATE.start_main_~#z~0#1.base|) |c_ULTIMATE.start_main_~#z~0#1.offset|) .cse1) (not (= |ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |ULTIMATE.start_main_~#y~0#1.base|)) (= (store (select .cse0 |c_ULTIMATE.start_main_~#x~0#1.base|) |c_ULTIMATE.start_main_~#x~0#1.offset| 1) .cse2) (not (= |ULTIMATE.start_main_~#c~0#1.base| |c_ULTIMATE.start_main_~#z~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |c_ULTIMATE.start_main_~#z~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#y~0#1.base|))))) .cse3)) (<= 0 (+ .cse1 2147483648)) .cse4 (not (and (= (select .cse2 0) 1) .cse4 (= |c_ULTIMATE.start_main_~#x~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#y~0#1.base| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#y~0#1.base|) 0) 1) (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |ULTIMATE.start_main_~#y~0#1.base|)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |c_ULTIMATE.start_main_~#z~0#1.base|)))) .cse3)) (= (select .cse2 |c_ULTIMATE.start_main_~#x~0#1.offset|) 1) .cse3)))) is different from true [2024-11-08 23:44:51,465 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_func_to_recursive_line_28_to_36_0_#in~z.base|))) (let ((.cse3 (select .cse1 |c_func_to_recursive_line_28_to_36_0_#in~z.offset|))) (let ((.cse2 (select |c_#memory_int| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (.cse4 (<= .cse3 2147483647))) (and (exists ((|ULTIMATE.start_main_~#y~0#1.base| Int)) (and (not (= |c_func_to_recursive_line_28_to_36_0_#in~z.base| |ULTIMATE.start_main_~#y~0#1.base|)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#y~0#1.base|) 0) 1))) (not (and (= |c_func_to_recursive_line_28_to_36_0_#in~z.offset| 0) (exists ((|ULTIMATE.start_main_~#y~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~#y~0#1.base|) 0))) (and (not (= |c_func_to_recursive_line_28_to_36_0_#in~z.base| |ULTIMATE.start_main_~#y~0#1.base|)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (<= .cse0 2147483647) (= .cse0 (select .cse1 0))))))) (= (select .cse2 |c_func_to_recursive_line_28_to_36_0_#in~x.offset|) 1) (<= 0 (+ .cse3 2147483648)) .cse4 (= |c_func_to_recursive_line_28_to_36_0_#in~x.offset| 0) (= (select .cse2 0) 1) (not (and (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_5 (Array Int Int)) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~#y~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse5 (store (store (store (store (store |c_#memory_int| |c_func_to_recursive_line_28_to_36_0_#in~x.base| v_DerPreprocessor_5) |ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_6) |ULTIMATE.start_main_~#c~0#1.base| v_DerPreprocessor_7) |c_func_to_recursive_line_28_to_36_0_#in~z.base| v_DerPreprocessor_8) |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_9))) (and (not (= |c_func_to_recursive_line_28_to_36_0_#in~z.base| |ULTIMATE.start_main_~#y~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~z.base|)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (= .cse2 (store (select .cse5 |c_func_to_recursive_line_28_to_36_0_#in~x.base|) |c_func_to_recursive_line_28_to_36_0_#in~x.offset| 1)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#c~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (not (= |c_func_to_recursive_line_28_to_36_0_#in~z.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= (select (select .cse5 |c_func_to_recursive_line_28_to_36_0_#in~z.base|) |c_func_to_recursive_line_28_to_36_0_#in~z.offset|) .cse3) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#y~0#1.base|))))) .cse4)) (not (= |c_func_to_recursive_line_28_to_36_0_#in~z.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)))))) is different from false [2024-11-08 23:44:51,973 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 (select |c_#memory_int| |c_func_to_recursive_line_28_to_36_0_#in~z.base|))) (let ((.cse3 (select .cse1 |c_func_to_recursive_line_28_to_36_0_#in~z.offset|))) (let ((.cse2 (select |c_#memory_int| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (.cse4 (<= .cse3 2147483647))) (and (exists ((|ULTIMATE.start_main_~#y~0#1.base| Int)) (and (not (= |c_func_to_recursive_line_28_to_36_0_#in~z.base| |ULTIMATE.start_main_~#y~0#1.base|)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#y~0#1.base|) 0) 1))) (not (and (= |c_func_to_recursive_line_28_to_36_0_#in~z.offset| 0) (exists ((|ULTIMATE.start_main_~#y~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~#y~0#1.base|) 0))) (and (not (= |c_func_to_recursive_line_28_to_36_0_#in~z.base| |ULTIMATE.start_main_~#y~0#1.base|)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (<= .cse0 2147483647) (= .cse0 (select .cse1 0))))))) (= (select .cse2 |c_func_to_recursive_line_28_to_36_0_#in~x.offset|) 1) (<= 0 (+ .cse3 2147483648)) .cse4 (= |c_func_to_recursive_line_28_to_36_0_#in~x.offset| 0) (= (select .cse2 0) 1) (not (and (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_5 (Array Int Int)) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~#y~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse5 (store (store (store (store (store |c_#memory_int| |c_func_to_recursive_line_28_to_36_0_#in~x.base| v_DerPreprocessor_5) |ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_6) |ULTIMATE.start_main_~#c~0#1.base| v_DerPreprocessor_7) |c_func_to_recursive_line_28_to_36_0_#in~z.base| v_DerPreprocessor_8) |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_9))) (and (not (= |c_func_to_recursive_line_28_to_36_0_#in~z.base| |ULTIMATE.start_main_~#y~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~z.base|)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (= .cse2 (store (select .cse5 |c_func_to_recursive_line_28_to_36_0_#in~x.base|) |c_func_to_recursive_line_28_to_36_0_#in~x.offset| 1)) (not (= |ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#c~0#1.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|)) (not (= |c_func_to_recursive_line_28_to_36_0_#in~z.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= (select (select .cse5 |c_func_to_recursive_line_28_to_36_0_#in~z.base|) |c_func_to_recursive_line_28_to_36_0_#in~z.offset|) .cse3) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#y~0#1.base|))))) .cse4)) (not (= |c_func_to_recursive_line_28_to_36_0_#in~z.base| |c_func_to_recursive_line_28_to_36_0_#in~x.base|))))))) is different from true [2024-11-08 23:44:52,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:44:52,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 81 states and 136 transitions. [2024-11-08 23:44:52,574 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 136 transitions. [2024-11-08 23:44:52,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 23:44:52,575 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:44:52,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:44:52,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:44:52,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:44:52,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-08 23:44:52,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:44:52,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:52,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:52,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:52,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:52,860 INFO L349 Elim1Store]: treesize reduction 40, result has 35.5 percent of original size [2024-11-08 23:44:52,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 192 treesize of output 155 [2024-11-08 23:44:52,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:53,023 INFO L349 Elim1Store]: treesize reduction 26, result has 36.6 percent of original size [2024-11-08 23:44:53,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 520 treesize of output 512 [2024-11-08 23:44:53,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:53,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:53,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:53,167 INFO L349 Elim1Store]: treesize reduction 39, result has 31.6 percent of original size [2024-11-08 23:44:53,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 98 treesize of output 96 [2024-11-08 23:44:53,182 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 23:44:53,185 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 204 [2024-11-08 23:44:53,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:53,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:53,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:53,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:53,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:53,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:53,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:53,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:53,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:53,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:53,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:53,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:53,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 232 [2024-11-08 23:44:53,266 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 22 treesize of output 16 [2024-11-08 23:44:53,303 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:44:53,329 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 9 treesize of output 7 [2024-11-08 23:44:53,463 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:44:53,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:53,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:53,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:53,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:53,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:53,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 50 [2024-11-08 23:44:53,934 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 23:44:53,937 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 98 [2024-11-08 23:44:54,044 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-08 23:44:54,045 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 137 treesize of output 146 [2024-11-08 23:44:54,240 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 0 case distinctions, treesize of input 119 treesize of output 119 [2024-11-08 23:44:54,485 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2024-11-08 23:44:54,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:54,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:54,653 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2024-11-08 23:44:54,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 129 [2024-11-08 23:44:54,666 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 23:44:54,668 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 192 [2024-11-08 23:44:54,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:54,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:54,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:54,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:54,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:54,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:54,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:54,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:54,954 INFO L349 Elim1Store]: treesize reduction 62, result has 36.1 percent of original size [2024-11-08 23:44:54,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 188 treesize of output 207 [2024-11-08 23:44:54,973 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 23:44:54,975 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 187 [2024-11-08 23:44:55,127 INFO L349 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2024-11-08 23:44:55,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 258 treesize of output 250 [2024-11-08 23:44:55,185 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 9 treesize of output 7 [2024-11-08 23:44:55,522 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-08 23:44:55,577 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-08 23:44:55,711 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 38 [2024-11-08 23:44:55,712 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-08 23:44:55,960 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-08 23:44:55,970 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-08 23:44:56,028 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-08 23:44:56,041 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-08 23:44:56,082 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-08 23:44:56,111 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-08 23:44:56,145 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-08 23:44:56,149 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-08 23:44:56,188 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-08 23:44:56,212 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-08 23:44:56,260 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-08 23:44:56,264 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-08 23:44:56,289 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-08 23:44:56,315 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-08 23:44:56,348 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-08 23:44:56,351 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-08 23:44:56,374 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-08 23:44:56,405 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-08 23:44:56,424 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-08 23:44:56,431 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-08 23:44:56,461 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-08 23:44:56,504 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-08 23:44:56,516 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-08 23:44:56,567 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-08 23:44:56,571 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-08 23:44:56,596 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-08 23:44:56,624 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-08 23:44:56,698 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-08 23:44:56,703 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-08 23:44:56,801 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-08 23:44:56,806 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-08 23:44:56,839 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-08 23:44:56,877 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-08 23:44:57,237 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-08 23:44:57,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:57,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:57,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:57,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:57,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:57,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:57,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:57,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:44:57,538 INFO L190 IndexEqualityManager]: detected not equals via solver