./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-patterns/array5_pattern.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f 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_7c91b43b-5642-4eb8-b9d7-a98b90749628/bin/ukojak-CydTVMUXoH/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c91b43b-5642-4eb8-b9d7-a98b90749628/bin/ukojak-CydTVMUXoH/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c91b43b-5642-4eb8-b9d7-a98b90749628/bin/ukojak-CydTVMUXoH/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c91b43b-5642-4eb8-b9d7-a98b90749628/bin/ukojak-CydTVMUXoH/config/KojakReach.xml -i ../../sv-benchmarks/c/array-patterns/array5_pattern.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c91b43b-5642-4eb8-b9d7-a98b90749628/bin/ukojak-CydTVMUXoH/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c91b43b-5642-4eb8-b9d7-a98b90749628/bin/ukojak-CydTVMUXoH --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3dd3ea9d30e76cbd39a744e53feb2b89c359b5b85c7df24161ceaf060cda3b02 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 08:12:39,388 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 08:12:39,391 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 08:12:39,430 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 08:12:39,430 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 08:12:39,431 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 08:12:39,432 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 08:12:39,434 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 08:12:39,441 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 08:12:39,448 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 08:12:39,449 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 08:12:39,453 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 08:12:39,453 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 08:12:39,456 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 08:12:39,459 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 08:12:39,461 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 08:12:39,463 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 08:12:39,464 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 08:12:39,467 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 08:12:39,472 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 08:12:39,473 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 08:12:39,475 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 08:12:39,478 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 08:12:39,479 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 08:12:39,487 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 08:12:39,487 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 08:12:39,488 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 08:12:39,489 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 08:12:39,489 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 08:12:39,490 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 08:12:39,490 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 08:12:39,491 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 08:12:39,492 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 08:12:39,493 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 08:12:39,494 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 08:12:39,494 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 08:12:39,494 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 08:12:39,495 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 08:12:39,499 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 08:12:39,499 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 08:12:39,500 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 08:12:39,501 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c91b43b-5642-4eb8-b9d7-a98b90749628/bin/ukojak-CydTVMUXoH/config/svcomp-Reach-32bit-Kojak_Default.epf [2022-11-16 08:12:39,537 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 08:12:39,537 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 08:12:39,539 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 08:12:39,539 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2022-11-16 08:12:39,540 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 08:12:39,540 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 08:12:39,540 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 08:12:39,540 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 08:12:39,540 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 08:12:39,540 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 08:12:39,541 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 08:12:39,542 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 08:12:39,542 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 08:12:39,542 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 08:12:39,542 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 08:12:39,542 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 08:12:39,543 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 08:12:39,543 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 08:12:39,543 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2022-11-16 08:12:39,543 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2022-11-16 08:12:39,543 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 08:12:39,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-11-16 08:12:39,544 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 08:12:39,544 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 08:12:39,544 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 08:12:39,544 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2022-11-16 08:12:39,546 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 08:12:39,546 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 08:12:39,546 INFO L138 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_7c91b43b-5642-4eb8-b9d7-a98b90749628/bin/ukojak-CydTVMUXoH/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_7c91b43b-5642-4eb8-b9d7-a98b90749628/bin/ukojak-CydTVMUXoH Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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 -> 3dd3ea9d30e76cbd39a744e53feb2b89c359b5b85c7df24161ceaf060cda3b02 [2022-11-16 08:12:39,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 08:12:39,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 08:12:39,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 08:12:39,856 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 08:12:39,858 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 08:12:39,859 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c91b43b-5642-4eb8-b9d7-a98b90749628/bin/ukojak-CydTVMUXoH/../../sv-benchmarks/c/array-patterns/array5_pattern.c [2022-11-16 08:12:39,955 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c91b43b-5642-4eb8-b9d7-a98b90749628/bin/ukojak-CydTVMUXoH/data/64c8fcfd4/c2e340d033d748a893397bfa8e7fb4f2/FLAGdbcb4abf7 [2022-11-16 08:12:40,476 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 08:12:40,477 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c91b43b-5642-4eb8-b9d7-a98b90749628/sv-benchmarks/c/array-patterns/array5_pattern.c [2022-11-16 08:12:40,483 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c91b43b-5642-4eb8-b9d7-a98b90749628/bin/ukojak-CydTVMUXoH/data/64c8fcfd4/c2e340d033d748a893397bfa8e7fb4f2/FLAGdbcb4abf7 [2022-11-16 08:12:40,859 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c91b43b-5642-4eb8-b9d7-a98b90749628/bin/ukojak-CydTVMUXoH/data/64c8fcfd4/c2e340d033d748a893397bfa8e7fb4f2 [2022-11-16 08:12:40,863 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 08:12:40,864 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 08:12:40,866 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 08:12:40,866 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 08:12:40,869 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 08:12:40,870 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:12:40" (1/1) ... [2022-11-16 08:12:40,871 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@216ff01e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:12:40, skipping insertion in model container [2022-11-16 08:12:40,872 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:12:40" (1/1) ... [2022-11-16 08:12:40,883 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 08:12:40,906 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 08:12:41,090 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c91b43b-5642-4eb8-b9d7-a98b90749628/sv-benchmarks/c/array-patterns/array5_pattern.c[1890,1903] [2022-11-16 08:12:41,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 08:12:41,120 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 08:12:41,133 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c91b43b-5642-4eb8-b9d7-a98b90749628/sv-benchmarks/c/array-patterns/array5_pattern.c[1890,1903] [2022-11-16 08:12:41,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 08:12:41,171 INFO L208 MainTranslator]: Completed translation [2022-11-16 08:12:41,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:12:41 WrapperNode [2022-11-16 08:12:41,172 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 08:12:41,174 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 08:12:41,174 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 08:12:41,175 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 08:12:41,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:12:41" (1/1) ... [2022-11-16 08:12:41,200 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:12:41" (1/1) ... [2022-11-16 08:12:41,228 INFO L138 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 85 [2022-11-16 08:12:41,229 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 08:12:41,230 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 08:12:41,230 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 08:12:41,230 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 08:12:41,239 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:12:41" (1/1) ... [2022-11-16 08:12:41,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:12:41" (1/1) ... [2022-11-16 08:12:41,242 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:12:41" (1/1) ... [2022-11-16 08:12:41,242 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:12:41" (1/1) ... [2022-11-16 08:12:41,247 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:12:41" (1/1) ... [2022-11-16 08:12:41,250 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:12:41" (1/1) ... [2022-11-16 08:12:41,252 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:12:41" (1/1) ... [2022-11-16 08:12:41,253 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:12:41" (1/1) ... [2022-11-16 08:12:41,255 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 08:12:41,263 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 08:12:41,263 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 08:12:41,264 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 08:12:41,265 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:12:41" (1/1) ... [2022-11-16 08:12:41,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-11-16 08:12:41,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c91b43b-5642-4eb8-b9d7-a98b90749628/bin/ukojak-CydTVMUXoH/z3 [2022-11-16 08:12:41,298 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c91b43b-5642-4eb8-b9d7-a98b90749628/bin/ukojak-CydTVMUXoH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2022-11-16 08:12:41,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c91b43b-5642-4eb8-b9d7-a98b90749628/bin/ukojak-CydTVMUXoH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2022-11-16 08:12:41,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 08:12:41,350 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-16 08:12:41,350 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-16 08:12:41,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 08:12:41,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 08:12:41,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 08:12:41,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 08:12:41,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 08:12:41,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 08:12:41,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 08:12:41,438 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 08:12:41,440 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 08:12:41,642 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 08:12:41,772 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 08:12:41,773 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-16 08:12:41,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:12:41 BoogieIcfgContainer [2022-11-16 08:12:41,775 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 08:12:41,776 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2022-11-16 08:12:41,776 INFO L271 PluginConnector]: Initializing CodeCheck... [2022-11-16 08:12:41,799 INFO L275 PluginConnector]: CodeCheck initialized [2022-11-16 08:12:41,799 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:12:41" (1/1) ... [2022-11-16 08:12:41,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 08:12:41,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:12:41,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 17 states and 22 transitions. [2022-11-16 08:12:41,882 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2022-11-16 08:12:41,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 08:12:41,887 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:12:41,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:12:42,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:12:42,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:12:42,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:12:42,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 17 states and 20 transitions. [2022-11-16 08:12:42,179 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-11-16 08:12:42,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 08:12:42,179 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:12:42,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:12:42,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:12:42,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 08:12:42,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:12:42,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 08:12:42,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:12:42,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 19 states and 25 transitions. [2022-11-16 08:12:42,510 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2022-11-16 08:12:42,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 08:12:42,511 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:12:42,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:12:42,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:12:42,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 08:12:42,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:12:42,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:12:43,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:12:43,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 26 states and 39 transitions. [2022-11-16 08:12:43,060 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 39 transitions. [2022-11-16 08:12:43,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:12:43,063 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:12:43,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:12:43,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:12:43,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-16 08:12:43,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:12:43,323 INFO L350 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 10 treesize of output 8 [2022-11-16 08:12:43,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:12:43,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:12:43,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:12:43,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:12:43,866 INFO L350 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 12 treesize of output 11 [2022-11-16 08:12:43,879 INFO L350 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 12 treesize of output 13 [2022-11-16 08:12:44,138 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:12:44,156 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:12:44,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:12:44,166 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:12:45,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:12:45,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 30 states and 55 transitions. [2022-11-16 08:12:45,859 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 55 transitions. [2022-11-16 08:12:45,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:12:45,860 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:12:45,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:12:45,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:12:45,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-16 08:12:45,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:12:45,966 INFO L350 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 10 treesize of output 8 [2022-11-16 08:12:45,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:12:45,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-16 08:12:46,003 INFO L350 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 [2022-11-16 08:12:46,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-16 08:12:46,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:12:46,521 INFO L321 Elim1Store]: treesize reduction 60, result has 46.9 percent of original size [2022-11-16 08:12:46,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 107 treesize of output 150 [2022-11-16 08:12:46,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:12:46,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 43 [2022-11-16 08:12:46,558 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:12:46,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2022-11-16 08:12:46,575 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:12:46,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-11-16 08:12:46,658 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:12:46,661 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 102 [2022-11-16 08:12:47,516 INFO L321 Elim1Store]: treesize reduction 124, result has 40.7 percent of original size [2022-11-16 08:12:47,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 190 treesize of output 210 [2022-11-16 08:12:47,539 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:12:47,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 115 [2022-11-16 08:12:47,559 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:12:47,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 105 [2022-11-16 08:12:48,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:12:49,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:12:49,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 33 states and 63 transitions. [2022-11-16 08:12:49,893 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 63 transitions. [2022-11-16 08:12:49,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:12:49,894 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:12:49,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:12:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:12:49,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-16 08:12:49,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:12:50,044 INFO L350 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 10 treesize of output 8 [2022-11-16 08:12:50,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:12:50,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:12:50,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:12:50,520 INFO L350 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 12 treesize of output 13 [2022-11-16 08:12:50,525 INFO L350 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 12 treesize of output 11 [2022-11-16 08:12:50,541 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:12:50,543 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:12:50,814 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:12:50,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 38 treesize of output 20 [2022-11-16 08:12:50,826 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:12:52,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:12:52,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 36 states and 80 transitions. [2022-11-16 08:12:52,285 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 80 transitions. [2022-11-16 08:12:52,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:12:52,285 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:12:52,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:12:52,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:12:52,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:12:52,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:12:52,397 INFO L350 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 10 treesize of output 8 [2022-11-16 08:12:52,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:12:52,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:12:52,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:12:52,545 INFO L350 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 12 treesize of output 11 [2022-11-16 08:12:52,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:12:52,628 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:12:52,643 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:12:52,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:12:52,650 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:12:52,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:12:52,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 36 states and 80 transitions. [2022-11-16 08:12:52,677 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 80 transitions. [2022-11-16 08:12:52,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:12:52,678 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:12:52,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:12:52,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:12:52,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 55 conjunts are in the unsatisfiable core [2022-11-16 08:12:52,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:12:52,769 INFO L350 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 10 treesize of output 8 [2022-11-16 08:12:52,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:12:52,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:12:53,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:12:53,010 INFO L350 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 12 treesize of output 13 [2022-11-16 08:12:53,015 INFO L350 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 12 treesize of output 11 [2022-11-16 08:12:53,029 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:12:53,031 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:12:53,097 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:12:53,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 38 treesize of output 20 [2022-11-16 08:12:53,104 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:12:53,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:12:53,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 36 states and 80 transitions. [2022-11-16 08:12:53,201 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 80 transitions. [2022-11-16 08:12:53,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:12:53,203 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:12:53,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:12:53,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:12:53,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-16 08:12:53,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:12:53,333 INFO L350 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 10 treesize of output 8 [2022-11-16 08:12:53,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:12:53,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-16 08:12:53,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 20 [2022-11-16 08:12:53,364 INFO L350 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 [2022-11-16 08:12:53,371 INFO L350 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 [2022-11-16 08:12:53,700 INFO L321 Elim1Store]: treesize reduction 60, result has 46.9 percent of original size [2022-11-16 08:12:53,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 107 treesize of output 150 [2022-11-16 08:12:53,714 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:12:53,715 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 88 [2022-11-16 08:12:53,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:12:53,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 37 [2022-11-16 08:12:53,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:12:53,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 9 [2022-11-16 08:12:53,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:12:53,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 7 [2022-11-16 08:12:54,903 INFO L321 Elim1Store]: treesize reduction 124, result has 40.7 percent of original size [2022-11-16 08:12:54,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 180 treesize of output 200 [2022-11-16 08:12:54,922 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:12:54,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 117 [2022-11-16 08:12:54,940 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:12:54,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 105 [2022-11-16 08:12:55,521 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:12:58,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:12:58,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 39 states and 101 transitions. [2022-11-16 08:12:58,215 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 101 transitions. [2022-11-16 08:12:58,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:12:58,216 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:12:58,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:12:58,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:12:58,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-16 08:12:58,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:12:58,301 INFO L350 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 10 treesize of output 8 [2022-11-16 08:12:58,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:12:58,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:12:58,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:12:58,408 INFO L350 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 12 treesize of output 11 [2022-11-16 08:12:58,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:12:58,501 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:12:58,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 38 treesize of output 20 [2022-11-16 08:12:58,508 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:12:58,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:12:58,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 39 states and 101 transitions. [2022-11-16 08:12:58,540 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 101 transitions. [2022-11-16 08:12:58,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:12:58,545 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:12:58,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:12:58,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:12:58,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-16 08:12:58,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:12:58,654 INFO L350 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 10 treesize of output 8 [2022-11-16 08:12:58,748 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:12:58,750 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:12:58,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:12:58,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:12:58,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:12:58,770 INFO L350 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 12 treesize of output 11 [2022-11-16 08:12:58,774 INFO L350 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 12 treesize of output 13 [2022-11-16 08:12:58,849 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:12:58,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 38 treesize of output 20 [2022-11-16 08:12:58,860 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:12:58,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:12:58,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 39 states and 101 transitions. [2022-11-16 08:12:58,902 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 101 transitions. [2022-11-16 08:12:58,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:12:58,905 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:12:58,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:12:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:12:58,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-16 08:12:58,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:12:58,999 INFO L350 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 10 treesize of output 8 [2022-11-16 08:12:59,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:12:59,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-16 08:12:59,116 INFO L350 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 [2022-11-16 08:12:59,786 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:12:59,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 95 [2022-11-16 08:12:59,807 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:12:59,808 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2022-11-16 08:13:00,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:00,240 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:00,248 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-16 08:13:00,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 28 [2022-11-16 08:13:00,256 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:01,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:01,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 39 states and 101 transitions. [2022-11-16 08:13:01,318 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 101 transitions. [2022-11-16 08:13:01,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:01,319 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:01,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:01,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:01,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 55 conjunts are in the unsatisfiable core [2022-11-16 08:13:01,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:01,409 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:01,554 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:01,556 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:13:01,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:01,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:13:01,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:13:01,572 INFO L350 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 12 treesize of output 11 [2022-11-16 08:13:01,576 INFO L350 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 12 treesize of output 13 [2022-11-16 08:13:01,644 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:13:01,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 38 treesize of output 20 [2022-11-16 08:13:01,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:01,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:01,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 39 states and 101 transitions. [2022-11-16 08:13:01,693 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 101 transitions. [2022-11-16 08:13:01,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:01,694 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:01,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:01,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:01,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-16 08:13:01,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:01,792 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:01,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:01,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 83 [2022-11-16 08:13:01,951 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:13:01,952 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 74 [2022-11-16 08:13:01,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 106 [2022-11-16 08:13:01,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:01,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 98 [2022-11-16 08:13:01,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:01,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 25 treesize of output 47 [2022-11-16 08:13:02,013 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:13:02,014 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 95 [2022-11-16 08:13:02,035 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-11-16 08:13:02,495 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 08:13:02,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 124 [2022-11-16 08:13:02,503 INFO L350 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 75 treesize of output 71 [2022-11-16 08:13:02,509 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:13:02,511 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 73 [2022-11-16 08:13:02,557 INFO L321 Elim1Store]: treesize reduction 92, result has 24.0 percent of original size [2022-11-16 08:13:02,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 107 [2022-11-16 08:13:02,584 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:02,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 18 [2022-11-16 08:13:02,596 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:02,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:02,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 39 states and 101 transitions. [2022-11-16 08:13:02,984 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 101 transitions. [2022-11-16 08:13:02,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:02,984 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:02,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:03,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:03,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-16 08:13:03,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:03,065 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:03,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:03,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:13:03,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:13:03,180 INFO L350 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 12 treesize of output 11 [2022-11-16 08:13:03,184 INFO L350 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 12 treesize of output 13 [2022-11-16 08:13:03,197 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:03,204 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:13:03,261 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:13:03,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 38 treesize of output 20 [2022-11-16 08:13:03,268 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:03,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:03,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 39 states and 101 transitions. [2022-11-16 08:13:03,304 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 101 transitions. [2022-11-16 08:13:03,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:03,305 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:03,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:03,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:13:03,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:03,381 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:03,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:03,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:13:03,508 INFO L350 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 12 treesize of output 11 [2022-11-16 08:13:03,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:13:03,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:13:03,578 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:03,597 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:13:03,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:13:03,603 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:03,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:03,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 39 states and 101 transitions. [2022-11-16 08:13:03,637 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 101 transitions. [2022-11-16 08:13:03,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:03,638 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:03,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:03,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-16 08:13:03,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:03,747 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:03,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:03,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-16 08:13:03,768 INFO L350 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 [2022-11-16 08:13:04,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 78 [2022-11-16 08:13:04,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 66 [2022-11-16 08:13:04,470 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:04,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2022-11-16 08:13:04,478 INFO L350 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 12 treesize of output 11 [2022-11-16 08:13:04,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2022-11-16 08:13:04,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:04,716 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:04,721 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-16 08:13:04,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 28 [2022-11-16 08:13:04,728 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:05,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:05,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 39 states and 101 transitions. [2022-11-16 08:13:05,388 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 101 transitions. [2022-11-16 08:13:05,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:05,389 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:05,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:05,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:05,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:13:05,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:05,470 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:05,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:05,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:13:05,578 INFO L350 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 12 treesize of output 11 [2022-11-16 08:13:05,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:13:05,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:13:05,644 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:05,659 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:13:05,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:13:05,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:05,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:05,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 39 states and 101 transitions. [2022-11-16 08:13:05,712 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 101 transitions. [2022-11-16 08:13:05,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:05,712 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:05,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:05,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:05,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-16 08:13:05,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:05,820 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:05,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:05,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-16 08:13:05,840 INFO L350 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 [2022-11-16 08:13:05,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-16 08:13:06,154 INFO L321 Elim1Store]: treesize reduction 60, result has 46.9 percent of original size [2022-11-16 08:13:06,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 107 treesize of output 150 [2022-11-16 08:13:06,202 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:13:06,204 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 88 [2022-11-16 08:13:06,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:06,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 37 [2022-11-16 08:13:06,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:06,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 7 [2022-11-16 08:13:06,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:06,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 9 [2022-11-16 08:13:07,479 INFO L321 Elim1Store]: treesize reduction 124, result has 40.7 percent of original size [2022-11-16 08:13:07,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 180 treesize of output 200 [2022-11-16 08:13:07,498 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:13:07,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 111 [2022-11-16 08:13:07,515 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:13:07,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 105 [2022-11-16 08:13:08,043 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:08,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:08,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 39 states and 101 transitions. [2022-11-16 08:13:08,740 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 101 transitions. [2022-11-16 08:13:08,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:08,740 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:08,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:08,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:08,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:13:08,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:08,816 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:08,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:08,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:13:08,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:13:08,921 INFO L350 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 12 treesize of output 11 [2022-11-16 08:13:08,925 INFO L350 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 12 treesize of output 13 [2022-11-16 08:13:08,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:13:08,990 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:13:08,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 38 treesize of output 20 [2022-11-16 08:13:08,996 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:09,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:09,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 39 states and 101 transitions. [2022-11-16 08:13:09,026 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 101 transitions. [2022-11-16 08:13:09,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:09,026 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:09,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:09,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:09,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-16 08:13:09,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:09,101 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:09,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:13:09,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:09,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:13:09,272 INFO L350 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 12 treesize of output 11 [2022-11-16 08:13:09,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:13:09,342 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:13:09,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 38 treesize of output 20 [2022-11-16 08:13:09,353 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:09,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:09,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 39 states and 101 transitions. [2022-11-16 08:13:09,383 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 101 transitions. [2022-11-16 08:13:09,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:09,384 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:09,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:09,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:09,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 55 conjunts are in the unsatisfiable core [2022-11-16 08:13:09,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:09,464 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:09,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:09,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 83 [2022-11-16 08:13:09,577 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:13:09,584 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 74 [2022-11-16 08:13:09,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 104 [2022-11-16 08:13:09,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:09,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 98 [2022-11-16 08:13:09,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2022-11-16 08:13:09,618 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:13:09,639 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-11-16 08:13:09,643 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:13:09,644 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 106 [2022-11-16 08:13:10,149 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 08:13:10,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 104 [2022-11-16 08:13:10,156 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:10,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 61 [2022-11-16 08:13:10,167 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:13:10,168 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-11-16 08:13:10,186 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:13:10,187 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2022-11-16 08:13:10,189 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:10,191 INFO L350 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 [2022-11-16 08:13:10,191 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-11-16 08:13:10,196 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:10,519 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse0 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse1 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse2 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (not (and .cse0 .cse1 .cse2 (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse10 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse4 (+ .cse10 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse8 (+ .cse10 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse9 (select .cse6 .cse8)) (.cse5 (select .cse3 .cse4))) (and (= .cse3 (store v_DerPreprocessor_14 .cse4 .cse5)) (= .cse6 (store .cse7 .cse8 .cse9)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse9 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse4) 1) (= (select .cse7 .cse8) 1) (= (+ .cse5 1) 0)))))))) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse12 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse11 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse11 0) (= (+ (select .cse3 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse12)) 1) 0) (= (select .cse7 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse12)) 1) (<= 0 .cse11)))) (not (<= c_~ARR_SIZE~0 0)) .cse0 .cse1 .cse2)) is different from false [2022-11-16 08:13:10,727 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse0 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse1 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse2 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (not (and .cse0 .cse1 .cse2 (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse10 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse4 (+ .cse10 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse8 (+ .cse10 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse9 (select .cse6 .cse8)) (.cse5 (select .cse3 .cse4))) (and (= .cse3 (store v_DerPreprocessor_14 .cse4 .cse5)) (= .cse6 (store .cse7 .cse8 .cse9)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse9 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse4) 1) (= (select .cse7 .cse8) 1) (= (+ .cse5 1) 0)))))))) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse12 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse11 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse11 0) (= (+ (select .cse3 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse12)) 1) 0) (= (select .cse7 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse12)) 1) (<= 0 .cse11)))) (not (<= c_~ARR_SIZE~0 0)) .cse0 .cse1 .cse2))) is different from true [2022-11-16 08:13:10,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:10,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 41 states and 111 transitions. [2022-11-16 08:13:10,914 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 111 transitions. [2022-11-16 08:13:10,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:10,915 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:10,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:10,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:10,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-16 08:13:10,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:10,995 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:11,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:13:11,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:11,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:13:11,116 INFO L350 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 12 treesize of output 11 [2022-11-16 08:13:11,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:13:11,173 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:11,188 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:13:11,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:13:11,193 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:11,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:11,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 41 states and 111 transitions. [2022-11-16 08:13:11,227 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 111 transitions. [2022-11-16 08:13:11,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:11,230 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:11,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:11,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:11,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-16 08:13:11,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:11,328 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:11,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:11,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-16 08:13:11,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 20 [2022-11-16 08:13:11,350 INFO L350 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 [2022-11-16 08:13:11,356 INFO L350 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 [2022-11-16 08:13:11,656 INFO L321 Elim1Store]: treesize reduction 60, result has 46.9 percent of original size [2022-11-16 08:13:11,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 107 treesize of output 150 [2022-11-16 08:13:11,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:11,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 43 [2022-11-16 08:13:11,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:11,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 13 [2022-11-16 08:13:11,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:11,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 23 treesize of output 15 [2022-11-16 08:13:11,833 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:13:11,834 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 76 [2022-11-16 08:13:11,883 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:13:11,884 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2022-11-16 08:13:12,854 INFO L321 Elim1Store]: treesize reduction 124, result has 40.7 percent of original size [2022-11-16 08:13:12,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 180 treesize of output 200 [2022-11-16 08:13:12,872 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:13:12,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 115 [2022-11-16 08:13:12,887 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:13:12,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 103 [2022-11-16 08:13:13,291 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:13,314 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse0 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse1 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse2 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (not (and .cse0 .cse1 .cse2 (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse10 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse4 (+ .cse10 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse8 (+ .cse10 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse9 (select .cse6 .cse8)) (.cse5 (select .cse3 .cse4))) (and (= .cse3 (store v_DerPreprocessor_14 .cse4 .cse5)) (= .cse6 (store .cse7 .cse8 .cse9)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse9 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse4) 1) (= (select .cse7 .cse8) 1) (= (+ .cse5 1) 0)))))))) (let ((.cse11 (select .cse7 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse12 (select .cse3 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse15 (= .cse12 0)) (.cse16 (= .cse11 0))) (or (and (= .cse11 1) (= (+ .cse12 1) 0)) (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse13 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse14 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse7 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse13 .cse14)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse3 (+ .cse13 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse14)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse15 .cse16) (and .cse15 .cse16 (exists ((v_DerPreprocessor_19 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse20 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse18 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse20)) (.cse17 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse19 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse20))) (and (= (select .cse17 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse3 .cse18) 1) 0) (= (select v_DerPreprocessor_19 .cse18) 1) (= (select .cse7 .cse19) 1) (= (+ (select .cse17 .cse19) 1) 0) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0))))))))) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse22 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse21 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse21 0) (= (+ (select .cse3 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse22)) 1) 0) (= (select .cse7 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse22)) 1) (<= 0 .cse21)))) (not (<= c_~ARR_SIZE~0 0)) .cse0 .cse1 .cse2)) is different from false [2022-11-16 08:13:13,632 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse0 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse1 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse2 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (not (and .cse0 .cse1 .cse2 (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse10 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse4 (+ .cse10 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse8 (+ .cse10 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse9 (select .cse6 .cse8)) (.cse5 (select .cse3 .cse4))) (and (= .cse3 (store v_DerPreprocessor_14 .cse4 .cse5)) (= .cse6 (store .cse7 .cse8 .cse9)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse9 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse4) 1) (= (select .cse7 .cse8) 1) (= (+ .cse5 1) 0)))))))) (let ((.cse11 (select .cse7 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse12 (select .cse3 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse15 (= .cse12 0)) (.cse16 (= .cse11 0))) (or (and (= .cse11 1) (= (+ .cse12 1) 0)) (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse13 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse14 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse7 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse13 .cse14)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse3 (+ .cse13 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse14)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse15 .cse16) (and .cse15 .cse16 (exists ((v_DerPreprocessor_19 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse20 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse18 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse20)) (.cse17 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse19 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse20))) (and (= (select .cse17 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse3 .cse18) 1) 0) (= (select v_DerPreprocessor_19 .cse18) 1) (= (select .cse7 .cse19) 1) (= (+ (select .cse17 .cse19) 1) 0) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0))))))))) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse22 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse21 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse21 0) (= (+ (select .cse3 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse22)) 1) 0) (= (select .cse7 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse22)) 1) (<= 0 .cse21)))) (not (<= c_~ARR_SIZE~0 0)) .cse0 .cse1 .cse2))) is different from true [2022-11-16 08:13:13,658 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse0 (select .cse8 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse1 (select .cse6 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse3 (= .cse1 0)) (.cse4 (= .cse0 0))) (let ((.cse2 (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse20 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse21 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse8 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse20 .cse21)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse6 (+ .cse20 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse21)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse3 .cse4)) (.cse15 (= |c_ULTIMATE.start_main_~count~0#1| 0)) (.cse16 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse17 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0))) (and (or (and (= .cse0 1) (= (+ .cse1 1) 0)) .cse2 (and .cse3 .cse4 (exists ((v_DerPreprocessor_19 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse10 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse7 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse10)) (.cse5 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse9 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse10))) (and (= (select .cse5 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse6 .cse7) 1) 0) (= (select v_DerPreprocessor_19 .cse7) 1) (= (select .cse8 .cse9) 1) (= (+ (select .cse5 .cse9) 1) 0) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0))))))) (not (and (or .cse2 (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse14 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse11 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse12 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse14)) (.cse13 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse14))) (and (= (select .cse11 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse6 .cse12) 1) 0) (= (+ (select .cse11 .cse13) 1) 0) (= (select v_DerPreprocessor_4 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_4 .cse12) 1) (= (select .cse8 .cse13) 1))))) .cse3 .cse4)) .cse15 .cse16 .cse17)) (not (and (<= c_~ARR_SIZE~0 0) (<= 0 |c_ULTIMATE.start_main_~count~0#1|))) .cse15 (not (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) .cse15 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse19 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse18 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse18 0) (= (+ (select .cse6 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse19)) 1) 0) (= (select .cse8 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse19)) 1) (<= 0 .cse18)))))) .cse16 .cse17 (= |c_ULTIMATE.start_main_~sum~0#1| 0)))))) is different from false [2022-11-16 08:13:14,428 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse0 (select .cse8 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse1 (select .cse6 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse3 (= .cse1 0)) (.cse4 (= .cse0 0))) (let ((.cse2 (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse20 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse21 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse8 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse20 .cse21)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse6 (+ .cse20 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse21)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse3 .cse4)) (.cse15 (= |c_ULTIMATE.start_main_~count~0#1| 0)) (.cse16 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse17 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0))) (and (or (and (= .cse0 1) (= (+ .cse1 1) 0)) .cse2 (and .cse3 .cse4 (exists ((v_DerPreprocessor_19 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse10 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse7 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse10)) (.cse5 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse9 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse10))) (and (= (select .cse5 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse6 .cse7) 1) 0) (= (select v_DerPreprocessor_19 .cse7) 1) (= (select .cse8 .cse9) 1) (= (+ (select .cse5 .cse9) 1) 0) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0))))))) (not (and (or .cse2 (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse14 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse11 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse12 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse14)) (.cse13 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse14))) (and (= (select .cse11 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse6 .cse12) 1) 0) (= (+ (select .cse11 .cse13) 1) 0) (= (select v_DerPreprocessor_4 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_4 .cse12) 1) (= (select .cse8 .cse13) 1))))) .cse3 .cse4)) .cse15 .cse16 .cse17)) (not (and (<= c_~ARR_SIZE~0 0) (<= 0 |c_ULTIMATE.start_main_~count~0#1|))) .cse15 (not (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) .cse15 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse19 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse18 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse18 0) (= (+ (select .cse6 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse19)) 1) 0) (= (select .cse8 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse19)) 1) (<= 0 .cse18)))))) .cse16 .cse17 (= |c_ULTIMATE.start_main_~sum~0#1| 0))))))) is different from true [2022-11-16 08:13:14,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:14,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 42 states and 129 transitions. [2022-11-16 08:13:14,897 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 129 transitions. [2022-11-16 08:13:14,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:14,898 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:14,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:14,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 55 conjunts are in the unsatisfiable core [2022-11-16 08:13:14,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:14,983 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:15,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:15,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 83 [2022-11-16 08:13:15,121 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:13:15,124 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 74 [2022-11-16 08:13:15,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 104 [2022-11-16 08:13:15,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:15,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 93 [2022-11-16 08:13:15,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:15,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 25 treesize of output 47 [2022-11-16 08:13:15,160 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:13:15,161 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 86 [2022-11-16 08:13:15,196 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-11-16 08:13:15,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:15,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 59 [2022-11-16 08:13:15,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 3 [2022-11-16 08:13:15,211 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:13:15,211 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2022-11-16 08:13:15,307 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:15,322 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:13:15,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:13:15,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:15,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:15,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 42 states and 129 transitions. [2022-11-16 08:13:15,369 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 129 transitions. [2022-11-16 08:13:15,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:15,370 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:15,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:15,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-16 08:13:15,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:15,466 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:15,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:13:15,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:15,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:13:15,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:13:15,598 INFO L350 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 12 treesize of output 11 [2022-11-16 08:13:15,603 INFO L350 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 12 treesize of output 13 [2022-11-16 08:13:15,659 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:15,674 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:13:15,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:13:15,679 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:15,731 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse5 (select .cse13 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse6 (select .cse11 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse8 (= .cse6 0)) (.cse9 (= .cse5 0))) (let ((.cse7 (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse22 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse23 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse13 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse22 .cse23)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse11 (+ .cse22 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse23)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse8 .cse9)) (.cse0 (= |c_ULTIMATE.start_main_~count~0#1| 0)) (.cse1 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse21 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse20 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse20 0) (= (+ (select .cse11 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse21)) 1) 0) (= (select .cse13 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse21)) 1) (<= 0 .cse20))))) (.cse2 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (or (and (= .cse5 1) (= (+ .cse6 1) 0)) .cse7 (and .cse8 .cse9 (exists ((v_DerPreprocessor_19 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse15 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse12 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse15)) (.cse10 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse14 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse15))) (and (= (select .cse10 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse11 .cse12) 1) 0) (= (select v_DerPreprocessor_19 .cse12) 1) (= (select .cse13 .cse14) 1) (= (+ (select .cse10 .cse14) 1) 0) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0))))))) (not (and (or .cse7 (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse19 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse16 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse17 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse19)) (.cse18 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse19))) (and (= (select .cse16 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse11 .cse17) 1) 0) (= (+ (select .cse16 .cse18) 1) 0) (= (select v_DerPreprocessor_4 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_4 .cse17) 1) (= (select .cse13 .cse18) 1))))) .cse8 .cse9)) .cse0 .cse2 .cse3)) (not (and (<= c_~ARR_SIZE~0 0) (<= 0 |c_ULTIMATE.start_main_~count~0#1|))) .cse0 (not (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) .cse0 .cse1)) .cse2 .cse3 .cse4))))) is different from false [2022-11-16 08:13:15,748 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse5 (select .cse13 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse6 (select .cse11 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse8 (= .cse6 0)) (.cse9 (= .cse5 0))) (let ((.cse7 (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse22 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse23 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse13 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse22 .cse23)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse11 (+ .cse22 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse23)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse8 .cse9)) (.cse0 (= |c_ULTIMATE.start_main_~count~0#1| 0)) (.cse1 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse21 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse20 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse20 0) (= (+ (select .cse11 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse21)) 1) 0) (= (select .cse13 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse21)) 1) (<= 0 .cse20))))) (.cse2 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (or (and (= .cse5 1) (= (+ .cse6 1) 0)) .cse7 (and .cse8 .cse9 (exists ((v_DerPreprocessor_19 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse15 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse12 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse15)) (.cse10 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse14 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse15))) (and (= (select .cse10 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse11 .cse12) 1) 0) (= (select v_DerPreprocessor_19 .cse12) 1) (= (select .cse13 .cse14) 1) (= (+ (select .cse10 .cse14) 1) 0) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0))))))) (not (and (or .cse7 (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse19 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse16 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse17 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse19)) (.cse18 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse19))) (and (= (select .cse16 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse11 .cse17) 1) 0) (= (+ (select .cse16 .cse18) 1) 0) (= (select v_DerPreprocessor_4 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_4 .cse17) 1) (= (select .cse13 .cse18) 1))))) .cse8 .cse9)) .cse0 .cse2 .cse3)) (not (and (<= c_~ARR_SIZE~0 0) (<= 0 |c_ULTIMATE.start_main_~count~0#1|))) .cse0 (not (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) .cse0 .cse1)) .cse2 .cse3 .cse4)))))) is different from true [2022-11-16 08:13:15,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:15,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 42 states and 129 transitions. [2022-11-16 08:13:15,764 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 129 transitions. [2022-11-16 08:13:15,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:15,765 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:15,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:15,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:15,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-16 08:13:15,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:15,853 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:15,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:15,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-16 08:13:15,879 INFO L350 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 [2022-11-16 08:13:16,272 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:16,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 95 [2022-11-16 08:13:16,281 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:13:16,298 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:13:16,299 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2022-11-16 08:13:16,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:16,539 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:16,544 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-16 08:13:16,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 28 [2022-11-16 08:13:16,550 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:16,707 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse6 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (not (<= c_~ARR_SIZE~0 0)) .cse0 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse5 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse1 (+ .cse5 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse3 (+ .cse5 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (select v_DerPreprocessor_6 .cse1) 1) (= (select .cse2 .cse3) 1) (= (+ (select .cse4 .cse1) 1) 0) (= (+ 1 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base|) .cse3)) 0))))) (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) .cse0 .cse6)) .cse6 (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse12 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse7 (+ .cse12 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse9 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse10 (+ .cse12 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse11 (select .cse9 .cse10)) (.cse8 (select .cse4 .cse7))) (and (= .cse4 (store v_DerPreprocessor_14 .cse7 .cse8)) (= .cse9 (store .cse2 .cse10 .cse11)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse11 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse7) 1) (= (select .cse2 .cse10) 1) (= (+ .cse8 1) 0)))))))) is different from false [2022-11-16 08:13:16,714 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse0 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse6 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (not (<= c_~ARR_SIZE~0 0)) .cse0 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse5 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse1 (+ .cse5 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse3 (+ .cse5 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (select v_DerPreprocessor_6 .cse1) 1) (= (select .cse2 .cse3) 1) (= (+ (select .cse4 .cse1) 1) 0) (= (+ 1 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base|) .cse3)) 0))))) (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) .cse0 .cse6)) .cse6 (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse12 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse7 (+ .cse12 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse9 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse10 (+ .cse12 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse11 (select .cse9 .cse10)) (.cse8 (select .cse4 .cse7))) (and (= .cse4 (store v_DerPreprocessor_14 .cse7 .cse8)) (= .cse9 (store .cse2 .cse10 .cse11)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse11 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse7) 1) (= (select .cse2 .cse10) 1) (= (+ .cse8 1) 0))))))))) is different from true [2022-11-16 08:13:16,728 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse0 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse2 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (not (and .cse0 .cse1 .cse2 (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse10 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse4 (+ .cse10 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse8 (+ .cse10 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse9 (select .cse6 .cse8)) (.cse5 (select .cse3 .cse4))) (and (= .cse3 (store v_DerPreprocessor_14 .cse4 .cse5)) (= .cse6 (store .cse7 .cse8 .cse9)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse9 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse4) 1) (= (select .cse7 .cse8) 1) (= (+ .cse5 1) 0)))))))) (let ((.cse11 (select .cse7 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse12 (select .cse3 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse15 (= .cse12 0)) (.cse16 (= .cse11 0))) (or (and (= .cse11 1) (= (+ .cse12 1) 0)) (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse13 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse14 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse7 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse13 .cse14)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse3 (+ .cse13 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse14)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse15 .cse16) (and .cse15 .cse16 (exists ((v_DerPreprocessor_19 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse20 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse18 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse20)) (.cse17 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse19 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse20))) (and (= (select .cse17 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse3 .cse18) 1) 0) (= (select v_DerPreprocessor_19 .cse18) 1) (= (select .cse7 .cse19) 1) (= (+ (select .cse17 .cse19) 1) 0) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0))))))))) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse22 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse21 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse21 0) (= (+ (select .cse3 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse22)) 1) 0) (= (select .cse7 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse22)) 1) (<= 0 .cse21)))) (not (<= c_~ARR_SIZE~0 0)) .cse0 .cse1 (not (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse25 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse23 (+ .cse25 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse24 (+ .cse25 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (select v_DerPreprocessor_6 .cse23) 1) (= (select .cse7 .cse24) 1) (= (+ (select .cse3 .cse23) 1) 0) (= (+ 1 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base|) .cse24)) 0))))) (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) .cse0 .cse2)) .cse2)) is different from false [2022-11-16 08:13:16,742 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse0 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse2 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (not (and .cse0 .cse1 .cse2 (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse10 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse4 (+ .cse10 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse8 (+ .cse10 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse9 (select .cse6 .cse8)) (.cse5 (select .cse3 .cse4))) (and (= .cse3 (store v_DerPreprocessor_14 .cse4 .cse5)) (= .cse6 (store .cse7 .cse8 .cse9)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse9 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse4) 1) (= (select .cse7 .cse8) 1) (= (+ .cse5 1) 0)))))))) (let ((.cse11 (select .cse7 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse12 (select .cse3 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse15 (= .cse12 0)) (.cse16 (= .cse11 0))) (or (and (= .cse11 1) (= (+ .cse12 1) 0)) (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse13 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse14 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse7 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse13 .cse14)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse3 (+ .cse13 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse14)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse15 .cse16) (and .cse15 .cse16 (exists ((v_DerPreprocessor_19 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse20 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse18 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse20)) (.cse17 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse19 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse20))) (and (= (select .cse17 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse3 .cse18) 1) 0) (= (select v_DerPreprocessor_19 .cse18) 1) (= (select .cse7 .cse19) 1) (= (+ (select .cse17 .cse19) 1) 0) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0))))))))) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse22 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse21 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse21 0) (= (+ (select .cse3 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse22)) 1) 0) (= (select .cse7 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse22)) 1) (<= 0 .cse21)))) (not (<= c_~ARR_SIZE~0 0)) .cse0 .cse1 (not (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse25 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse23 (+ .cse25 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse24 (+ .cse25 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (select v_DerPreprocessor_6 .cse23) 1) (= (select .cse7 .cse24) 1) (= (+ (select .cse3 .cse23) 1) 0) (= (+ 1 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base|) .cse24)) 0))))) (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) .cse0 .cse2)) .cse2))) is different from true [2022-11-16 08:13:16,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:16,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 43 states and 136 transitions. [2022-11-16 08:13:16,768 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 136 transitions. [2022-11-16 08:13:16,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:16,768 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:16,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:16,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:16,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-16 08:13:16,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:16,843 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:16,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:16,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-16 08:13:16,882 INFO L350 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 [2022-11-16 08:13:16,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-16 08:13:17,187 INFO L321 Elim1Store]: treesize reduction 60, result has 46.9 percent of original size [2022-11-16 08:13:17,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 107 treesize of output 150 [2022-11-16 08:13:17,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:17,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 43 [2022-11-16 08:13:17,213 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:13:17,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-11-16 08:13:17,244 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:13:17,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2022-11-16 08:13:17,347 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:13:17,349 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 82 [2022-11-16 08:13:18,425 INFO L321 Elim1Store]: treesize reduction 124, result has 40.7 percent of original size [2022-11-16 08:13:18,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 190 treesize of output 210 [2022-11-16 08:13:18,443 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:13:18,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 115 [2022-11-16 08:13:18,458 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:13:18,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 105 [2022-11-16 08:13:18,913 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:18,938 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse16 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (let ((.cse0 (select .cse3 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse1 (select .cse6 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse2 (= .cse1 0)) (.cse10 (= .cse0 0))) (or (and (= .cse0 1) (= (+ .cse1 1) 0)) (and .cse2 (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_28 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_29 (Array Int Int))) (let ((.cse8 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse9 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse5 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse8 .cse9)) (.cse7 (+ .cse8 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse9))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse3 .cse4) 1) 0) (= 0 (select .cse5 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse5 .cse4) 1) (= (select .cse6 .cse7) 1) (= (+ (select v_DerPreprocessor_29 .cse7) 1) 0) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)) (= (select v_DerPreprocessor_29 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0))))) .cse10) (and .cse2 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse11 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (= (+ (select .cse6 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse11)) 1) 0) (= (select .cse3 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse11)) 1)))) .cse10)))) (not (<= c_~ARR_SIZE~0 0)) .cse12 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse15 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse13 (+ .cse15 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse14 (+ .cse15 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (select v_DerPreprocessor_6 .cse13) 1) (= (select .cse3 .cse14) 1) (= (+ (select .cse6 .cse13) 1) 0) (= (+ 1 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base|) .cse14)) 0))))) (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) .cse12 .cse16)) .cse16 (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse22 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse17 (+ .cse22 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse19 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse20 (+ .cse22 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse21 (select .cse19 .cse20)) (.cse18 (select .cse6 .cse17))) (and (= .cse6 (store v_DerPreprocessor_14 .cse17 .cse18)) (= .cse19 (store .cse3 .cse20 .cse21)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse21 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse17) 1) (= (select .cse3 .cse20) 1) (= (+ .cse18 1) 0)))))))) is different from false [2022-11-16 08:13:19,261 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse12 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse16 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (let ((.cse0 (select .cse3 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse1 (select .cse6 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse2 (= .cse1 0)) (.cse10 (= .cse0 0))) (or (and (= .cse0 1) (= (+ .cse1 1) 0)) (and .cse2 (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_28 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_29 (Array Int Int))) (let ((.cse8 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse9 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse5 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse8 .cse9)) (.cse7 (+ .cse8 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse9))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse3 .cse4) 1) 0) (= 0 (select .cse5 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse5 .cse4) 1) (= (select .cse6 .cse7) 1) (= (+ (select v_DerPreprocessor_29 .cse7) 1) 0) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)) (= (select v_DerPreprocessor_29 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0))))) .cse10) (and .cse2 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse11 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (= (+ (select .cse6 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse11)) 1) 0) (= (select .cse3 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse11)) 1)))) .cse10)))) (not (<= c_~ARR_SIZE~0 0)) .cse12 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse15 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse13 (+ .cse15 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse14 (+ .cse15 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (select v_DerPreprocessor_6 .cse13) 1) (= (select .cse3 .cse14) 1) (= (+ (select .cse6 .cse13) 1) 0) (= (+ 1 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base|) .cse14)) 0))))) (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) .cse12 .cse16)) .cse16 (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse22 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse17 (+ .cse22 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse19 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse20 (+ .cse22 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse21 (select .cse19 .cse20)) (.cse18 (select .cse6 .cse17))) (and (= .cse6 (store v_DerPreprocessor_14 .cse17 .cse18)) (= .cse19 (store .cse3 .cse20 .cse21)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse21 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse17) 1) (= (select .cse3 .cse20) 1) (= (+ .cse18 1) 0))))))))) is different from true [2022-11-16 08:13:19,277 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse31 (select .cse2 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse32 (select .cse5 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse0 (and (= .cse31 1) (= (+ .cse32 1) 0))) (.cse1 (= .cse32 0)) (.cse9 (= .cse31 0)) (.cse12 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse11 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse13 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (or .cse0 (and .cse1 (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_28 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_29 (Array Int Int))) (let ((.cse7 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse8 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse4 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse7 .cse8)) (.cse6 (+ .cse7 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse2 .cse3) 1) 0) (= 0 (select .cse4 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse4 .cse3) 1) (= (select .cse5 .cse6) 1) (= (+ (select v_DerPreprocessor_29 .cse6) 1) 0) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)) (= (select v_DerPreprocessor_29 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0))))) .cse9) (and .cse1 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse10 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (= (+ (select .cse5 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse10)) 1) 0) (= (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse10)) 1)))) .cse9)) (not (and .cse11 .cse12 .cse13 (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse19 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse14 (+ .cse19 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse16 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse17 (+ .cse19 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse18 (select .cse16 .cse17)) (.cse15 (select .cse5 .cse14))) (and (= .cse5 (store v_DerPreprocessor_14 .cse14 .cse15)) (= .cse16 (store .cse2 .cse17 .cse18)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse18 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse14) 1) (= (select .cse2 .cse17) 1) (= (+ .cse15 1) 0)))))))) (or .cse0 (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse20 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse21 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse20 .cse21)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse5 (+ .cse20 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse21)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse1 .cse9) (and .cse1 .cse9 (exists ((v_DerPreprocessor_19 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse25 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse23 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse25)) (.cse22 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse24 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse25))) (and (= (select .cse22 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse5 .cse23) 1) 0) (= (select v_DerPreprocessor_19 .cse23) 1) (= (select .cse2 .cse24) 1) (= (+ (select .cse22 .cse24) 1) 0) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0))))))) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse27 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse26 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse26 0) (= (+ (select .cse5 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse27)) 1) 0) (= (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse27)) 1) (<= 0 .cse26)))) (not (<= c_~ARR_SIZE~0 0)) .cse11 .cse12 (not (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse30 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse28 (+ .cse30 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse29 (+ .cse30 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (select v_DerPreprocessor_6 .cse28) 1) (= (select .cse2 .cse29) 1) (= (+ (select .cse5 .cse28) 1) 0) (= (+ 1 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base|) .cse29)) 0))))) (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) .cse11 .cse13)) .cse13)))) is different from false [2022-11-16 08:13:19,301 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse31 (select .cse2 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse32 (select .cse5 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse0 (and (= .cse31 1) (= (+ .cse32 1) 0))) (.cse1 (= .cse32 0)) (.cse9 (= .cse31 0)) (.cse12 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse11 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse13 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (or .cse0 (and .cse1 (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_28 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_29 (Array Int Int))) (let ((.cse7 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse8 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse4 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse7 .cse8)) (.cse6 (+ .cse7 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse2 .cse3) 1) 0) (= 0 (select .cse4 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse4 .cse3) 1) (= (select .cse5 .cse6) 1) (= (+ (select v_DerPreprocessor_29 .cse6) 1) 0) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)) (= (select v_DerPreprocessor_29 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0))))) .cse9) (and .cse1 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse10 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (= (+ (select .cse5 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse10)) 1) 0) (= (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse10)) 1)))) .cse9)) (not (and .cse11 .cse12 .cse13 (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse19 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse14 (+ .cse19 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse16 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse17 (+ .cse19 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse18 (select .cse16 .cse17)) (.cse15 (select .cse5 .cse14))) (and (= .cse5 (store v_DerPreprocessor_14 .cse14 .cse15)) (= .cse16 (store .cse2 .cse17 .cse18)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse18 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse14) 1) (= (select .cse2 .cse17) 1) (= (+ .cse15 1) 0)))))))) (or .cse0 (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse20 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse21 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse20 .cse21)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse5 (+ .cse20 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse21)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse1 .cse9) (and .cse1 .cse9 (exists ((v_DerPreprocessor_19 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse25 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse23 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse25)) (.cse22 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse24 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse25))) (and (= (select .cse22 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse5 .cse23) 1) 0) (= (select v_DerPreprocessor_19 .cse23) 1) (= (select .cse2 .cse24) 1) (= (+ (select .cse22 .cse24) 1) 0) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0))))))) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse27 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse26 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse26 0) (= (+ (select .cse5 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse27)) 1) 0) (= (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse27)) 1) (<= 0 .cse26)))) (not (<= c_~ARR_SIZE~0 0)) .cse11 .cse12 (not (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse30 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse28 (+ .cse30 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse29 (+ .cse30 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (select v_DerPreprocessor_6 .cse28) 1) (= (select .cse2 .cse29) 1) (= (+ (select .cse5 .cse28) 1) 0) (= (+ 1 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base|) .cse29)) 0))))) (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) .cse11 .cse13)) .cse13))))) is different from true [2022-11-16 08:13:19,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:19,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 43 states and 136 transitions. [2022-11-16 08:13:19,638 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 136 transitions. [2022-11-16 08:13:19,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:19,639 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:19,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:19,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-16 08:13:19,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:19,712 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:19,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:13:19,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:19,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:13:19,885 INFO L350 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 12 treesize of output 11 [2022-11-16 08:13:19,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:13:19,949 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:13:19,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 38 treesize of output 20 [2022-11-16 08:13:19,954 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:20,003 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse6 (select .cse14 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse7 (select .cse12 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse9 (= .cse7 0)) (.cse10 (= .cse6 0))) (let ((.cse8 (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse23 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse24 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse14 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse23 .cse24)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse12 (+ .cse23 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse24)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse9 .cse10)) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= |c_ULTIMATE.start_main_~count~0#1| 0)) (.cse2 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse22 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse21 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse21 0) (= (+ (select .cse12 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse22)) 1) 0) (= (select .cse14 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse22)) 1) (<= 0 .cse21))))) (.cse4 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse3 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (and .cse1 .cse2 .cse4 .cse5 .cse3)) (or (and (= .cse6 1) (= (+ .cse7 1) 0)) .cse8 (and .cse9 .cse10 (exists ((v_DerPreprocessor_19 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse16 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse13 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse16)) (.cse11 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse15 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse16))) (and (= (select .cse11 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse12 .cse13) 1) 0) (= (select v_DerPreprocessor_19 .cse13) 1) (= (select .cse14 .cse15) 1) (= (+ (select .cse11 .cse15) 1) 0) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0))))))) (not (and (or .cse8 (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse20 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse17 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse18 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse20)) (.cse19 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse20))) (and (= (select .cse17 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse12 .cse18) 1) 0) (= (+ (select .cse17 .cse19) 1) 0) (= (select v_DerPreprocessor_4 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_4 .cse18) 1) (= (select .cse14 .cse19) 1))))) .cse9 .cse10)) .cse1 .cse4 .cse5)) (not (and (<= c_~ARR_SIZE~0 0) (<= 0 |c_ULTIMATE.start_main_~count~0#1|))) .cse1 (not (and .cse0 .cse1 .cse2)) .cse4 .cse5 .cse3))))) is different from false [2022-11-16 08:13:20,018 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse6 (select .cse14 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse7 (select .cse12 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse9 (= .cse7 0)) (.cse10 (= .cse6 0))) (let ((.cse8 (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse23 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse24 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse14 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse23 .cse24)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse12 (+ .cse23 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse24)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse9 .cse10)) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= |c_ULTIMATE.start_main_~count~0#1| 0)) (.cse2 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse22 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse21 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse21 0) (= (+ (select .cse12 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse22)) 1) 0) (= (select .cse14 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse22)) 1) (<= 0 .cse21))))) (.cse4 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse3 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (and .cse1 .cse2 .cse4 .cse5 .cse3)) (or (and (= .cse6 1) (= (+ .cse7 1) 0)) .cse8 (and .cse9 .cse10 (exists ((v_DerPreprocessor_19 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse16 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse13 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse16)) (.cse11 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse15 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse16))) (and (= (select .cse11 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse12 .cse13) 1) 0) (= (select v_DerPreprocessor_19 .cse13) 1) (= (select .cse14 .cse15) 1) (= (+ (select .cse11 .cse15) 1) 0) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0))))))) (not (and (or .cse8 (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse20 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse17 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse18 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse20)) (.cse19 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse20))) (and (= (select .cse17 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse12 .cse18) 1) 0) (= (+ (select .cse17 .cse19) 1) 0) (= (select v_DerPreprocessor_4 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_4 .cse18) 1) (= (select .cse14 .cse19) 1))))) .cse9 .cse10)) .cse1 .cse4 .cse5)) (not (and (<= c_~ARR_SIZE~0 0) (<= 0 |c_ULTIMATE.start_main_~count~0#1|))) .cse1 (not (and .cse0 .cse1 .cse2)) .cse4 .cse5 .cse3)))))) is different from true [2022-11-16 08:13:20,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:20,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 42 states and 129 transitions. [2022-11-16 08:13:20,036 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 129 transitions. [2022-11-16 08:13:20,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:20,036 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:20,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:20,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:13:20,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:20,118 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:20,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:20,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:13:20,249 INFO L350 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 12 treesize of output 11 [2022-11-16 08:13:20,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:13:20,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:13:20,313 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:20,328 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:13:20,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:13:20,334 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:20,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:20,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 42 states and 129 transitions. [2022-11-16 08:13:20,381 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 129 transitions. [2022-11-16 08:13:20,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:20,382 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:20,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:20,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:20,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-16 08:13:20,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:20,466 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:20,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:20,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-16 08:13:20,508 INFO L350 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 [2022-11-16 08:13:20,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-16 08:13:21,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:21,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 95 [2022-11-16 08:13:21,244 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:13:21,245 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 84 [2022-11-16 08:13:21,250 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:21,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 117 [2022-11-16 08:13:21,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:21,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 100 [2022-11-16 08:13:21,264 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:21,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 50 [2022-11-16 08:13:21,276 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:13:21,277 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 88 [2022-11-16 08:13:21,821 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 08:13:21,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 100 [2022-11-16 08:13:21,827 INFO L350 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 63 treesize of output 61 [2022-11-16 08:13:21,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:21,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 63 [2022-11-16 08:13:21,839 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:13:21,840 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2022-11-16 08:13:21,847 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:21,849 INFO L350 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 19 treesize of output 15 [2022-11-16 08:13:21,856 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:21,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-11-16 08:13:21,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:22,812 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse9 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse10 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (not (and .cse0 (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse8 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse1 (+ .cse8 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse3 (+ .cse8 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse4 (select .cse5 .cse3)) (.cse7 (select .cse6 .cse1)) (.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_32 .cse1) 1) (= (store .cse2 .cse3 .cse4) .cse5) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= .cse6 (store v_DerPreprocessor_32 .cse1 .cse7)) (= .cse4 1) (= (+ .cse7 1) 0) (= 0 (+ (select .cse2 .cse3) 1))))))) .cse9 .cse10)) (not (<= c_~ARR_SIZE~0 0)) .cse0 .cse9 .cse10 (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse16 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse11 (+ .cse16 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse13 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse14 (+ .cse16 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse15 (select .cse13 .cse14)) (.cse12 (select .cse6 .cse11))) (and (= .cse6 (store v_DerPreprocessor_14 .cse11 .cse12)) (= .cse13 (store .cse5 .cse14 .cse15)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse15 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse11) 1) (= (select .cse5 .cse14) 1) (= (+ .cse12 1) 0)))))))) is different from false [2022-11-16 08:13:23,114 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse0 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse9 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse10 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (not (and .cse0 (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse8 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse1 (+ .cse8 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse3 (+ .cse8 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse4 (select .cse5 .cse3)) (.cse7 (select .cse6 .cse1)) (.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_32 .cse1) 1) (= (store .cse2 .cse3 .cse4) .cse5) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= .cse6 (store v_DerPreprocessor_32 .cse1 .cse7)) (= .cse4 1) (= (+ .cse7 1) 0) (= 0 (+ (select .cse2 .cse3) 1))))))) .cse9 .cse10)) (not (<= c_~ARR_SIZE~0 0)) .cse0 .cse9 .cse10 (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse16 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse11 (+ .cse16 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse13 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse14 (+ .cse16 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse15 (select .cse13 .cse14)) (.cse12 (select .cse6 .cse11))) (and (= .cse6 (store v_DerPreprocessor_14 .cse11 .cse12)) (= .cse13 (store .cse5 .cse14 .cse15)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse15 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse11) 1) (= (select .cse5 .cse14) 1) (= (+ .cse12 1) 0))))))))) is different from true [2022-11-16 08:13:23,458 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~count~0#1| 0)) (.cse5 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse6 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse7 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse3 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse1 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse1 0) (= (+ (select .cse2 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse3)) 1) 0) (= (select .cse4 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse3)) 1) (<= 0 .cse1)))) (not (<= c_~ARR_SIZE~0 0)) .cse5 .cse6 .cse7 (not (and .cse0 .cse5 (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse13 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse8 (+ .cse13 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse10 (+ .cse13 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse11 (select .cse4 .cse10)) (.cse12 (select .cse2 .cse8)) (.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_32 .cse8) 1) (= (store .cse9 .cse10 .cse11) .cse4) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= .cse2 (store v_DerPreprocessor_32 .cse8 .cse12)) (= .cse11 1) (= (+ .cse12 1) 0) (= 0 (+ (select .cse9 .cse10) 1))))))) .cse6 .cse7)))) is different from false [2022-11-16 08:13:23,689 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse0 (= |c_ULTIMATE.start_main_~count~0#1| 0)) (.cse5 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse6 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse7 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse3 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse1 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse1 0) (= (+ (select .cse2 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse3)) 1) 0) (= (select .cse4 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse3)) 1) (<= 0 .cse1)))) (not (<= c_~ARR_SIZE~0 0)) .cse5 .cse6 .cse7 (not (and .cse0 .cse5 (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse13 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse8 (+ .cse13 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse10 (+ .cse13 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse11 (select .cse4 .cse10)) (.cse12 (select .cse2 .cse8)) (.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_32 .cse8) 1) (= (store .cse9 .cse10 .cse11) .cse4) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= .cse2 (store v_DerPreprocessor_32 .cse8 .cse12)) (= .cse11 1) (= (+ .cse12 1) 0) (= 0 (+ (select .cse9 .cse10) 1))))))) .cse6 .cse7))))) is different from true [2022-11-16 08:13:23,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:23,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 45 states and 160 transitions. [2022-11-16 08:13:23,700 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 160 transitions. [2022-11-16 08:13:23,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:23,701 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:23,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:23,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:23,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:13:23,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:23,786 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:23,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:23,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:13:23,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:13:23,891 INFO L350 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 12 treesize of output 13 [2022-11-16 08:13:23,896 INFO L350 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 12 treesize of output 11 [2022-11-16 08:13:23,906 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:13:23,953 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:23,971 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:13:23,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:13:23,977 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:23,997 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse9 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse10 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (not (and .cse0 (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse8 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse1 (+ .cse8 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse3 (+ .cse8 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse4 (select .cse5 .cse3)) (.cse7 (select .cse6 .cse1)) (.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_32 .cse1) 1) (= (store .cse2 .cse3 .cse4) .cse5) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= .cse6 (store v_DerPreprocessor_32 .cse1 .cse7)) (= .cse4 1) (= (+ .cse7 1) 0) (= 0 (+ (select .cse2 .cse3) 1))))))) .cse9 .cse10)) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse12 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse11 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse11 0) (= (+ (select .cse6 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse12)) 1) 0) (= (select .cse5 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse12)) 1) (<= 0 .cse11)))) (not (<= c_~ARR_SIZE~0 0)) .cse0 .cse9 .cse10 (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse18 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse13 (+ .cse18 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse15 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse16 (+ .cse18 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse17 (select .cse15 .cse16)) (.cse14 (select .cse6 .cse13))) (and (= .cse6 (store v_DerPreprocessor_14 .cse13 .cse14)) (= .cse15 (store .cse5 .cse16 .cse17)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse17 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse13) 1) (= (select .cse5 .cse16) 1) (= (+ .cse14 1) 0)))))))) is different from false [2022-11-16 08:13:24,011 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse0 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse9 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse10 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (not (and .cse0 (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse8 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse1 (+ .cse8 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse3 (+ .cse8 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse4 (select .cse5 .cse3)) (.cse7 (select .cse6 .cse1)) (.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_32 .cse1) 1) (= (store .cse2 .cse3 .cse4) .cse5) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= .cse6 (store v_DerPreprocessor_32 .cse1 .cse7)) (= .cse4 1) (= (+ .cse7 1) 0) (= 0 (+ (select .cse2 .cse3) 1))))))) .cse9 .cse10)) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse12 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse11 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse11 0) (= (+ (select .cse6 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse12)) 1) 0) (= (select .cse5 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse12)) 1) (<= 0 .cse11)))) (not (<= c_~ARR_SIZE~0 0)) .cse0 .cse9 .cse10 (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse18 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse13 (+ .cse18 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse15 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse16 (+ .cse18 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse17 (select .cse15 .cse16)) (.cse14 (select .cse6 .cse13))) (and (= .cse6 (store v_DerPreprocessor_14 .cse13 .cse14)) (= .cse15 (store .cse5 .cse16 .cse17)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse17 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse13) 1) (= (select .cse5 .cse16) 1) (= (+ .cse14 1) 0))))))))) is different from true [2022-11-16 08:13:24,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:24,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 45 states and 160 transitions. [2022-11-16 08:13:24,037 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 160 transitions. [2022-11-16 08:13:24,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:24,037 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:24,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:24,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:24,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:13:24,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:24,123 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:24,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:24,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:13:24,248 INFO L350 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 12 treesize of output 11 [2022-11-16 08:13:24,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:13:24,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:13:24,319 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:13:24,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 38 treesize of output 20 [2022-11-16 08:13:24,324 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:24,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:24,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 43 states and 146 transitions. [2022-11-16 08:13:24,382 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 146 transitions. [2022-11-16 08:13:24,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:24,383 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:24,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:24,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:24,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-16 08:13:24,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:24,470 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:24,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-16 08:13:24,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 08:13:25,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:25,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 88 [2022-11-16 08:13:25,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 76 [2022-11-16 08:13:25,400 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:13:25,401 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 86 [2022-11-16 08:13:25,406 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:25,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 119 [2022-11-16 08:13:25,435 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:25,438 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:13:26,019 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 08:13:26,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 63 [2022-11-16 08:13:26,025 INFO L350 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 30 treesize of output 35 [2022-11-16 08:13:26,029 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:13:26,030 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2022-11-16 08:13:26,036 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:26,047 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-16 08:13:26,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 47 [2022-11-16 08:13:26,058 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:26,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-16 08:13:26,069 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:27,359 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse9 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (not (<= c_~ARR_SIZE~0 0)) (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0) (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse7 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse0 (+ .cse7 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse2 (+ .cse7 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse3 (select .cse4 .cse2)) (.cse6 (select .cse5 .cse0)) (.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_32 .cse0) 1) (= (store .cse1 .cse2 .cse3) .cse4) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= .cse5 (store v_DerPreprocessor_32 .cse0 .cse6)) (= .cse3 1) (= (+ .cse6 1) 0) (= 0 (+ (select .cse1 .cse2) 1))))))) .cse8 .cse9 (not (and (exists ((v_DerPreprocessor_34 (Array Int Int)) (v_arrayElimArr_72 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse10 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse11 (+ .cse10 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse12 (select v_arrayElimArr_72 .cse11))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_72) |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ .cse10 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (- 1)) .cse5) (= (select .cse4 .cse11) 1) (= (+ .cse12 1) 0) (= v_arrayElimArr_72 (store .cse4 .cse11 .cse12))))))) .cse8 .cse9)) (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse18 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse13 (+ .cse18 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse15 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse16 (+ .cse18 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse17 (select .cse15 .cse16)) (.cse14 (select .cse5 .cse13))) (and (= .cse5 (store v_DerPreprocessor_14 .cse13 .cse14)) (= .cse15 (store .cse4 .cse16 .cse17)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse17 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse13) 1) (= (select .cse4 .cse16) 1) (= (+ .cse14 1) 0)))))))) is different from false [2022-11-16 08:13:27,747 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse8 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse9 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (not (<= c_~ARR_SIZE~0 0)) (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0) (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse7 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse0 (+ .cse7 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse2 (+ .cse7 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse3 (select .cse4 .cse2)) (.cse6 (select .cse5 .cse0)) (.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_32 .cse0) 1) (= (store .cse1 .cse2 .cse3) .cse4) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= .cse5 (store v_DerPreprocessor_32 .cse0 .cse6)) (= .cse3 1) (= (+ .cse6 1) 0) (= 0 (+ (select .cse1 .cse2) 1))))))) .cse8 .cse9 (not (and (exists ((v_DerPreprocessor_34 (Array Int Int)) (v_arrayElimArr_72 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse10 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse11 (+ .cse10 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse12 (select v_arrayElimArr_72 .cse11))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_72) |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ .cse10 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (- 1)) .cse5) (= (select .cse4 .cse11) 1) (= (+ .cse12 1) 0) (= v_arrayElimArr_72 (store .cse4 .cse11 .cse12))))))) .cse8 .cse9)) (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse18 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse13 (+ .cse18 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse15 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse16 (+ .cse18 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse17 (select .cse15 .cse16)) (.cse14 (select .cse5 .cse13))) (and (= .cse5 (store v_DerPreprocessor_14 .cse13 .cse14)) (= .cse15 (store .cse4 .cse16 .cse17)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse17 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse13) 1) (= (select .cse4 .cse16) 1) (= (+ .cse14 1) 0))))))))) is different from true [2022-11-16 08:13:28,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:28,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 45 states and 160 transitions. [2022-11-16 08:13:28,001 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 160 transitions. [2022-11-16 08:13:28,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:28,001 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:28,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:28,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:28,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-16 08:13:28,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:28,080 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:28,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:28,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:13:28,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:13:28,164 INFO L350 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 12 treesize of output 13 [2022-11-16 08:13:28,167 INFO L350 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 12 treesize of output 11 [2022-11-16 08:13:28,181 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:28,183 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:13:28,234 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:13:28,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 38 treesize of output 20 [2022-11-16 08:13:28,241 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:28,262 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse11 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse2 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse0 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse0 0) (= (+ (select .cse1 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse2)) 1) 0) (= (select .cse3 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse2)) 1) (<= 0 .cse0)))) (not (<= c_~ARR_SIZE~0 0)) (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0) (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse9 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse4 (+ .cse9 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse6 (+ .cse9 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse7 (select .cse3 .cse6)) (.cse8 (select .cse1 .cse4)) (.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_32 .cse4) 1) (= (store .cse5 .cse6 .cse7) .cse3) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= .cse1 (store v_DerPreprocessor_32 .cse4 .cse8)) (= .cse7 1) (= (+ .cse8 1) 0) (= 0 (+ (select .cse5 .cse6) 1))))))) .cse10 .cse11 (not (and (exists ((v_DerPreprocessor_34 (Array Int Int)) (v_arrayElimArr_72 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse12 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse13 (+ .cse12 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse14 (select v_arrayElimArr_72 .cse13))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_72) |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ .cse12 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (- 1)) .cse1) (= (select .cse3 .cse13) 1) (= (+ .cse14 1) 0) (= v_arrayElimArr_72 (store .cse3 .cse13 .cse14))))))) .cse10 .cse11)) (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse20 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse15 (+ .cse20 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse17 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse18 (+ .cse20 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse19 (select .cse17 .cse18)) (.cse16 (select .cse1 .cse15))) (and (= .cse1 (store v_DerPreprocessor_14 .cse15 .cse16)) (= .cse17 (store .cse3 .cse18 .cse19)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse19 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse15) 1) (= (select .cse3 .cse18) 1) (= (+ .cse16 1) 0)))))))) is different from false [2022-11-16 08:13:28,276 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse10 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse11 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse2 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse0 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse0 0) (= (+ (select .cse1 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse2)) 1) 0) (= (select .cse3 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse2)) 1) (<= 0 .cse0)))) (not (<= c_~ARR_SIZE~0 0)) (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0) (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse9 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse4 (+ .cse9 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse6 (+ .cse9 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse7 (select .cse3 .cse6)) (.cse8 (select .cse1 .cse4)) (.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_32 .cse4) 1) (= (store .cse5 .cse6 .cse7) .cse3) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= .cse1 (store v_DerPreprocessor_32 .cse4 .cse8)) (= .cse7 1) (= (+ .cse8 1) 0) (= 0 (+ (select .cse5 .cse6) 1))))))) .cse10 .cse11 (not (and (exists ((v_DerPreprocessor_34 (Array Int Int)) (v_arrayElimArr_72 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse12 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse13 (+ .cse12 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse14 (select v_arrayElimArr_72 .cse13))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_72) |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ .cse12 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (- 1)) .cse1) (= (select .cse3 .cse13) 1) (= (+ .cse14 1) 0) (= v_arrayElimArr_72 (store .cse3 .cse13 .cse14))))))) .cse10 .cse11)) (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse20 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse15 (+ .cse20 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse17 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse18 (+ .cse20 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse19 (select .cse17 .cse18)) (.cse16 (select .cse1 .cse15))) (and (= .cse1 (store v_DerPreprocessor_14 .cse15 .cse16)) (= .cse17 (store .cse3 .cse18 .cse19)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse19 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse15) 1) (= (select .cse3 .cse18) 1) (= (+ .cse16 1) 0))))))))) is different from true [2022-11-16 08:13:28,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:28,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 45 states and 160 transitions. [2022-11-16 08:13:28,308 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 160 transitions. [2022-11-16 08:13:28,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:28,309 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:28,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:28,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-16 08:13:28,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:28,392 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:28,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:28,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-16 08:13:28,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 20 [2022-11-16 08:13:28,418 INFO L350 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 [2022-11-16 08:13:28,427 INFO L350 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 [2022-11-16 08:13:28,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:28,739 INFO L321 Elim1Store]: treesize reduction 60, result has 46.9 percent of original size [2022-11-16 08:13:28,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 107 treesize of output 150 [2022-11-16 08:13:28,751 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:13:28,753 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 88 [2022-11-16 08:13:29,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:29,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 43 [2022-11-16 08:13:29,019 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:13:29,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2022-11-16 08:13:29,032 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:13:29,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-11-16 08:13:30,070 INFO L321 Elim1Store]: treesize reduction 124, result has 40.7 percent of original size [2022-11-16 08:13:30,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 190 treesize of output 210 [2022-11-16 08:13:30,086 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:13:30,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 125 [2022-11-16 08:13:30,100 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:13:30,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 105 [2022-11-16 08:13:30,668 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:31,069 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse11 (select .cse4 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse12 (select .cse1 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse6 (= .cse12 0)) (.cse8 (= .cse11 0)) (.cse7 (= |c_ULTIMATE.start_main_~count~0#1| 0)) (.cse9 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse10 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0))) (and (not (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse5 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse0 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse5)) (.cse3 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse5))) (and (= (select .cse0 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse1 .cse2) 1) 0) (= (+ (select .cse0 .cse3) 1) 0) (= (select v_DerPreprocessor_4 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_4 .cse2) 1) (= (select .cse4 .cse3) 1))))) .cse6 .cse7 .cse8 .cse9 .cse10)) (or (and (= .cse11 1) (= (+ .cse12 1) 0)) (and .cse6 .cse8 (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse16 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse17 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse14 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse16 .cse17)) (.cse15 (+ .cse16 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse17)) (.cse13 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_37) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_37) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select .cse13 .cse14) 1) (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select v_DerPreprocessor_38 .cse15) 1) 0) (= (+ (select .cse4 .cse14) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select v_DerPreprocessor_38 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (<= 1 (select .cse1 .cse15)) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)) (= 0 (select .cse13 |c_ULTIMATE.start_main_~#array1~0#1.offset|))))))) (and .cse6 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse18 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (= (+ (select .cse1 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse18)) 1) 0) (= (select .cse4 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse18)) 1)))) .cse8)) (not (and (<= c_~ARR_SIZE~0 0) (<= 0 |c_ULTIMATE.start_main_~count~0#1|))) .cse7 (not (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) .cse7 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse20 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse19 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse19 0) (= (+ (select .cse1 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse20)) 1) 0) (= (select .cse4 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse20)) 1) (<= 0 .cse19)))))) (not (and (or (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse21 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse22 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse4 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse21 .cse22)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse1 (+ .cse21 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse22)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse6 .cse8) (and .cse6 .cse8 (exists ((v_DerPreprocessor_19 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse26 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse24 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse26)) (.cse23 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse25 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse26))) (and (= (select .cse23 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse1 .cse24) 1) 0) (= (select v_DerPreprocessor_19 .cse24) 1) (= (select .cse4 .cse25) 1) (= (+ (select .cse23 .cse25) 1) 0) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0))))))) .cse7 .cse9 .cse10)) .cse9 .cse10 (= |c_ULTIMATE.start_main_~sum~0#1| 0))))) is different from false [2022-11-16 08:13:33,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:33,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 46 states and 182 transitions. [2022-11-16 08:13:33,638 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 182 transitions. [2022-11-16 08:13:33,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:33,639 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:33,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:33,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:33,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-16 08:13:33,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:33,718 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:33,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:33,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:13:33,867 INFO L350 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 12 treesize of output 11 [2022-11-16 08:13:33,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:13:33,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:13:33,927 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:33,942 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:13:33,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:13:33,947 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:33,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:33,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 46 states and 182 transitions. [2022-11-16 08:13:33,998 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 182 transitions. [2022-11-16 08:13:33,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:33,999 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:33,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:34,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:34,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-16 08:13:34,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:34,078 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:34,161 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:34,163 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:13:34,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:34,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:13:34,173 INFO L350 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 12 treesize of output 11 [2022-11-16 08:13:34,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:13:34,240 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:13:34,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 38 treesize of output 20 [2022-11-16 08:13:34,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:34,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:34,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 46 states and 182 transitions. [2022-11-16 08:13:34,331 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 182 transitions. [2022-11-16 08:13:34,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:34,331 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:34,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:34,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:34,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-16 08:13:34,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:34,405 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:34,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:13:34,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:34,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:13:34,531 INFO L350 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 12 treesize of output 11 [2022-11-16 08:13:34,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:13:34,586 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:34,601 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:13:34,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:13:34,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:34,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:34,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 46 states and 182 transitions. [2022-11-16 08:13:34,661 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 182 transitions. [2022-11-16 08:13:34,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:34,661 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:34,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:34,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:34,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:13:34,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:34,761 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:34,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:34,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:13:34,874 INFO L350 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 12 treesize of output 11 [2022-11-16 08:13:34,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:13:34,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:13:34,940 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:34,956 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:13:34,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:13:34,961 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:35,014 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse13 (select .cse4 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse14 (select .cse1 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse11 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse28 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse27 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse27 0) (= (+ (select .cse1 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse28)) 1) 0) (= (select .cse4 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse28)) 1) (<= 0 .cse27))))) (.cse6 (= .cse14 0)) (.cse8 (= .cse13 0)) (.cse7 (= |c_ULTIMATE.start_main_~count~0#1| 0)) (.cse9 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse10 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse12 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (not (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse5 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse0 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse5)) (.cse3 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse5))) (and (= (select .cse0 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse1 .cse2) 1) 0) (= (+ (select .cse0 .cse3) 1) 0) (= (select v_DerPreprocessor_4 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_4 .cse2) 1) (= (select .cse4 .cse3) 1))))) .cse6 .cse7 .cse8 .cse9 .cse10)) (not (and .cse7 .cse11 .cse9 .cse10 .cse12)) (or (and (= .cse13 1) (= (+ .cse14 1) 0)) (and .cse6 .cse8 (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse18 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse19 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse16 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse18 .cse19)) (.cse17 (+ .cse18 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse19)) (.cse15 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_37) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_37) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select .cse15 .cse16) 1) (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select v_DerPreprocessor_38 .cse17) 1) 0) (= (+ (select .cse4 .cse16) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select v_DerPreprocessor_38 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (<= 1 (select .cse1 .cse17)) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)) (= 0 (select .cse15 |c_ULTIMATE.start_main_~#array1~0#1.offset|))))))) (and .cse6 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse20 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (= (+ (select .cse1 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse20)) 1) 0) (= (select .cse4 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse20)) 1)))) .cse8)) (not (and (<= c_~ARR_SIZE~0 0) (<= 0 |c_ULTIMATE.start_main_~count~0#1|))) .cse7 (not (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) .cse7 .cse11)) (not (and (or (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse21 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse22 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse4 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse21 .cse22)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse1 (+ .cse21 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse22)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse6 .cse8) (and .cse6 .cse8 (exists ((v_DerPreprocessor_19 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse26 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse24 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse26)) (.cse23 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse25 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse26))) (and (= (select .cse23 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse1 .cse24) 1) 0) (= (select v_DerPreprocessor_19 .cse24) 1) (= (select .cse4 .cse25) 1) (= (+ (select .cse23 .cse25) 1) 0) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0))))))) .cse7 .cse9 .cse10)) .cse9 .cse10 .cse12)))) is different from false [2022-11-16 08:13:36,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:36,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 46 states and 182 transitions. [2022-11-16 08:13:36,218 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 182 transitions. [2022-11-16 08:13:36,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:36,219 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:36,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:36,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:36,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-16 08:13:36,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:36,298 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:36,762 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:36,763 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:13:36,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:36,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:13:36,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:13:36,777 INFO L350 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 12 treesize of output 11 [2022-11-16 08:13:36,782 INFO L350 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 12 treesize of output 13 [2022-11-16 08:13:36,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:36,968 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:36,974 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-16 08:13:36,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 28 [2022-11-16 08:13:36,980 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:37,464 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse13 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse14 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse4 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse0 (+ .cse4 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse2 (+ .cse4 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (select v_DerPreprocessor_6 .cse0) 1) (= (select .cse1 .cse2) 1) (= (+ (select .cse3 .cse0) 1) 0) (= (+ 1 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base|) .cse2)) 0))))) (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse6 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse5 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse5 0) (= (+ (select .cse3 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse6)) 1) 0) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse6)) 1) (<= 0 .cse5)))) (not (<= c_~ARR_SIZE~0 0)) (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0) (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse12 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse7 (+ .cse12 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse9 (+ .cse12 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse10 (select .cse1 .cse9)) (.cse11 (select .cse3 .cse7)) (.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_32 .cse7) 1) (= (store .cse8 .cse9 .cse10) .cse1) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= .cse3 (store v_DerPreprocessor_32 .cse7 .cse11)) (= .cse10 1) (= (+ .cse11 1) 0) (= 0 (+ (select .cse8 .cse9) 1))))))) .cse13 .cse14 (not (and (exists ((v_DerPreprocessor_34 (Array Int Int)) (v_arrayElimArr_72 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse15 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse16 (+ .cse15 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse17 (select v_arrayElimArr_72 .cse16))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_72) |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ .cse15 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (- 1)) .cse3) (= (select .cse1 .cse16) 1) (= (+ .cse17 1) 0) (= v_arrayElimArr_72 (store .cse1 .cse16 .cse17))))))) .cse13 .cse14)) (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse23 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse18 (+ .cse23 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse20 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse21 (+ .cse23 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse22 (select .cse20 .cse21)) (.cse19 (select .cse3 .cse18))) (and (= .cse3 (store v_DerPreprocessor_14 .cse18 .cse19)) (= .cse20 (store .cse1 .cse21 .cse22)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse22 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse18) 1) (= (select .cse1 .cse21) 1) (= (+ .cse19 1) 0)))))))) is different from false [2022-11-16 08:13:37,481 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse13 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse14 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse4 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse0 (+ .cse4 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse2 (+ .cse4 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (select v_DerPreprocessor_6 .cse0) 1) (= (select .cse1 .cse2) 1) (= (+ (select .cse3 .cse0) 1) 0) (= (+ 1 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base|) .cse2)) 0))))) (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse6 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse5 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse5 0) (= (+ (select .cse3 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse6)) 1) 0) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse6)) 1) (<= 0 .cse5)))) (not (<= c_~ARR_SIZE~0 0)) (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0) (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse12 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse7 (+ .cse12 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse9 (+ .cse12 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse10 (select .cse1 .cse9)) (.cse11 (select .cse3 .cse7)) (.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_32 .cse7) 1) (= (store .cse8 .cse9 .cse10) .cse1) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= .cse3 (store v_DerPreprocessor_32 .cse7 .cse11)) (= .cse10 1) (= (+ .cse11 1) 0) (= 0 (+ (select .cse8 .cse9) 1))))))) .cse13 .cse14 (not (and (exists ((v_DerPreprocessor_34 (Array Int Int)) (v_arrayElimArr_72 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse15 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse16 (+ .cse15 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse17 (select v_arrayElimArr_72 .cse16))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_72) |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ .cse15 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (- 1)) .cse3) (= (select .cse1 .cse16) 1) (= (+ .cse17 1) 0) (= v_arrayElimArr_72 (store .cse1 .cse16 .cse17))))))) .cse13 .cse14)) (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse23 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse18 (+ .cse23 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse20 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse21 (+ .cse23 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse22 (select .cse20 .cse21)) (.cse19 (select .cse3 .cse18))) (and (= .cse3 (store v_DerPreprocessor_14 .cse18 .cse19)) (= .cse20 (store .cse1 .cse21 .cse22)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse22 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse18) 1) (= (select .cse1 .cse21) 1) (= (+ .cse19 1) 0))))))))) is different from true [2022-11-16 08:13:37,497 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse15 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (exists ((v_DerPreprocessor_34 (Array Int Int)) (v_arrayElimArr_72 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse0 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse3 (+ .cse0 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse4 (select v_arrayElimArr_72 .cse3))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_72) |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (- 1)) .cse1) (= (select .cse2 .cse3) 1) (= (+ .cse4 1) 0) (= v_arrayElimArr_72 (store .cse2 .cse3 .cse4))))))) (not (<= c_~ARR_SIZE~0 0)) .cse5 (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse11 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse6 (+ .cse11 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse8 (+ .cse11 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse9 (select .cse2 .cse8)) (.cse10 (select .cse1 .cse6)) (.cse7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_32 .cse6) 1) (= (store .cse7 .cse8 .cse9) .cse2) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= .cse1 (store v_DerPreprocessor_32 .cse6 .cse10)) (= .cse9 1) (= (+ .cse10 1) 0) (= 0 (+ (select .cse7 .cse8) 1))))))) (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse14 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse12 (+ .cse14 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse13 (+ .cse14 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (select v_DerPreprocessor_6 .cse12) 1) (= (select .cse2 .cse13) 1) (= (+ (select .cse1 .cse12) 1) 0) (= (+ 1 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base|) .cse13)) 0))))) (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) .cse5 .cse15)) .cse15 (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse21 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse16 (+ .cse21 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse18 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse19 (+ .cse21 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse20 (select .cse18 .cse19)) (.cse17 (select .cse1 .cse16))) (and (= .cse1 (store v_DerPreprocessor_14 .cse16 .cse17)) (= .cse18 (store .cse2 .cse19 .cse20)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse20 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse16) 1) (= (select .cse2 .cse19) 1) (= (+ .cse17 1) 0)))))))) is different from false [2022-11-16 08:13:37,510 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse5 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse15 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (exists ((v_DerPreprocessor_34 (Array Int Int)) (v_arrayElimArr_72 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse0 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse3 (+ .cse0 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse4 (select v_arrayElimArr_72 .cse3))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_72) |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (- 1)) .cse1) (= (select .cse2 .cse3) 1) (= (+ .cse4 1) 0) (= v_arrayElimArr_72 (store .cse2 .cse3 .cse4))))))) (not (<= c_~ARR_SIZE~0 0)) .cse5 (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse11 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse6 (+ .cse11 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse8 (+ .cse11 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse9 (select .cse2 .cse8)) (.cse10 (select .cse1 .cse6)) (.cse7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_32 .cse6) 1) (= (store .cse7 .cse8 .cse9) .cse2) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= .cse1 (store v_DerPreprocessor_32 .cse6 .cse10)) (= .cse9 1) (= (+ .cse10 1) 0) (= 0 (+ (select .cse7 .cse8) 1))))))) (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse14 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse12 (+ .cse14 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse13 (+ .cse14 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (select v_DerPreprocessor_6 .cse12) 1) (= (select .cse2 .cse13) 1) (= (+ (select .cse1 .cse12) 1) 0) (= (+ 1 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base|) .cse13)) 0))))) (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) .cse5 .cse15)) .cse15 (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse21 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse16 (+ .cse21 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse18 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse19 (+ .cse21 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse20 (select .cse18 .cse19)) (.cse17 (select .cse1 .cse16))) (and (= .cse1 (store v_DerPreprocessor_14 .cse16 .cse17)) (= .cse18 (store .cse2 .cse19 .cse20)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse20 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse16) 1) (= (select .cse2 .cse19) 1) (= (+ .cse17 1) 0))))))))) is different from true [2022-11-16 08:13:37,528 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (= |c_ULTIMATE.start_main_~count~0#1| 0)) (.cse6 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse10 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse7 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (not (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse4 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse0 (+ .cse4 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse2 (+ .cse4 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (select v_DerPreprocessor_6 .cse0) 1) (= (select .cse1 .cse2) 1) (= (+ (select .cse3 .cse0) 1) 0) (= (+ 1 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base|) .cse2)) 0))))) (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) .cse5 .cse6 .cse7)) .cse5 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse9 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse8 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse8 0) (= (+ (select .cse3 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse9)) 1) 0) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse9)) 1) (<= 0 .cse8)))) (not (<= c_~ARR_SIZE~0 0)) .cse6 .cse10 .cse7 (not (and .cse5 .cse6 (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse16 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse11 (+ .cse16 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse13 (+ .cse16 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse14 (select .cse1 .cse13)) (.cse15 (select .cse3 .cse11)) (.cse12 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_32 .cse11) 1) (= (store .cse12 .cse13 .cse14) .cse1) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= .cse3 (store v_DerPreprocessor_32 .cse11 .cse15)) (= .cse14 1) (= (+ .cse15 1) 0) (= 0 (+ (select .cse12 .cse13) 1))))))) .cse10 .cse7)))) is different from false [2022-11-16 08:13:37,538 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse5 (= |c_ULTIMATE.start_main_~count~0#1| 0)) (.cse6 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse10 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse7 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (not (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse4 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse0 (+ .cse4 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse2 (+ .cse4 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (select v_DerPreprocessor_6 .cse0) 1) (= (select .cse1 .cse2) 1) (= (+ (select .cse3 .cse0) 1) 0) (= (+ 1 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base|) .cse2)) 0))))) (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) .cse5 .cse6 .cse7)) .cse5 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse9 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse8 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse8 0) (= (+ (select .cse3 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse9)) 1) 0) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse9)) 1) (<= 0 .cse8)))) (not (<= c_~ARR_SIZE~0 0)) .cse6 .cse10 .cse7 (not (and .cse5 .cse6 (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse16 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse11 (+ .cse16 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse13 (+ .cse16 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse14 (select .cse1 .cse13)) (.cse15 (select .cse3 .cse11)) (.cse12 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_32 .cse11) 1) (= (store .cse12 .cse13 .cse14) .cse1) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= .cse3 (store v_DerPreprocessor_32 .cse11 .cse15)) (= .cse14 1) (= (+ .cse15 1) 0) (= 0 (+ (select .cse12 .cse13) 1))))))) .cse10 .cse7))))) is different from true [2022-11-16 08:13:37,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:37,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 47 states and 189 transitions. [2022-11-16 08:13:37,557 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 189 transitions. [2022-11-16 08:13:37,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:37,558 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:37,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:37,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:37,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:13:37,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:37,658 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:37,752 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:37,753 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:13:37,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:37,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:13:37,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:13:37,767 INFO L350 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 12 treesize of output 13 [2022-11-16 08:13:37,771 INFO L350 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 12 treesize of output 11 [2022-11-16 08:13:37,831 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:13:37,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 38 treesize of output 20 [2022-11-16 08:13:37,836 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:37,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:37,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 46 states and 168 transitions. [2022-11-16 08:13:37,888 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 168 transitions. [2022-11-16 08:13:37,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:37,888 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:37,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:37,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:37,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-16 08:13:37,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:37,974 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:38,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:38,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:13:38,127 INFO L350 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 12 treesize of output 11 [2022-11-16 08:13:38,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:13:38,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:13:38,202 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:13:38,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 38 treesize of output 20 [2022-11-16 08:13:38,207 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:38,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:38,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 45 states and 162 transitions. [2022-11-16 08:13:38,267 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 162 transitions. [2022-11-16 08:13:38,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:38,267 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:38,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:38,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:38,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:13:38,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:38,366 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:38,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:38,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:13:38,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:13:38,481 INFO L350 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 12 treesize of output 11 [2022-11-16 08:13:38,487 INFO L350 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 12 treesize of output 13 [2022-11-16 08:13:38,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:13:38,551 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:38,566 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:13:38,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:13:38,571 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:38,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:38,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 45 states and 162 transitions. [2022-11-16 08:13:38,619 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 162 transitions. [2022-11-16 08:13:38,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:38,620 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:38,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:38,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:38,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:13:38,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:38,698 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:38,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:38,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:13:38,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:13:38,820 INFO L350 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 12 treesize of output 13 [2022-11-16 08:13:38,826 INFO L350 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 12 treesize of output 11 [2022-11-16 08:13:38,839 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:13:38,907 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:38,922 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:13:38,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:13:38,934 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:38,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:38,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 45 states and 162 transitions. [2022-11-16 08:13:38,981 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 162 transitions. [2022-11-16 08:13:38,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:38,981 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:38,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:39,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-16 08:13:39,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:39,068 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:39,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:39,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 83 [2022-11-16 08:13:39,181 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:13:39,182 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 74 [2022-11-16 08:13:39,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 104 [2022-11-16 08:13:39,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:39,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 95 [2022-11-16 08:13:39,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2022-11-16 08:13:39,211 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:13:39,212 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 88 [2022-11-16 08:13:39,248 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-11-16 08:13:39,907 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 08:13:39,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 104 [2022-11-16 08:13:39,914 INFO L350 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 63 treesize of output 61 [2022-11-16 08:13:39,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:39,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 63 [2022-11-16 08:13:39,927 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:13:39,928 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2022-11-16 08:13:39,936 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:39,938 INFO L350 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 19 treesize of output 15 [2022-11-16 08:13:39,941 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:39,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-11-16 08:13:39,947 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:39,969 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse19 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse20 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse4 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse0 (+ .cse4 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse2 (+ .cse4 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (select v_DerPreprocessor_6 .cse0) 1) (= (select .cse1 .cse2) 1) (= (+ (select .cse3 .cse0) 1) 0) (= (+ 1 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base|) .cse2)) 0))))) (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse10 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse9 (+ .cse10 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse6 (+ .cse10 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_40) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse7 (select .cse1 .cse6)) (.cse8 (select .cse3 .cse9))) (and (= (+ (select .cse5 .cse6) 1) 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store .cse5 .cse6 .cse7) .cse1) (= .cse7 1) (= (+ .cse8 1) 0) (<= (select v_DerPreprocessor_41 .cse9) 1) (= .cse3 (store v_DerPreprocessor_41 .cse9 .cse8))))))) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse12 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse11 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse11 0) (= (+ (select .cse3 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse12)) 1) 0) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse12)) 1) (<= 0 .cse11)))) (not (<= c_~ARR_SIZE~0 0)) (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0) (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse18 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse13 (+ .cse18 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse15 (+ .cse18 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse16 (select .cse1 .cse15)) (.cse17 (select .cse3 .cse13)) (.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_32 .cse13) 1) (= (store .cse14 .cse15 .cse16) .cse1) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= .cse3 (store v_DerPreprocessor_32 .cse13 .cse17)) (= .cse16 1) (= (+ .cse17 1) 0) (= 0 (+ (select .cse14 .cse15) 1))))))) .cse19 .cse20 (not (and (exists ((v_DerPreprocessor_34 (Array Int Int)) (v_arrayElimArr_72 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse21 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse22 (+ .cse21 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse23 (select v_arrayElimArr_72 .cse22))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_72) |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ .cse21 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (- 1)) .cse3) (= (select .cse1 .cse22) 1) (= (+ .cse23 1) 0) (= v_arrayElimArr_72 (store .cse1 .cse22 .cse23))))))) .cse19 .cse20)) (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse29 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse24 (+ .cse29 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse26 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse27 (+ .cse29 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse28 (select .cse26 .cse27)) (.cse25 (select .cse3 .cse24))) (and (= .cse3 (store v_DerPreprocessor_14 .cse24 .cse25)) (= .cse26 (store .cse1 .cse27 .cse28)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse28 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse24) 1) (= (select .cse1 .cse27) 1) (= (+ .cse25 1) 0)))))))) is different from false [2022-11-16 08:13:40,249 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse19 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse20 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse4 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse0 (+ .cse4 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse2 (+ .cse4 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (select v_DerPreprocessor_6 .cse0) 1) (= (select .cse1 .cse2) 1) (= (+ (select .cse3 .cse0) 1) 0) (= (+ 1 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base|) .cse2)) 0))))) (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse10 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse9 (+ .cse10 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse6 (+ .cse10 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_40) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse7 (select .cse1 .cse6)) (.cse8 (select .cse3 .cse9))) (and (= (+ (select .cse5 .cse6) 1) 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store .cse5 .cse6 .cse7) .cse1) (= .cse7 1) (= (+ .cse8 1) 0) (<= (select v_DerPreprocessor_41 .cse9) 1) (= .cse3 (store v_DerPreprocessor_41 .cse9 .cse8))))))) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse12 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse11 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse11 0) (= (+ (select .cse3 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse12)) 1) 0) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse12)) 1) (<= 0 .cse11)))) (not (<= c_~ARR_SIZE~0 0)) (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0) (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse18 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse13 (+ .cse18 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse15 (+ .cse18 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse16 (select .cse1 .cse15)) (.cse17 (select .cse3 .cse13)) (.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_32 .cse13) 1) (= (store .cse14 .cse15 .cse16) .cse1) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= .cse3 (store v_DerPreprocessor_32 .cse13 .cse17)) (= .cse16 1) (= (+ .cse17 1) 0) (= 0 (+ (select .cse14 .cse15) 1))))))) .cse19 .cse20 (not (and (exists ((v_DerPreprocessor_34 (Array Int Int)) (v_arrayElimArr_72 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse21 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse22 (+ .cse21 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse23 (select v_arrayElimArr_72 .cse22))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_72) |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ .cse21 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (- 1)) .cse3) (= (select .cse1 .cse22) 1) (= (+ .cse23 1) 0) (= v_arrayElimArr_72 (store .cse1 .cse22 .cse23))))))) .cse19 .cse20)) (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse29 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse24 (+ .cse29 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse26 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse27 (+ .cse29 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse28 (select .cse26 .cse27)) (.cse25 (select .cse3 .cse24))) (and (= .cse3 (store v_DerPreprocessor_14 .cse24 .cse25)) (= .cse26 (store .cse1 .cse27 .cse28)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse28 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse24) 1) (= (select .cse1 .cse27) 1) (= (+ .cse25 1) 0))))))))) is different from true [2022-11-16 08:13:40,258 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse14 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse15 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse7 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse5 (+ .cse7 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse1 (+ .cse7 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_40) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse2 (select .cse3 .cse1)) (.cse4 (select .cse6 .cse5))) (and (= (+ (select .cse0 .cse1) 1) 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store .cse0 .cse1 .cse2) .cse3) (= .cse2 1) (= (+ .cse4 1) 0) (<= (select v_DerPreprocessor_41 .cse5) 1) (= .cse6 (store v_DerPreprocessor_41 .cse5 .cse4))))))) (not (<= c_~ARR_SIZE~0 0)) (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0) (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse13 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse8 (+ .cse13 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse10 (+ .cse13 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse11 (select .cse3 .cse10)) (.cse12 (select .cse6 .cse8)) (.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_32 .cse8) 1) (= (store .cse9 .cse10 .cse11) .cse3) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= .cse6 (store v_DerPreprocessor_32 .cse8 .cse12)) (= .cse11 1) (= (+ .cse12 1) 0) (= 0 (+ (select .cse9 .cse10) 1))))))) .cse14 .cse15 (not (and (exists ((v_DerPreprocessor_34 (Array Int Int)) (v_arrayElimArr_72 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse16 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse17 (+ .cse16 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse18 (select v_arrayElimArr_72 .cse17))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_72) |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ .cse16 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (- 1)) .cse6) (= (select .cse3 .cse17) 1) (= (+ .cse18 1) 0) (= v_arrayElimArr_72 (store .cse3 .cse17 .cse18))))))) .cse14 .cse15)) (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse24 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse19 (+ .cse24 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse21 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse22 (+ .cse24 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse23 (select .cse21 .cse22)) (.cse20 (select .cse6 .cse19))) (and (= .cse6 (store v_DerPreprocessor_14 .cse19 .cse20)) (= .cse21 (store .cse3 .cse22 .cse23)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse23 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse19) 1) (= (select .cse3 .cse22) 1) (= (+ .cse20 1) 0)))))))) is different from false [2022-11-16 08:13:40,267 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse9 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse10 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (not (and (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse7 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse5 (+ .cse7 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse1 (+ .cse7 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_40) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse2 (select .cse3 .cse1)) (.cse4 (select .cse6 .cse5))) (and (= (+ (select .cse0 .cse1) 1) 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store .cse0 .cse1 .cse2) .cse3) (= .cse2 1) (= (+ .cse4 1) 0) (<= (select v_DerPreprocessor_41 .cse5) 1) (= .cse6 (store v_DerPreprocessor_41 .cse5 .cse4))))))) .cse8 .cse9 .cse10)) (not (<= c_~ARR_SIZE~0 0)) .cse8 (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse16 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse11 (+ .cse16 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse13 (+ .cse16 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse14 (select .cse3 .cse13)) (.cse15 (select .cse6 .cse11)) (.cse12 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_32 .cse11) 1) (= (store .cse12 .cse13 .cse14) .cse3) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= .cse6 (store v_DerPreprocessor_32 .cse11 .cse15)) (= .cse14 1) (= (+ .cse15 1) 0) (= 0 (+ (select .cse12 .cse13) 1))))))) .cse9 .cse10 (not (and (exists ((v_DerPreprocessor_34 (Array Int Int)) (v_arrayElimArr_72 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse17 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse18 (+ .cse17 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse19 (select v_arrayElimArr_72 .cse18))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_72) |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ .cse17 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (- 1)) .cse6) (= (select .cse3 .cse18) 1) (= (+ .cse19 1) 0) (= v_arrayElimArr_72 (store .cse3 .cse18 .cse19))))))) .cse9 .cse10)) (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse25 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse20 (+ .cse25 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse22 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse23 (+ .cse25 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse24 (select .cse22 .cse23)) (.cse21 (select .cse6 .cse20))) (and (= .cse6 (store v_DerPreprocessor_14 .cse20 .cse21)) (= .cse22 (store .cse3 .cse23 .cse24)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse24 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse20) 1) (= (select .cse3 .cse23) 1) (= (+ .cse21 1) 0)))))))) is different from false [2022-11-16 08:13:40,278 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse14 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse15 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse7 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse5 (+ .cse7 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse1 (+ .cse7 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_40) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse2 (select .cse3 .cse1)) (.cse4 (select .cse6 .cse5))) (and (= (+ (select .cse0 .cse1) 1) 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store .cse0 .cse1 .cse2) .cse3) (= .cse2 1) (= (+ .cse4 1) 0) (<= (select v_DerPreprocessor_41 .cse5) 1) (= .cse6 (store v_DerPreprocessor_41 .cse5 .cse4))))))) (not (<= c_~ARR_SIZE~0 0)) (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0) (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse13 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse8 (+ .cse13 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse10 (+ .cse13 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse11 (select .cse3 .cse10)) (.cse12 (select .cse6 .cse8)) (.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_32 .cse8) 1) (= (store .cse9 .cse10 .cse11) .cse3) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= .cse6 (store v_DerPreprocessor_32 .cse8 .cse12)) (= .cse11 1) (= (+ .cse12 1) 0) (= 0 (+ (select .cse9 .cse10) 1))))))) .cse14 .cse15 (not (and (exists ((v_DerPreprocessor_34 (Array Int Int)) (v_arrayElimArr_72 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse16 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse17 (+ .cse16 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse18 (select v_arrayElimArr_72 .cse17))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_72) |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ .cse16 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (- 1)) .cse6) (= (select .cse3 .cse17) 1) (= (+ .cse18 1) 0) (= v_arrayElimArr_72 (store .cse3 .cse17 .cse18))))))) .cse14 .cse15)) (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse24 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse19 (+ .cse24 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse21 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse22 (+ .cse24 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse23 (select .cse21 .cse22)) (.cse20 (select .cse6 .cse19))) (and (= .cse6 (store v_DerPreprocessor_14 .cse19 .cse20)) (= .cse21 (store .cse3 .cse22 .cse23)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse23 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse19) 1) (= (select .cse3 .cse22) 1) (= (+ .cse20 1) 0))))))))) is different from true [2022-11-16 08:13:40,288 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse8 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse9 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse10 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (not (and (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse7 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse5 (+ .cse7 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse1 (+ .cse7 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_40) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse2 (select .cse3 .cse1)) (.cse4 (select .cse6 .cse5))) (and (= (+ (select .cse0 .cse1) 1) 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store .cse0 .cse1 .cse2) .cse3) (= .cse2 1) (= (+ .cse4 1) 0) (<= (select v_DerPreprocessor_41 .cse5) 1) (= .cse6 (store v_DerPreprocessor_41 .cse5 .cse4))))))) .cse8 .cse9 .cse10)) (not (<= c_~ARR_SIZE~0 0)) .cse8 (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse16 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse11 (+ .cse16 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse13 (+ .cse16 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse14 (select .cse3 .cse13)) (.cse15 (select .cse6 .cse11)) (.cse12 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_32 .cse11) 1) (= (store .cse12 .cse13 .cse14) .cse3) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= .cse6 (store v_DerPreprocessor_32 .cse11 .cse15)) (= .cse14 1) (= (+ .cse15 1) 0) (= 0 (+ (select .cse12 .cse13) 1))))))) .cse9 .cse10 (not (and (exists ((v_DerPreprocessor_34 (Array Int Int)) (v_arrayElimArr_72 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse17 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse18 (+ .cse17 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse19 (select v_arrayElimArr_72 .cse18))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_72) |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ .cse17 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (- 1)) .cse6) (= (select .cse3 .cse18) 1) (= (+ .cse19 1) 0) (= v_arrayElimArr_72 (store .cse3 .cse18 .cse19))))))) .cse9 .cse10)) (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse25 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse20 (+ .cse25 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse22 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse23 (+ .cse25 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse24 (select .cse22 .cse23)) (.cse21 (select .cse6 .cse20))) (and (= .cse6 (store v_DerPreprocessor_14 .cse20 .cse21)) (= .cse22 (store .cse3 .cse23 .cse24)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse24 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse20) 1) (= (select .cse3 .cse23) 1) (= (+ .cse21 1) 0))))))))) is different from true [2022-11-16 08:13:40,602 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse6 (select .cse14 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse7 (select .cse12 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse9 (= .cse7 0)) (.cse10 (= .cse6 0))) (let ((.cse8 (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse29 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse30 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse14 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse29 .cse30)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse12 (+ .cse29 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse30)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse9 .cse10)) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= |c_ULTIMATE.start_main_~count~0#1| 0)) (.cse2 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse28 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse27 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse27 0) (= (+ (select .cse12 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse28)) 1) 0) (= (select .cse14 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse28)) 1) (<= 0 .cse27))))) (.cse4 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse3 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (and .cse1 .cse2 .cse4 .cse5 .cse3)) (or (and (= .cse6 1) (= (+ .cse7 1) 0)) .cse8 (and .cse9 .cse10 (exists ((v_DerPreprocessor_19 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse16 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse13 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse16)) (.cse11 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse15 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse16))) (and (= (select .cse11 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse12 .cse13) 1) 0) (= (select v_DerPreprocessor_19 .cse13) 1) (= (select .cse14 .cse15) 1) (= (+ (select .cse11 .cse15) 1) 0) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0))))))) (not (and (or .cse8 (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse20 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse17 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse18 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse20)) (.cse19 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse20))) (and (= (select .cse17 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse12 .cse18) 1) 0) (= (+ (select .cse17 .cse19) 1) 0) (= (select v_DerPreprocessor_4 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_4 .cse18) 1) (= (select .cse14 .cse19) 1))))) .cse9 .cse10)) .cse1 .cse4 .cse5)) (not (and (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse26 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse25 (+ .cse26 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse22 (+ .cse26 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse21 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_40) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse23 (select .cse14 .cse22)) (.cse24 (select .cse12 .cse25))) (and (= (+ (select .cse21 .cse22) 1) 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store .cse21 .cse22 .cse23) .cse14) (= .cse23 1) (= (+ .cse24 1) 0) (<= (select v_DerPreprocessor_41 .cse25) 1) (= .cse12 (store v_DerPreprocessor_41 .cse25 .cse24))))))) .cse1 .cse4 .cse5 .cse3)) (not (and (<= c_~ARR_SIZE~0 0) (<= 0 |c_ULTIMATE.start_main_~count~0#1|))) .cse1 (not (and .cse0 .cse1 .cse2)) .cse4 .cse5 .cse3))))) is different from false [2022-11-16 08:13:40,617 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse6 (select .cse14 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse7 (select .cse12 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse9 (= .cse7 0)) (.cse10 (= .cse6 0))) (let ((.cse8 (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse29 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse30 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse14 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse29 .cse30)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse12 (+ .cse29 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse30)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse9 .cse10)) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= |c_ULTIMATE.start_main_~count~0#1| 0)) (.cse2 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse28 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse27 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse27 0) (= (+ (select .cse12 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse28)) 1) 0) (= (select .cse14 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse28)) 1) (<= 0 .cse27))))) (.cse4 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse3 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (and .cse1 .cse2 .cse4 .cse5 .cse3)) (or (and (= .cse6 1) (= (+ .cse7 1) 0)) .cse8 (and .cse9 .cse10 (exists ((v_DerPreprocessor_19 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse16 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse13 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse16)) (.cse11 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse15 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse16))) (and (= (select .cse11 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse12 .cse13) 1) 0) (= (select v_DerPreprocessor_19 .cse13) 1) (= (select .cse14 .cse15) 1) (= (+ (select .cse11 .cse15) 1) 0) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0))))))) (not (and (or .cse8 (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse20 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse17 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse18 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse20)) (.cse19 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse20))) (and (= (select .cse17 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse12 .cse18) 1) 0) (= (+ (select .cse17 .cse19) 1) 0) (= (select v_DerPreprocessor_4 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_4 .cse18) 1) (= (select .cse14 .cse19) 1))))) .cse9 .cse10)) .cse1 .cse4 .cse5)) (not (and (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse26 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse25 (+ .cse26 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse22 (+ .cse26 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse21 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_40) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse23 (select .cse14 .cse22)) (.cse24 (select .cse12 .cse25))) (and (= (+ (select .cse21 .cse22) 1) 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store .cse21 .cse22 .cse23) .cse14) (= .cse23 1) (= (+ .cse24 1) 0) (<= (select v_DerPreprocessor_41 .cse25) 1) (= .cse12 (store v_DerPreprocessor_41 .cse25 .cse24))))))) .cse1 .cse4 .cse5 .cse3)) (not (and (<= c_~ARR_SIZE~0 0) (<= 0 |c_ULTIMATE.start_main_~count~0#1|))) .cse1 (not (and .cse0 .cse1 .cse2)) .cse4 .cse5 .cse3)))))) is different from true [2022-11-16 08:13:40,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:40,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 46 states and 169 transitions. [2022-11-16 08:13:40,633 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 169 transitions. [2022-11-16 08:13:40,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:40,633 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:40,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:40,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:40,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:13:40,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:40,720 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:40,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:13:40,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:40,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:13:40,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:13:40,832 INFO L350 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 12 treesize of output 13 [2022-11-16 08:13:40,837 INFO L350 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 12 treesize of output 11 [2022-11-16 08:13:40,889 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:40,904 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:13:40,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:13:40,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:40,946 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse16 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse17 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse7 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse5 (+ .cse7 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse1 (+ .cse7 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_40) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse2 (select .cse3 .cse1)) (.cse4 (select .cse6 .cse5))) (and (= (+ (select .cse0 .cse1) 1) 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store .cse0 .cse1 .cse2) .cse3) (= .cse2 1) (= (+ .cse4 1) 0) (<= (select v_DerPreprocessor_41 .cse5) 1) (= .cse6 (store v_DerPreprocessor_41 .cse5 .cse4))))))) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse9 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse8 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse8 0) (= (+ (select .cse6 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse9)) 1) 0) (= (select .cse3 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse9)) 1) (<= 0 .cse8)))) (not (<= c_~ARR_SIZE~0 0)) (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0) (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse15 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse10 (+ .cse15 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse12 (+ .cse15 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse13 (select .cse3 .cse12)) (.cse14 (select .cse6 .cse10)) (.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_32 .cse10) 1) (= (store .cse11 .cse12 .cse13) .cse3) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= .cse6 (store v_DerPreprocessor_32 .cse10 .cse14)) (= .cse13 1) (= (+ .cse14 1) 0) (= 0 (+ (select .cse11 .cse12) 1))))))) .cse16 .cse17 (not (and (exists ((v_DerPreprocessor_34 (Array Int Int)) (v_arrayElimArr_72 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse18 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse19 (+ .cse18 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse20 (select v_arrayElimArr_72 .cse19))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_72) |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ .cse18 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (- 1)) .cse6) (= (select .cse3 .cse19) 1) (= (+ .cse20 1) 0) (= v_arrayElimArr_72 (store .cse3 .cse19 .cse20))))))) .cse16 .cse17)) (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse26 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse21 (+ .cse26 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse23 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse24 (+ .cse26 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse25 (select .cse23 .cse24)) (.cse22 (select .cse6 .cse21))) (and (= .cse6 (store v_DerPreprocessor_14 .cse21 .cse22)) (= .cse23 (store .cse3 .cse24 .cse25)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse25 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse21) 1) (= (select .cse3 .cse24) 1) (= (+ .cse22 1) 0)))))))) is different from false [2022-11-16 08:13:40,964 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse16 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse17 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse7 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse5 (+ .cse7 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse1 (+ .cse7 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_40) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse2 (select .cse3 .cse1)) (.cse4 (select .cse6 .cse5))) (and (= (+ (select .cse0 .cse1) 1) 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store .cse0 .cse1 .cse2) .cse3) (= .cse2 1) (= (+ .cse4 1) 0) (<= (select v_DerPreprocessor_41 .cse5) 1) (= .cse6 (store v_DerPreprocessor_41 .cse5 .cse4))))))) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse9 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse8 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse8 0) (= (+ (select .cse6 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse9)) 1) 0) (= (select .cse3 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse9)) 1) (<= 0 .cse8)))) (not (<= c_~ARR_SIZE~0 0)) (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0) (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse15 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse10 (+ .cse15 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse12 (+ .cse15 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse13 (select .cse3 .cse12)) (.cse14 (select .cse6 .cse10)) (.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_32 .cse10) 1) (= (store .cse11 .cse12 .cse13) .cse3) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= .cse6 (store v_DerPreprocessor_32 .cse10 .cse14)) (= .cse13 1) (= (+ .cse14 1) 0) (= 0 (+ (select .cse11 .cse12) 1))))))) .cse16 .cse17 (not (and (exists ((v_DerPreprocessor_34 (Array Int Int)) (v_arrayElimArr_72 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse18 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse19 (+ .cse18 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse20 (select v_arrayElimArr_72 .cse19))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_72) |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ .cse18 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (- 1)) .cse6) (= (select .cse3 .cse19) 1) (= (+ .cse20 1) 0) (= v_arrayElimArr_72 (store .cse3 .cse19 .cse20))))))) .cse16 .cse17)) (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse26 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse21 (+ .cse26 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse23 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse24 (+ .cse26 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse25 (select .cse23 .cse24)) (.cse22 (select .cse6 .cse21))) (and (= .cse6 (store v_DerPreprocessor_14 .cse21 .cse22)) (= .cse23 (store .cse3 .cse24 .cse25)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse25 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse21) 1) (= (select .cse3 .cse24) 1) (= (+ .cse22 1) 0))))))))) is different from true [2022-11-16 08:13:40,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:40,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 46 states and 169 transitions. [2022-11-16 08:13:40,991 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 169 transitions. [2022-11-16 08:13:40,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:40,992 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:40,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:41,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:41,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-16 08:13:41,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:41,064 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:41,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:41,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:13:41,219 INFO L350 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 12 treesize of output 11 [2022-11-16 08:13:41,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:13:41,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:13:41,293 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:13:41,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 38 treesize of output 20 [2022-11-16 08:13:41,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:41,336 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse16 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse17 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse7 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse5 (+ .cse7 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse1 (+ .cse7 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_40) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse2 (select .cse3 .cse1)) (.cse4 (select .cse6 .cse5))) (and (= (+ (select .cse0 .cse1) 1) 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store .cse0 .cse1 .cse2) .cse3) (= .cse2 1) (= (+ .cse4 1) 0) (<= (select v_DerPreprocessor_41 .cse5) 1) (= .cse6 (store v_DerPreprocessor_41 .cse5 .cse4))))))) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse9 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse8 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse8 0) (= (+ (select .cse6 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse9)) 1) 0) (= (select .cse3 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse9)) 1) (<= 0 .cse8)))) (not (<= c_~ARR_SIZE~0 0)) (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0) (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse15 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse10 (+ .cse15 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse12 (+ .cse15 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse13 (select .cse3 .cse12)) (.cse14 (select .cse6 .cse10)) (.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_32 .cse10) 1) (= (store .cse11 .cse12 .cse13) .cse3) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= .cse6 (store v_DerPreprocessor_32 .cse10 .cse14)) (= .cse13 1) (= (+ .cse14 1) 0) (= 0 (+ (select .cse11 .cse12) 1))))))) .cse16 .cse17 (not (and (exists ((v_DerPreprocessor_34 (Array Int Int)) (v_arrayElimArr_72 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse18 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse19 (+ .cse18 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse20 (select v_arrayElimArr_72 .cse19))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_72) |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ .cse18 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (- 1)) .cse6) (= (select .cse3 .cse19) 1) (= (+ .cse20 1) 0) (= v_arrayElimArr_72 (store .cse3 .cse19 .cse20))))))) .cse16 .cse17)) (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse26 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse21 (+ .cse26 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse23 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse24 (+ .cse26 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse25 (select .cse23 .cse24)) (.cse22 (select .cse6 .cse21))) (and (= .cse6 (store v_DerPreprocessor_14 .cse21 .cse22)) (= .cse23 (store .cse3 .cse24 .cse25)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse25 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse21) 1) (= (select .cse3 .cse24) 1) (= (+ .cse22 1) 0)))))))) is different from false [2022-11-16 08:13:41,355 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse16 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse17 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse7 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse5 (+ .cse7 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse1 (+ .cse7 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_40) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse2 (select .cse3 .cse1)) (.cse4 (select .cse6 .cse5))) (and (= (+ (select .cse0 .cse1) 1) 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store .cse0 .cse1 .cse2) .cse3) (= .cse2 1) (= (+ .cse4 1) 0) (<= (select v_DerPreprocessor_41 .cse5) 1) (= .cse6 (store v_DerPreprocessor_41 .cse5 .cse4))))))) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse9 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse8 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse8 0) (= (+ (select .cse6 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse9)) 1) 0) (= (select .cse3 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse9)) 1) (<= 0 .cse8)))) (not (<= c_~ARR_SIZE~0 0)) (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0) (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse15 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse10 (+ .cse15 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse12 (+ .cse15 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse13 (select .cse3 .cse12)) (.cse14 (select .cse6 .cse10)) (.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_32 .cse10) 1) (= (store .cse11 .cse12 .cse13) .cse3) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= .cse6 (store v_DerPreprocessor_32 .cse10 .cse14)) (= .cse13 1) (= (+ .cse14 1) 0) (= 0 (+ (select .cse11 .cse12) 1))))))) .cse16 .cse17 (not (and (exists ((v_DerPreprocessor_34 (Array Int Int)) (v_arrayElimArr_72 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse18 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse19 (+ .cse18 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse20 (select v_arrayElimArr_72 .cse19))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_72) |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ .cse18 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (- 1)) .cse6) (= (select .cse3 .cse19) 1) (= (+ .cse20 1) 0) (= v_arrayElimArr_72 (store .cse3 .cse19 .cse20))))))) .cse16 .cse17)) (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse26 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse21 (+ .cse26 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse23 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse24 (+ .cse26 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse25 (select .cse23 .cse24)) (.cse22 (select .cse6 .cse21))) (and (= .cse6 (store v_DerPreprocessor_14 .cse21 .cse22)) (= .cse23 (store .cse3 .cse24 .cse25)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse25 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse21) 1) (= (select .cse3 .cse24) 1) (= (+ .cse22 1) 0))))))))) is different from true [2022-11-16 08:13:41,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:41,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 46 states and 169 transitions. [2022-11-16 08:13:41,398 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 169 transitions. [2022-11-16 08:13:41,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:41,398 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:41,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:41,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:41,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-16 08:13:41,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:41,477 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:41,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:41,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:13:41,611 INFO L350 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 12 treesize of output 11 [2022-11-16 08:13:41,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:13:41,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:13:41,676 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:41,690 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:13:41,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:13:41,696 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:41,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:41,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 46 states and 169 transitions. [2022-11-16 08:13:41,796 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 169 transitions. [2022-11-16 08:13:41,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:41,797 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:41,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:41,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:41,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-16 08:13:41,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:41,871 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:41,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:13:41,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:41,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:13:41,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:13:42,003 INFO L350 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 12 treesize of output 13 [2022-11-16 08:13:42,007 INFO L350 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 12 treesize of output 11 [2022-11-16 08:13:42,066 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:42,080 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:13:42,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:13:42,085 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:42,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:42,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 46 states and 169 transitions. [2022-11-16 08:13:42,140 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 169 transitions. [2022-11-16 08:13:42,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:42,140 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:42,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:42,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:42,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-16 08:13:42,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:42,228 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:42,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:13:42,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:42,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:13:42,365 INFO L350 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 12 treesize of output 11 [2022-11-16 08:13:42,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:13:42,423 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:42,439 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:13:42,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:13:42,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:42,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:42,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 46 states and 169 transitions. [2022-11-16 08:13:42,517 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 169 transitions. [2022-11-16 08:13:42,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:42,518 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:42,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:42,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-16 08:13:42,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:42,613 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:42,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:42,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:13:42,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:13:42,744 INFO L350 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 12 treesize of output 13 [2022-11-16 08:13:42,749 INFO L350 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 12 treesize of output 11 [2022-11-16 08:13:42,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:13:42,808 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:42,823 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:13:42,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:13:42,833 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:42,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:42,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 46 states and 169 transitions. [2022-11-16 08:13:42,952 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 169 transitions. [2022-11-16 08:13:42,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:42,952 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:42,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:42,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:43,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-16 08:13:43,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:43,030 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:43,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:13:43,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:43,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:13:43,151 INFO L350 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 12 treesize of output 11 [2022-11-16 08:13:43,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:13:43,207 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:43,221 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:13:43,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:13:43,226 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:43,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:43,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 46 states and 169 transitions. [2022-11-16 08:13:43,289 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 169 transitions. [2022-11-16 08:13:43,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:43,290 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:43,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:43,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:43,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:13:43,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:43,382 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:43,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:43,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:13:43,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:13:43,510 INFO L350 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 12 treesize of output 11 [2022-11-16 08:13:43,515 INFO L350 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 12 treesize of output 13 [2022-11-16 08:13:43,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:13:43,578 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:43,594 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:13:43,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:13:43,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:43,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:43,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 46 states and 169 transitions. [2022-11-16 08:13:43,691 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 169 transitions. [2022-11-16 08:13:43,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:43,692 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:43,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:43,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:43,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:13:43,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:43,769 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:43,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:43,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:13:43,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:13:43,893 INFO L350 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 12 treesize of output 11 [2022-11-16 08:13:43,898 INFO L350 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 12 treesize of output 13 [2022-11-16 08:13:43,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:13:43,975 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:43,991 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:13:43,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:13:43,996 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:44,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:44,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 46 states and 169 transitions. [2022-11-16 08:13:44,087 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 169 transitions. [2022-11-16 08:13:44,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:44,088 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:44,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:44,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:44,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-16 08:13:44,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:44,181 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:44,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2022-11-16 08:13:44,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-11-16 08:13:44,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:44,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 81 [2022-11-16 08:13:44,850 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:13:44,850 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 75 [2022-11-16 08:13:44,854 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:44,855 INFO L350 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 112 treesize of output 77 [2022-11-16 08:13:44,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:44,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2022-11-16 08:13:44,873 INFO L350 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 12 treesize of output 13 [2022-11-16 08:13:45,333 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:45,339 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-16 08:13:45,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 17 [2022-11-16 08:13:45,344 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:45,856 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse20 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse21 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse4 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse0 (+ .cse4 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse2 (+ .cse4 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (select v_DerPreprocessor_6 .cse0) 1) (= (select .cse1 .cse2) 1) (= (+ (select .cse3 .cse0) 1) 0) (= (+ 1 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base|) .cse2)) 0))))) (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (exists ((|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse5 (* 4 |ULTIMATE.start_main_~index~0#1|))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (select .cse1 (+ .cse5 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) 1) (= (+ (select .cse3 (+ .cse5 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 1) 0)))) (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse11 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse10 (+ .cse11 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse7 (+ .cse11 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_40) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse8 (select .cse1 .cse7)) (.cse9 (select .cse3 .cse10))) (and (= (+ (select .cse6 .cse7) 1) 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store .cse6 .cse7 .cse8) .cse1) (= .cse8 1) (= (+ .cse9 1) 0) (<= (select v_DerPreprocessor_41 .cse10) 1) (= .cse3 (store v_DerPreprocessor_41 .cse10 .cse9))))))) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse13 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse12 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse12 0) (= (+ (select .cse3 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse13)) 1) 0) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse13)) 1) (<= 0 .cse12)))) (not (<= c_~ARR_SIZE~0 0)) (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0) (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse19 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse14 (+ .cse19 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse16 (+ .cse19 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse17 (select .cse1 .cse16)) (.cse18 (select .cse3 .cse14)) (.cse15 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_32 .cse14) 1) (= (store .cse15 .cse16 .cse17) .cse1) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= .cse3 (store v_DerPreprocessor_32 .cse14 .cse18)) (= .cse17 1) (= (+ .cse18 1) 0) (= 0 (+ (select .cse15 .cse16) 1))))))) .cse20 .cse21 (not (and (exists ((v_DerPreprocessor_34 (Array Int Int)) (v_arrayElimArr_72 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse22 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse23 (+ .cse22 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse24 (select v_arrayElimArr_72 .cse23))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_72) |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ .cse22 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (- 1)) .cse3) (= (select .cse1 .cse23) 1) (= (+ .cse24 1) 0) (= v_arrayElimArr_72 (store .cse1 .cse23 .cse24))))))) .cse20 .cse21)) (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse30 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse25 (+ .cse30 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse27 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse28 (+ .cse30 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse29 (select .cse27 .cse28)) (.cse26 (select .cse3 .cse25))) (and (= .cse3 (store v_DerPreprocessor_14 .cse25 .cse26)) (= .cse27 (store .cse1 .cse28 .cse29)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse29 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse25) 1) (= (select .cse1 .cse28) 1) (= (+ .cse26 1) 0)))))))) is different from false [2022-11-16 08:13:46,072 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse20 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse21 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse4 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse0 (+ .cse4 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse2 (+ .cse4 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (select v_DerPreprocessor_6 .cse0) 1) (= (select .cse1 .cse2) 1) (= (+ (select .cse3 .cse0) 1) 0) (= (+ 1 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base|) .cse2)) 0))))) (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (exists ((|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse5 (* 4 |ULTIMATE.start_main_~index~0#1|))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (select .cse1 (+ .cse5 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) 1) (= (+ (select .cse3 (+ .cse5 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 1) 0)))) (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse11 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse10 (+ .cse11 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse7 (+ .cse11 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_40) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse8 (select .cse1 .cse7)) (.cse9 (select .cse3 .cse10))) (and (= (+ (select .cse6 .cse7) 1) 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store .cse6 .cse7 .cse8) .cse1) (= .cse8 1) (= (+ .cse9 1) 0) (<= (select v_DerPreprocessor_41 .cse10) 1) (= .cse3 (store v_DerPreprocessor_41 .cse10 .cse9))))))) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse13 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse12 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse12 0) (= (+ (select .cse3 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse13)) 1) 0) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse13)) 1) (<= 0 .cse12)))) (not (<= c_~ARR_SIZE~0 0)) (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0) (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse19 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse14 (+ .cse19 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse16 (+ .cse19 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse17 (select .cse1 .cse16)) (.cse18 (select .cse3 .cse14)) (.cse15 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_32 .cse14) 1) (= (store .cse15 .cse16 .cse17) .cse1) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= .cse3 (store v_DerPreprocessor_32 .cse14 .cse18)) (= .cse17 1) (= (+ .cse18 1) 0) (= 0 (+ (select .cse15 .cse16) 1))))))) .cse20 .cse21 (not (and (exists ((v_DerPreprocessor_34 (Array Int Int)) (v_arrayElimArr_72 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse22 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse23 (+ .cse22 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse24 (select v_arrayElimArr_72 .cse23))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_72) |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ .cse22 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (- 1)) .cse3) (= (select .cse1 .cse23) 1) (= (+ .cse24 1) 0) (= v_arrayElimArr_72 (store .cse1 .cse23 .cse24))))))) .cse20 .cse21)) (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse30 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse25 (+ .cse30 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse27 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse28 (+ .cse30 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse29 (select .cse27 .cse28)) (.cse26 (select .cse3 .cse25))) (and (= .cse3 (store v_DerPreprocessor_14 .cse25 .cse26)) (= .cse27 (store .cse1 .cse28 .cse29)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse29 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse25) 1) (= (select .cse1 .cse28) 1) (= (+ .cse26 1) 0))))))))) is different from true [2022-11-16 08:13:46,087 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse17 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse18 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (exists ((|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse1 (* 4 |ULTIMATE.start_main_~index~0#1|))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) 1) (= (+ (select .cse2 (+ .cse1 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 1) 0)))) (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse8 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse7 (+ .cse8 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse4 (+ .cse8 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_40) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse5 (select .cse0 .cse4)) (.cse6 (select .cse2 .cse7))) (and (= (+ (select .cse3 .cse4) 1) 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store .cse3 .cse4 .cse5) .cse0) (= .cse5 1) (= (+ .cse6 1) 0) (<= (select v_DerPreprocessor_41 .cse7) 1) (= .cse2 (store v_DerPreprocessor_41 .cse7 .cse6))))))) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse10 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse9 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse9 0) (= (+ (select .cse2 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse10)) 1) 0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse10)) 1) (<= 0 .cse9)))) (not (<= c_~ARR_SIZE~0 0)) (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0) (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse16 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse11 (+ .cse16 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse13 (+ .cse16 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse14 (select .cse0 .cse13)) (.cse15 (select .cse2 .cse11)) (.cse12 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_32 .cse11) 1) (= (store .cse12 .cse13 .cse14) .cse0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= .cse2 (store v_DerPreprocessor_32 .cse11 .cse15)) (= .cse14 1) (= (+ .cse15 1) 0) (= 0 (+ (select .cse12 .cse13) 1))))))) .cse17 .cse18 (not (and (exists ((v_DerPreprocessor_34 (Array Int Int)) (v_arrayElimArr_72 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse19 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse20 (+ .cse19 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse21 (select v_arrayElimArr_72 .cse20))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_72) |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ .cse19 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (- 1)) .cse2) (= (select .cse0 .cse20) 1) (= (+ .cse21 1) 0) (= v_arrayElimArr_72 (store .cse0 .cse20 .cse21))))))) .cse17 .cse18)) (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse27 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse22 (+ .cse27 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse24 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse25 (+ .cse27 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse26 (select .cse24 .cse25)) (.cse23 (select .cse2 .cse22))) (and (= .cse2 (store v_DerPreprocessor_14 .cse22 .cse23)) (= .cse24 (store .cse0 .cse25 .cse26)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse26 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse22) 1) (= (select .cse0 .cse25) 1) (= (+ .cse23 1) 0)))))))) is different from false [2022-11-16 08:13:46,105 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse17 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse18 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (exists ((|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse1 (* 4 |ULTIMATE.start_main_~index~0#1|))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) 1) (= (+ (select .cse2 (+ .cse1 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 1) 0)))) (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse8 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse7 (+ .cse8 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse4 (+ .cse8 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_40) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse5 (select .cse0 .cse4)) (.cse6 (select .cse2 .cse7))) (and (= (+ (select .cse3 .cse4) 1) 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store .cse3 .cse4 .cse5) .cse0) (= .cse5 1) (= (+ .cse6 1) 0) (<= (select v_DerPreprocessor_41 .cse7) 1) (= .cse2 (store v_DerPreprocessor_41 .cse7 .cse6))))))) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse10 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse9 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse9 0) (= (+ (select .cse2 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse10)) 1) 0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse10)) 1) (<= 0 .cse9)))) (not (<= c_~ARR_SIZE~0 0)) (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0) (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse16 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse11 (+ .cse16 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse13 (+ .cse16 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse14 (select .cse0 .cse13)) (.cse15 (select .cse2 .cse11)) (.cse12 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_32 .cse11) 1) (= (store .cse12 .cse13 .cse14) .cse0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= .cse2 (store v_DerPreprocessor_32 .cse11 .cse15)) (= .cse14 1) (= (+ .cse15 1) 0) (= 0 (+ (select .cse12 .cse13) 1))))))) .cse17 .cse18 (not (and (exists ((v_DerPreprocessor_34 (Array Int Int)) (v_arrayElimArr_72 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse19 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse20 (+ .cse19 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse21 (select v_arrayElimArr_72 .cse20))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_72) |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ .cse19 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (- 1)) .cse2) (= (select .cse0 .cse20) 1) (= (+ .cse21 1) 0) (= v_arrayElimArr_72 (store .cse0 .cse20 .cse21))))))) .cse17 .cse18)) (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse27 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse22 (+ .cse27 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse24 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse25 (+ .cse27 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse26 (select .cse24 .cse25)) (.cse23 (select .cse2 .cse22))) (and (= .cse2 (store v_DerPreprocessor_14 .cse22 .cse23)) (= .cse24 (store .cse0 .cse25 .cse26)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse26 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse22) 1) (= (select .cse0 .cse25) 1) (= (+ .cse23 1) 0))))))))) is different from true [2022-11-16 08:13:46,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:46,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 46 states and 169 transitions. [2022-11-16 08:13:46,373 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 169 transitions. [2022-11-16 08:13:46,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:46,373 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:46,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:46,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-16 08:13:46,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:46,449 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:46,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:13:46,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:46,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:13:46,579 INFO L350 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 12 treesize of output 11 [2022-11-16 08:13:46,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:13:46,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:46,650 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:13:46,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:13:46,655 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:46,689 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse9 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse10 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (not (and (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse7 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse5 (+ .cse7 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse1 (+ .cse7 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_40) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse2 (select .cse3 .cse1)) (.cse4 (select .cse6 .cse5))) (and (= (+ (select .cse0 .cse1) 1) 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store .cse0 .cse1 .cse2) .cse3) (= .cse2 1) (= (+ .cse4 1) 0) (<= (select v_DerPreprocessor_41 .cse5) 1) (= .cse6 (store v_DerPreprocessor_41 .cse5 .cse4))))))) .cse8 .cse9 .cse10)) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse12 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse11 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse11 0) (= (+ (select .cse6 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse12)) 1) 0) (= (select .cse3 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse12)) 1) (<= 0 .cse11)))) (not (<= c_~ARR_SIZE~0 0)) .cse8 (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse18 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse13 (+ .cse18 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse15 (+ .cse18 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse16 (select .cse3 .cse15)) (.cse17 (select .cse6 .cse13)) (.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_32 .cse13) 1) (= (store .cse14 .cse15 .cse16) .cse3) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= .cse6 (store v_DerPreprocessor_32 .cse13 .cse17)) (= .cse16 1) (= (+ .cse17 1) 0) (= 0 (+ (select .cse14 .cse15) 1))))))) .cse9 .cse10 (not (and (exists ((v_DerPreprocessor_34 (Array Int Int)) (v_arrayElimArr_72 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse19 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse20 (+ .cse19 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse21 (select v_arrayElimArr_72 .cse20))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_72) |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ .cse19 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (- 1)) .cse6) (= (select .cse3 .cse20) 1) (= (+ .cse21 1) 0) (= v_arrayElimArr_72 (store .cse3 .cse20 .cse21))))))) .cse9 .cse10)) (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse27 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse22 (+ .cse27 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse24 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse25 (+ .cse27 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse26 (select .cse24 .cse25)) (.cse23 (select .cse6 .cse22))) (and (= .cse6 (store v_DerPreprocessor_14 .cse22 .cse23)) (= .cse24 (store .cse3 .cse25 .cse26)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse26 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse22) 1) (= (select .cse3 .cse25) 1) (= (+ .cse23 1) 0)))))))) is different from false [2022-11-16 08:13:46,709 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse8 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse9 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse10 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (not (and (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse7 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse5 (+ .cse7 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse1 (+ .cse7 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_40) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse2 (select .cse3 .cse1)) (.cse4 (select .cse6 .cse5))) (and (= (+ (select .cse0 .cse1) 1) 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store .cse0 .cse1 .cse2) .cse3) (= .cse2 1) (= (+ .cse4 1) 0) (<= (select v_DerPreprocessor_41 .cse5) 1) (= .cse6 (store v_DerPreprocessor_41 .cse5 .cse4))))))) .cse8 .cse9 .cse10)) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse12 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse11 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse11 0) (= (+ (select .cse6 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse12)) 1) 0) (= (select .cse3 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse12)) 1) (<= 0 .cse11)))) (not (<= c_~ARR_SIZE~0 0)) .cse8 (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse18 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse13 (+ .cse18 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse15 (+ .cse18 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse16 (select .cse3 .cse15)) (.cse17 (select .cse6 .cse13)) (.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_32 .cse13) 1) (= (store .cse14 .cse15 .cse16) .cse3) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= .cse6 (store v_DerPreprocessor_32 .cse13 .cse17)) (= .cse16 1) (= (+ .cse17 1) 0) (= 0 (+ (select .cse14 .cse15) 1))))))) .cse9 .cse10 (not (and (exists ((v_DerPreprocessor_34 (Array Int Int)) (v_arrayElimArr_72 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse19 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse20 (+ .cse19 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse21 (select v_arrayElimArr_72 .cse20))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_72) |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ .cse19 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (- 1)) .cse6) (= (select .cse3 .cse20) 1) (= (+ .cse21 1) 0) (= v_arrayElimArr_72 (store .cse3 .cse20 .cse21))))))) .cse9 .cse10)) (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse27 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse22 (+ .cse27 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse24 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse25 (+ .cse27 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse26 (select .cse24 .cse25)) (.cse23 (select .cse6 .cse22))) (and (= .cse6 (store v_DerPreprocessor_14 .cse22 .cse23)) (= .cse24 (store .cse3 .cse25 .cse26)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse26 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse22) 1) (= (select .cse3 .cse25) 1) (= (+ .cse23 1) 0))))))))) is different from true [2022-11-16 08:13:46,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:46,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 46 states and 169 transitions. [2022-11-16 08:13:46,738 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 169 transitions. [2022-11-16 08:13:46,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:46,738 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:46,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:46,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:46,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-16 08:13:46,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:46,820 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:46,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:46,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:13:46,960 INFO L350 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 12 treesize of output 11 [2022-11-16 08:13:46,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:13:46,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:13:47,037 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:13:47,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 38 treesize of output 20 [2022-11-16 08:13:47,043 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:47,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:47,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 45 states and 162 transitions. [2022-11-16 08:13:47,111 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 162 transitions. [2022-11-16 08:13:47,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:47,112 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:47,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:47,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:47,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-16 08:13:47,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:47,186 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:47,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:13:47,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:47,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:13:47,322 INFO L350 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 12 treesize of output 11 [2022-11-16 08:13:47,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:13:47,384 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:47,399 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:13:47,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:13:47,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:47,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:47,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 45 states and 162 transitions. [2022-11-16 08:13:47,484 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 162 transitions. [2022-11-16 08:13:47,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:47,485 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:47,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:47,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:47,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-16 08:13:47,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:47,556 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:47,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:13:47,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:47,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:13:47,700 INFO L350 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 12 treesize of output 11 [2022-11-16 08:13:47,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:13:47,764 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:47,778 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:13:47,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:13:47,783 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:47,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:47,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 45 states and 162 transitions. [2022-11-16 08:13:47,843 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 162 transitions. [2022-11-16 08:13:47,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:47,843 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:47,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:47,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:47,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-16 08:13:47,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:47,935 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:48,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:48,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:13:48,086 INFO L350 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 12 treesize of output 11 [2022-11-16 08:13:48,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:13:48,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:13:48,147 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:48,162 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:13:48,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:13:48,167 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:48,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:48,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 45 states and 162 transitions. [2022-11-16 08:13:48,227 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 162 transitions. [2022-11-16 08:13:48,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:48,228 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:48,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:48,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:48,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-16 08:13:48,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:48,294 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:48,369 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:48,371 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:13:48,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:48,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:13:48,380 INFO L350 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 12 treesize of output 11 [2022-11-16 08:13:48,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:13:48,457 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:13:48,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 38 treesize of output 20 [2022-11-16 08:13:48,463 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:48,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:48,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 45 states and 162 transitions. [2022-11-16 08:13:48,547 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 162 transitions. [2022-11-16 08:13:48,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:48,548 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:48,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:48,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:13:48,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:48,629 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:48,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:13:48,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:48,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:13:48,754 INFO L350 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 12 treesize of output 11 [2022-11-16 08:13:48,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:13:48,810 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:48,838 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:13:48,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:13:48,843 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:48,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:48,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 45 states and 162 transitions. [2022-11-16 08:13:48,931 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 162 transitions. [2022-11-16 08:13:48,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:48,931 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:48,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:48,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:48,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-16 08:13:48,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:49,017 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:49,097 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:49,099 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:13:49,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:49,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:13:49,110 INFO L350 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 12 treesize of output 11 [2022-11-16 08:13:49,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:13:49,179 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:13:49,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 38 treesize of output 20 [2022-11-16 08:13:49,184 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:49,221 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse32 (select .cse2 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse33 (select .cse5 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse0 (and (= .cse32 1) (= (+ .cse33 1) 0))) (.cse1 (= .cse33 0)) (.cse9 (= .cse32 0)) (.cse13 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse11 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse12 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse14 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (or .cse0 (and .cse1 (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_28 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_29 (Array Int Int))) (let ((.cse7 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse8 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse4 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse7 .cse8)) (.cse6 (+ .cse7 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse2 .cse3) 1) 0) (= 0 (select .cse4 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse4 .cse3) 1) (= (select .cse5 .cse6) 1) (= (+ (select v_DerPreprocessor_29 .cse6) 1) 0) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)) (= (select v_DerPreprocessor_29 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0))))) .cse9) (and .cse1 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse10 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (= (+ (select .cse5 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse10)) 1) 0) (= (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse10)) 1)))) .cse9)) .cse11 (not (and .cse12 .cse13 .cse14 (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse20 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse15 (+ .cse20 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse17 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse18 (+ .cse20 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse19 (select .cse17 .cse18)) (.cse16 (select .cse5 .cse15))) (and (= .cse5 (store v_DerPreprocessor_14 .cse15 .cse16)) (= .cse17 (store .cse2 .cse18 .cse19)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse19 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse15) 1) (= (select .cse2 .cse18) 1) (= (+ .cse16 1) 0)))))))) (or .cse0 (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse21 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse22 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse21 .cse22)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse5 (+ .cse21 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse22)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse1 .cse9) (and .cse1 .cse9 (exists ((v_DerPreprocessor_19 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse26 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse24 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse26)) (.cse23 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse25 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse26))) (and (= (select .cse23 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse5 .cse24) 1) 0) (= (select v_DerPreprocessor_19 .cse24) 1) (= (select .cse2 .cse25) 1) (= (+ (select .cse23 .cse25) 1) 0) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0))))))) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse28 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse27 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse27 0) (= (+ (select .cse5 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse28)) 1) 0) (= (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse28)) 1) (<= 0 .cse27)))) (not (<= c_~ARR_SIZE~0 0)) .cse12 .cse13 (not (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse31 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse29 (+ .cse31 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse30 (+ .cse31 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (select v_DerPreprocessor_6 .cse29) 1) (= (select .cse2 .cse30) 1) (= (+ (select .cse5 .cse29) 1) 0) (= (+ 1 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base|) .cse30)) 0))))) .cse11 .cse12 .cse14)) .cse14)))) is different from false [2022-11-16 08:13:49,245 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse32 (select .cse2 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse33 (select .cse5 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse0 (and (= .cse32 1) (= (+ .cse33 1) 0))) (.cse1 (= .cse33 0)) (.cse9 (= .cse32 0)) (.cse13 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse11 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse12 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse14 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (or .cse0 (and .cse1 (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_28 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_29 (Array Int Int))) (let ((.cse7 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse8 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse4 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse7 .cse8)) (.cse6 (+ .cse7 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse2 .cse3) 1) 0) (= 0 (select .cse4 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse4 .cse3) 1) (= (select .cse5 .cse6) 1) (= (+ (select v_DerPreprocessor_29 .cse6) 1) 0) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)) (= (select v_DerPreprocessor_29 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0))))) .cse9) (and .cse1 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse10 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (= (+ (select .cse5 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse10)) 1) 0) (= (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse10)) 1)))) .cse9)) .cse11 (not (and .cse12 .cse13 .cse14 (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse20 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse15 (+ .cse20 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse17 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse18 (+ .cse20 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse19 (select .cse17 .cse18)) (.cse16 (select .cse5 .cse15))) (and (= .cse5 (store v_DerPreprocessor_14 .cse15 .cse16)) (= .cse17 (store .cse2 .cse18 .cse19)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse19 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse15) 1) (= (select .cse2 .cse18) 1) (= (+ .cse16 1) 0)))))))) (or .cse0 (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse21 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse22 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse21 .cse22)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse5 (+ .cse21 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse22)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse1 .cse9) (and .cse1 .cse9 (exists ((v_DerPreprocessor_19 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse26 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse24 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse26)) (.cse23 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse25 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse26))) (and (= (select .cse23 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse5 .cse24) 1) 0) (= (select v_DerPreprocessor_19 .cse24) 1) (= (select .cse2 .cse25) 1) (= (+ (select .cse23 .cse25) 1) 0) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0))))))) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse28 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse27 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse27 0) (= (+ (select .cse5 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse28)) 1) 0) (= (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse28)) 1) (<= 0 .cse27)))) (not (<= c_~ARR_SIZE~0 0)) .cse12 .cse13 (not (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse31 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse29 (+ .cse31 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse30 (+ .cse31 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (select v_DerPreprocessor_6 .cse29) 1) (= (select .cse2 .cse30) 1) (= (+ (select .cse5 .cse29) 1) 0) (= (+ 1 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base|) .cse30)) 0))))) .cse11 .cse12 .cse14)) .cse14))))) is different from true [2022-11-16 08:13:49,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:49,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 45 states and 162 transitions. [2022-11-16 08:13:49,305 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 162 transitions. [2022-11-16 08:13:49,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:49,306 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:49,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:49,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:49,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-16 08:13:49,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:49,390 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:49,479 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:49,481 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:13:49,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:49,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:13:49,491 INFO L350 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 12 treesize of output 11 [2022-11-16 08:13:49,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:13:49,565 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:13:49,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 38 treesize of output 20 [2022-11-16 08:13:49,570 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:49,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:49,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 45 states and 162 transitions. [2022-11-16 08:13:49,640 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 162 transitions. [2022-11-16 08:13:49,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:49,640 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:49,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:49,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:49,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-16 08:13:49,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:49,723 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:50,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:50,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 83 [2022-11-16 08:13:50,214 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:13:50,215 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 74 [2022-11-16 08:13:50,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 106 [2022-11-16 08:13:50,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:50,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 95 [2022-11-16 08:13:50,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:50,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 25 treesize of output 47 [2022-11-16 08:13:50,242 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:13:50,262 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-11-16 08:13:50,265 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:13:50,266 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 92 [2022-11-16 08:13:50,974 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 08:13:50,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 110 [2022-11-16 08:13:50,982 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:50,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 61 [2022-11-16 08:13:50,996 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:50,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 11 [2022-11-16 08:13:51,010 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:51,493 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse20 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse21 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse4 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse0 (+ .cse4 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse2 (+ .cse4 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (select v_DerPreprocessor_6 .cse0) 1) (= (select .cse1 .cse2) 1) (= (+ (select .cse3 .cse0) 1) 0) (= (+ 1 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base|) .cse2)) 0))))) (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (exists ((|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse5 (* 4 |ULTIMATE.start_main_~index~0#1|))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (select .cse1 (+ .cse5 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) 1) (= (+ (select .cse3 (+ .cse5 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 1) 0)))) (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse11 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse10 (+ .cse11 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse7 (+ .cse11 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_40) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse8 (select .cse1 .cse7)) (.cse9 (select .cse3 .cse10))) (and (= (+ (select .cse6 .cse7) 1) 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store .cse6 .cse7 .cse8) .cse1) (= .cse8 1) (= (+ .cse9 1) 0) (<= (select v_DerPreprocessor_41 .cse10) 1) (= .cse3 (store v_DerPreprocessor_41 .cse10 .cse9))))))) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse13 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse12 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse12 0) (= (+ (select .cse3 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse13)) 1) 0) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse13)) 1) (<= 0 .cse12)))) (not (<= c_~ARR_SIZE~0 0)) (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0) (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse19 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse14 (+ .cse19 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse16 (+ .cse19 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse17 (select .cse1 .cse16)) (.cse18 (select .cse3 .cse14)) (.cse15 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_32 .cse14) 1) (= (store .cse15 .cse16 .cse17) .cse1) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= .cse3 (store v_DerPreprocessor_32 .cse14 .cse18)) (= .cse17 1) (= (+ .cse18 1) 0) (= 0 (+ (select .cse15 .cse16) 1))))))) .cse20 .cse21 (exists ((|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse27 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse24 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse22 (+ .cse27 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse26 (+ .cse27 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse25 (select v_DerPreprocessor_47 .cse26)) (.cse23 (select .cse24 .cse22))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (store .cse1 .cse22 .cse23) .cse24) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= 1 .cse25) (= (store .cse3 .cse26 .cse25) v_DerPreprocessor_47) (= (select .cse1 .cse22) 1) (= (+ 1 .cse23) 0) (= (+ (select .cse3 .cse26) 1) 0)))))) (not (and (exists ((v_DerPreprocessor_34 (Array Int Int)) (v_arrayElimArr_72 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse28 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse29 (+ .cse28 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse30 (select v_arrayElimArr_72 .cse29))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_72) |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ .cse28 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (- 1)) .cse3) (= (select .cse1 .cse29) 1) (= (+ .cse30 1) 0) (= v_arrayElimArr_72 (store .cse1 .cse29 .cse30))))))) .cse20 .cse21)) (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse36 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse31 (+ .cse36 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse33 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse34 (+ .cse36 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse35 (select .cse33 .cse34)) (.cse32 (select .cse3 .cse31))) (and (= .cse3 (store v_DerPreprocessor_14 .cse31 .cse32)) (= .cse33 (store .cse1 .cse34 .cse35)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse35 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse31) 1) (= (select .cse1 .cse34) 1) (= (+ .cse32 1) 0)))))))) is different from false [2022-11-16 08:13:51,813 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse20 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse21 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse4 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse0 (+ .cse4 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse2 (+ .cse4 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (select v_DerPreprocessor_6 .cse0) 1) (= (select .cse1 .cse2) 1) (= (+ (select .cse3 .cse0) 1) 0) (= (+ 1 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base|) .cse2)) 0))))) (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (exists ((|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse5 (* 4 |ULTIMATE.start_main_~index~0#1|))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (select .cse1 (+ .cse5 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) 1) (= (+ (select .cse3 (+ .cse5 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 1) 0)))) (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse11 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse10 (+ .cse11 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse7 (+ .cse11 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_40) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse8 (select .cse1 .cse7)) (.cse9 (select .cse3 .cse10))) (and (= (+ (select .cse6 .cse7) 1) 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store .cse6 .cse7 .cse8) .cse1) (= .cse8 1) (= (+ .cse9 1) 0) (<= (select v_DerPreprocessor_41 .cse10) 1) (= .cse3 (store v_DerPreprocessor_41 .cse10 .cse9))))))) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse13 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse12 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse12 0) (= (+ (select .cse3 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse13)) 1) 0) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse13)) 1) (<= 0 .cse12)))) (not (<= c_~ARR_SIZE~0 0)) (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0) (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse19 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse14 (+ .cse19 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse16 (+ .cse19 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse17 (select .cse1 .cse16)) (.cse18 (select .cse3 .cse14)) (.cse15 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_32 .cse14) 1) (= (store .cse15 .cse16 .cse17) .cse1) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= .cse3 (store v_DerPreprocessor_32 .cse14 .cse18)) (= .cse17 1) (= (+ .cse18 1) 0) (= 0 (+ (select .cse15 .cse16) 1))))))) .cse20 .cse21 (exists ((|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse27 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse24 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse22 (+ .cse27 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse26 (+ .cse27 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse25 (select v_DerPreprocessor_47 .cse26)) (.cse23 (select .cse24 .cse22))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (store .cse1 .cse22 .cse23) .cse24) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= 1 .cse25) (= (store .cse3 .cse26 .cse25) v_DerPreprocessor_47) (= (select .cse1 .cse22) 1) (= (+ 1 .cse23) 0) (= (+ (select .cse3 .cse26) 1) 0)))))) (not (and (exists ((v_DerPreprocessor_34 (Array Int Int)) (v_arrayElimArr_72 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse28 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse29 (+ .cse28 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse30 (select v_arrayElimArr_72 .cse29))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_72) |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ .cse28 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (- 1)) .cse3) (= (select .cse1 .cse29) 1) (= (+ .cse30 1) 0) (= v_arrayElimArr_72 (store .cse1 .cse29 .cse30))))))) .cse20 .cse21)) (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse36 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse31 (+ .cse36 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse33 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse34 (+ .cse36 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse35 (select .cse33 .cse34)) (.cse32 (select .cse3 .cse31))) (and (= .cse3 (store v_DerPreprocessor_14 .cse31 .cse32)) (= .cse33 (store .cse1 .cse34 .cse35)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse35 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse31) 1) (= (select .cse1 .cse34) 1) (= (+ .cse32 1) 0))))))))) is different from true [2022-11-16 08:13:51,830 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse38 (select .cse2 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse39 (select .cse5 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse0 (and (= .cse38 1) (= (+ .cse39 1) 0))) (.cse1 (= .cse39 0)) (.cse9 (= .cse38 0)) (.cse13 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse11 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse12 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse14 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (or .cse0 (and .cse1 (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_28 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_29 (Array Int Int))) (let ((.cse7 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse8 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse4 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse7 .cse8)) (.cse6 (+ .cse7 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse2 .cse3) 1) 0) (= 0 (select .cse4 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse4 .cse3) 1) (= (select .cse5 .cse6) 1) (= (+ (select v_DerPreprocessor_29 .cse6) 1) 0) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)) (= (select v_DerPreprocessor_29 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0))))) .cse9) (and .cse1 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse10 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (= (+ (select .cse5 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse10)) 1) 0) (= (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse10)) 1)))) .cse9)) .cse11 (not (and .cse12 .cse13 .cse14 (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse20 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse15 (+ .cse20 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse17 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse18 (+ .cse20 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse19 (select .cse17 .cse18)) (.cse16 (select .cse5 .cse15))) (and (= .cse5 (store v_DerPreprocessor_14 .cse15 .cse16)) (= .cse17 (store .cse2 .cse18 .cse19)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse19 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse15) 1) (= (select .cse2 .cse18) 1) (= (+ .cse16 1) 0)))))))) (or .cse0 (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse21 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse22 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse21 .cse22)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse5 (+ .cse21 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse22)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse1 .cse9) (and .cse1 .cse9 (exists ((v_DerPreprocessor_19 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse26 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse24 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse26)) (.cse23 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse25 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse26))) (and (= (select .cse23 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse5 .cse24) 1) 0) (= (select v_DerPreprocessor_19 .cse24) 1) (= (select .cse2 .cse25) 1) (= (+ (select .cse23 .cse25) 1) 0) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0))))))) (not (and .cse13 .cse14 (exists ((|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse32 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse29 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse27 (+ .cse32 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse31 (+ .cse32 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse30 (select v_DerPreprocessor_47 .cse31)) (.cse28 (select .cse29 .cse27))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (store .cse2 .cse27 .cse28) .cse29) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= 1 .cse30) (= (store .cse5 .cse31 .cse30) v_DerPreprocessor_47) (= (select .cse2 .cse27) 1) (= (+ 1 .cse28) 0) (= (+ (select .cse5 .cse31) 1) 0)))))))) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse34 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse33 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse33 0) (= (+ (select .cse5 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse34)) 1) 0) (= (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse34)) 1) (<= 0 .cse33)))) (not (<= c_~ARR_SIZE~0 0)) .cse12 .cse13 (not (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse37 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse35 (+ .cse37 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse36 (+ .cse37 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (select v_DerPreprocessor_6 .cse35) 1) (= (select .cse2 .cse36) 1) (= (+ (select .cse5 .cse35) 1) 0) (= (+ 1 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base|) .cse36)) 0))))) .cse11 .cse12 .cse14)) .cse14)))) is different from false [2022-11-16 08:13:51,847 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse38 (select .cse2 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse39 (select .cse5 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse0 (and (= .cse38 1) (= (+ .cse39 1) 0))) (.cse1 (= .cse39 0)) (.cse9 (= .cse38 0)) (.cse13 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse11 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse12 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse14 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (or .cse0 (and .cse1 (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_28 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_29 (Array Int Int))) (let ((.cse7 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse8 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse4 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse7 .cse8)) (.cse6 (+ .cse7 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse2 .cse3) 1) 0) (= 0 (select .cse4 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse4 .cse3) 1) (= (select .cse5 .cse6) 1) (= (+ (select v_DerPreprocessor_29 .cse6) 1) 0) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)) (= (select v_DerPreprocessor_29 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0))))) .cse9) (and .cse1 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse10 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (= (+ (select .cse5 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse10)) 1) 0) (= (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse10)) 1)))) .cse9)) .cse11 (not (and .cse12 .cse13 .cse14 (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse20 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse15 (+ .cse20 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse17 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse18 (+ .cse20 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse19 (select .cse17 .cse18)) (.cse16 (select .cse5 .cse15))) (and (= .cse5 (store v_DerPreprocessor_14 .cse15 .cse16)) (= .cse17 (store .cse2 .cse18 .cse19)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse19 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse15) 1) (= (select .cse2 .cse18) 1) (= (+ .cse16 1) 0)))))))) (or .cse0 (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse21 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse22 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse21 .cse22)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse5 (+ .cse21 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse22)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse1 .cse9) (and .cse1 .cse9 (exists ((v_DerPreprocessor_19 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse26 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse24 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse26)) (.cse23 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse25 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse26))) (and (= (select .cse23 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse5 .cse24) 1) 0) (= (select v_DerPreprocessor_19 .cse24) 1) (= (select .cse2 .cse25) 1) (= (+ (select .cse23 .cse25) 1) 0) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0))))))) (not (and .cse13 .cse14 (exists ((|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse32 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse29 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse27 (+ .cse32 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse31 (+ .cse32 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse30 (select v_DerPreprocessor_47 .cse31)) (.cse28 (select .cse29 .cse27))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (store .cse2 .cse27 .cse28) .cse29) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= 1 .cse30) (= (store .cse5 .cse31 .cse30) v_DerPreprocessor_47) (= (select .cse2 .cse27) 1) (= (+ 1 .cse28) 0) (= (+ (select .cse5 .cse31) 1) 0)))))))) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse34 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse33 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse33 0) (= (+ (select .cse5 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse34)) 1) 0) (= (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse34)) 1) (<= 0 .cse33)))) (not (<= c_~ARR_SIZE~0 0)) .cse12 .cse13 (not (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse37 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse35 (+ .cse37 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse36 (+ .cse37 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (select v_DerPreprocessor_6 .cse35) 1) (= (select .cse2 .cse36) 1) (= (+ (select .cse5 .cse35) 1) 0) (= (+ 1 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base|) .cse36)) 0))))) .cse11 .cse12 .cse14)) .cse14))))) is different from true [2022-11-16 08:13:52,331 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~count~0#1| 0)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse1 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse2 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (not (<= c_~ARR_SIZE~0 0)) (not (and .cse0 .cse1 .cse2 (exists ((|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse10 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse4 (+ .cse10 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse9 (+ .cse10 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse7 (select v_DerPreprocessor_47 .cse9)) (.cse5 (select .cse6 .cse4))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (store .cse3 .cse4 .cse5) .cse6) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= 1 .cse7) (= (store .cse8 .cse9 .cse7) v_DerPreprocessor_47) (= (select .cse3 .cse4) 1) (= (+ 1 .cse5) 0) (= (+ (select .cse8 .cse9) 1) 0)))))))) (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0) (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse16 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse11 (+ .cse16 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse13 (+ .cse16 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse14 (select .cse3 .cse13)) (.cse15 (select .cse8 .cse11)) (.cse12 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_32 .cse11) 1) (= (store .cse12 .cse13 .cse14) .cse3) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= .cse8 (store v_DerPreprocessor_32 .cse11 .cse15)) (= .cse14 1) (= (+ .cse15 1) 0) (= 0 (+ (select .cse12 .cse13) 1))))))) .cse1 .cse2)) is different from false [2022-11-16 08:13:52,723 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse0 (= |c_ULTIMATE.start_main_~count~0#1| 0)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse1 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse2 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (not (<= c_~ARR_SIZE~0 0)) (not (and .cse0 .cse1 .cse2 (exists ((|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse10 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse4 (+ .cse10 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse9 (+ .cse10 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse7 (select v_DerPreprocessor_47 .cse9)) (.cse5 (select .cse6 .cse4))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (store .cse3 .cse4 .cse5) .cse6) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= 1 .cse7) (= (store .cse8 .cse9 .cse7) v_DerPreprocessor_47) (= (select .cse3 .cse4) 1) (= (+ 1 .cse5) 0) (= (+ (select .cse8 .cse9) 1) 0)))))))) (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0) (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse16 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse11 (+ .cse16 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse13 (+ .cse16 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse14 (select .cse3 .cse13)) (.cse15 (select .cse8 .cse11)) (.cse12 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_32 .cse11) 1) (= (store .cse12 .cse13 .cse14) .cse3) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= .cse8 (store v_DerPreprocessor_32 .cse11 .cse15)) (= .cse14 1) (= (+ .cse15 1) 0) (= 0 (+ (select .cse12 .cse13) 1))))))) .cse1 .cse2))) is different from true [2022-11-16 08:13:52,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:52,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 46 states and 182 transitions. [2022-11-16 08:13:52,737 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 182 transitions. [2022-11-16 08:13:52,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:52,738 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:52,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:52,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:52,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-16 08:13:52,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:52,811 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:52,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:52,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-16 08:13:52,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 20 [2022-11-16 08:13:52,839 INFO L350 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 [2022-11-16 08:13:52,845 INFO L350 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 [2022-11-16 08:13:53,124 INFO L321 Elim1Store]: treesize reduction 60, result has 46.9 percent of original size [2022-11-16 08:13:53,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 107 treesize of output 150 [2022-11-16 08:13:53,162 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:13:53,166 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 88 [2022-11-16 08:13:53,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:53,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 31 [2022-11-16 08:13:53,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:53,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 9 [2022-11-16 08:13:53,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:53,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 7 [2022-11-16 08:13:53,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:53,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2022-11-16 08:13:53,460 INFO L350 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 [2022-11-16 08:13:53,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 08:13:54,595 INFO L321 Elim1Store]: treesize reduction 124, result has 40.7 percent of original size [2022-11-16 08:13:54,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 190 treesize of output 210 [2022-11-16 08:13:54,610 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:13:54,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 125 [2022-11-16 08:13:54,634 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:13:54,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 105 [2022-11-16 08:13:55,105 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:55,134 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse30 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse31 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse4 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse0 (+ .cse4 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse2 (+ .cse4 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (select v_DerPreprocessor_6 .cse0) 1) (= (select .cse1 .cse2) 1) (= (+ (select .cse3 .cse0) 1) 0) (= (+ 1 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base|) .cse2)) 0))))) (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (exists ((|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse5 (* 4 |ULTIMATE.start_main_~index~0#1|))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (select .cse1 (+ .cse5 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) 1) (= (+ (select .cse3 (+ .cse5 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 1) 0)))) (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse11 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse10 (+ .cse11 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse7 (+ .cse11 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_40) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse8 (select .cse1 .cse7)) (.cse9 (select .cse3 .cse10))) (and (= (+ (select .cse6 .cse7) 1) 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store .cse6 .cse7 .cse8) .cse1) (= .cse8 1) (= (+ .cse9 1) 0) (<= (select v_DerPreprocessor_41 .cse10) 1) (= .cse3 (store v_DerPreprocessor_41 .cse10 .cse9))))))) (let ((.cse12 (select .cse1 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse13 (select .cse3 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse14 (= .cse13 0)) (.cse15 (= .cse12 0))) (or (and (= .cse12 1) (= (+ .cse13 1) 0)) (and .cse14 .cse15 (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse19 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse20 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse17 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse16 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse19 .cse20)) (.cse18 (+ .cse19 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse20))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse1 .cse16) 1) 0) (= (select .cse17 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select v_DerPreprocessor_49 .cse18) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse17 .cse16) 1) (= (select .cse3 .cse18) 1) (= (select v_DerPreprocessor_49 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))))) (and .cse14 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse21 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (= (+ (select .cse3 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse21)) 1) 0) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse21)) 1)))) .cse15)))) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse23 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse22 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse22 0) (= (+ (select .cse3 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse23)) 1) 0) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse23)) 1) (<= 0 .cse22)))) (not (<= c_~ARR_SIZE~0 0)) (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0) (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse29 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse24 (+ .cse29 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse26 (+ .cse29 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse27 (select .cse1 .cse26)) (.cse28 (select .cse3 .cse24)) (.cse25 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_32 .cse24) 1) (= (store .cse25 .cse26 .cse27) .cse1) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= .cse3 (store v_DerPreprocessor_32 .cse24 .cse28)) (= .cse27 1) (= (+ .cse28 1) 0) (= 0 (+ (select .cse25 .cse26) 1))))))) .cse30 .cse31 (exists ((|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse37 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse34 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse32 (+ .cse37 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse36 (+ .cse37 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse35 (select v_DerPreprocessor_47 .cse36)) (.cse33 (select .cse34 .cse32))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (store .cse1 .cse32 .cse33) .cse34) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= 1 .cse35) (= (store .cse3 .cse36 .cse35) v_DerPreprocessor_47) (= (select .cse1 .cse32) 1) (= (+ 1 .cse33) 0) (= (+ (select .cse3 .cse36) 1) 0)))))) (not (and (exists ((v_DerPreprocessor_34 (Array Int Int)) (v_arrayElimArr_72 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse38 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse39 (+ .cse38 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse40 (select v_arrayElimArr_72 .cse39))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_72) |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ .cse38 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (- 1)) .cse3) (= (select .cse1 .cse39) 1) (= (+ .cse40 1) 0) (= v_arrayElimArr_72 (store .cse1 .cse39 .cse40))))))) .cse30 .cse31)) (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse46 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse41 (+ .cse46 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse43 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse44 (+ .cse46 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse45 (select .cse43 .cse44)) (.cse42 (select .cse3 .cse41))) (and (= .cse3 (store v_DerPreprocessor_14 .cse41 .cse42)) (= .cse43 (store .cse1 .cse44 .cse45)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse45 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse41) 1) (= (select .cse1 .cse44) 1) (= (+ .cse42 1) 0)))))))) is different from false [2022-11-16 08:13:55,568 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse30 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse31 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse4 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse0 (+ .cse4 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse2 (+ .cse4 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (select v_DerPreprocessor_6 .cse0) 1) (= (select .cse1 .cse2) 1) (= (+ (select .cse3 .cse0) 1) 0) (= (+ 1 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base|) .cse2)) 0))))) (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (exists ((|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse5 (* 4 |ULTIMATE.start_main_~index~0#1|))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (select .cse1 (+ .cse5 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) 1) (= (+ (select .cse3 (+ .cse5 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 1) 0)))) (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse11 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse10 (+ .cse11 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse7 (+ .cse11 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_40) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse8 (select .cse1 .cse7)) (.cse9 (select .cse3 .cse10))) (and (= (+ (select .cse6 .cse7) 1) 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store .cse6 .cse7 .cse8) .cse1) (= .cse8 1) (= (+ .cse9 1) 0) (<= (select v_DerPreprocessor_41 .cse10) 1) (= .cse3 (store v_DerPreprocessor_41 .cse10 .cse9))))))) (let ((.cse12 (select .cse1 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse13 (select .cse3 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse14 (= .cse13 0)) (.cse15 (= .cse12 0))) (or (and (= .cse12 1) (= (+ .cse13 1) 0)) (and .cse14 .cse15 (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse19 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse20 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse17 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse16 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse19 .cse20)) (.cse18 (+ .cse19 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse20))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse1 .cse16) 1) 0) (= (select .cse17 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select v_DerPreprocessor_49 .cse18) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse17 .cse16) 1) (= (select .cse3 .cse18) 1) (= (select v_DerPreprocessor_49 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))))) (and .cse14 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse21 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (= (+ (select .cse3 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse21)) 1) 0) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse21)) 1)))) .cse15)))) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse23 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse22 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse22 0) (= (+ (select .cse3 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse23)) 1) 0) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse23)) 1) (<= 0 .cse22)))) (not (<= c_~ARR_SIZE~0 0)) (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0) (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse29 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse24 (+ .cse29 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse26 (+ .cse29 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse27 (select .cse1 .cse26)) (.cse28 (select .cse3 .cse24)) (.cse25 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_32 .cse24) 1) (= (store .cse25 .cse26 .cse27) .cse1) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= .cse3 (store v_DerPreprocessor_32 .cse24 .cse28)) (= .cse27 1) (= (+ .cse28 1) 0) (= 0 (+ (select .cse25 .cse26) 1))))))) .cse30 .cse31 (exists ((|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse37 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse34 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse32 (+ .cse37 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse36 (+ .cse37 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse35 (select v_DerPreprocessor_47 .cse36)) (.cse33 (select .cse34 .cse32))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (store .cse1 .cse32 .cse33) .cse34) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= 1 .cse35) (= (store .cse3 .cse36 .cse35) v_DerPreprocessor_47) (= (select .cse1 .cse32) 1) (= (+ 1 .cse33) 0) (= (+ (select .cse3 .cse36) 1) 0)))))) (not (and (exists ((v_DerPreprocessor_34 (Array Int Int)) (v_arrayElimArr_72 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse38 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse39 (+ .cse38 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse40 (select v_arrayElimArr_72 .cse39))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_72) |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ .cse38 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (- 1)) .cse3) (= (select .cse1 .cse39) 1) (= (+ .cse40 1) 0) (= v_arrayElimArr_72 (store .cse1 .cse39 .cse40))))))) .cse30 .cse31)) (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse46 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse41 (+ .cse46 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse43 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse44 (+ .cse46 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse45 (select .cse43 .cse44)) (.cse42 (select .cse3 .cse41))) (and (= .cse3 (store v_DerPreprocessor_14 .cse41 .cse42)) (= .cse43 (store .cse1 .cse44 .cse45)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse45 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse41) 1) (= (select .cse1 .cse44) 1) (= (+ .cse42 1) 0))))))))) is different from true [2022-11-16 08:13:55,582 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse44 (select .cse2 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse45 (select .cse5 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse1 (= .cse45 0)) (.cse9 (= .cse44 0))) (let ((.cse0 (and (= .cse44 1) (= (+ .cse45 1) 0))) (.cse10 (and .cse1 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse43 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (= (+ (select .cse5 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse43)) 1) 0) (= (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse43)) 1)))) .cse9)) (.cse13 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse11 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse12 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse14 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (or .cse0 (and .cse1 (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_28 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_29 (Array Int Int))) (let ((.cse7 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse8 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse4 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse7 .cse8)) (.cse6 (+ .cse7 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse2 .cse3) 1) 0) (= 0 (select .cse4 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse4 .cse3) 1) (= (select .cse5 .cse6) 1) (= (+ (select v_DerPreprocessor_29 .cse6) 1) 0) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)) (= (select v_DerPreprocessor_29 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0))))) .cse9) .cse10) .cse11 (not (and .cse12 .cse13 .cse14 (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse20 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse15 (+ .cse20 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse17 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse18 (+ .cse20 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse19 (select .cse17 .cse18)) (.cse16 (select .cse5 .cse15))) (and (= .cse5 (store v_DerPreprocessor_14 .cse15 .cse16)) (= .cse17 (store .cse2 .cse18 .cse19)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse19 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse15) 1) (= (select .cse2 .cse18) 1) (= (+ .cse16 1) 0)))))))) (or .cse0 (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse21 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse22 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse21 .cse22)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse5 (+ .cse21 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse22)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse1 .cse9) (and .cse1 .cse9 (exists ((v_DerPreprocessor_19 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse26 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse24 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse26)) (.cse23 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse25 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse26))) (and (= (select .cse23 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse5 .cse24) 1) 0) (= (select v_DerPreprocessor_19 .cse24) 1) (= (select .cse2 .cse25) 1) (= (+ (select .cse23 .cse25) 1) 0) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0))))))) (not (and .cse13 .cse14 (exists ((|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse32 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse29 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse27 (+ .cse32 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse31 (+ .cse32 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse30 (select v_DerPreprocessor_47 .cse31)) (.cse28 (select .cse29 .cse27))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (store .cse2 .cse27 .cse28) .cse29) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= 1 .cse30) (= (store .cse5 .cse31 .cse30) v_DerPreprocessor_47) (= (select .cse2 .cse27) 1) (= (+ 1 .cse28) 0) (= (+ (select .cse5 .cse31) 1) 0)))))))) (or .cse0 (and .cse1 .cse9 (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse36 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse37 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse34 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse33 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse36 .cse37)) (.cse35 (+ .cse36 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse37))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse2 .cse33) 1) 0) (= (select .cse34 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select v_DerPreprocessor_49 .cse35) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse34 .cse33) 1) (= (select .cse5 .cse35) 1) (= (select v_DerPreprocessor_49 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))))) .cse10) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse39 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse38 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse38 0) (= (+ (select .cse5 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse39)) 1) 0) (= (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse39)) 1) (<= 0 .cse38)))) (not (<= c_~ARR_SIZE~0 0)) .cse12 .cse13 (not (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse42 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse40 (+ .cse42 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse41 (+ .cse42 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (select v_DerPreprocessor_6 .cse40) 1) (= (select .cse2 .cse41) 1) (= (+ (select .cse5 .cse40) 1) 0) (= (+ 1 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base|) .cse41)) 0))))) .cse11 .cse12 .cse14)) .cse14))))) is different from false [2022-11-16 08:13:55,609 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse44 (select .cse2 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse45 (select .cse5 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse1 (= .cse45 0)) (.cse9 (= .cse44 0))) (let ((.cse0 (and (= .cse44 1) (= (+ .cse45 1) 0))) (.cse10 (and .cse1 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse43 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (= (+ (select .cse5 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse43)) 1) 0) (= (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse43)) 1)))) .cse9)) (.cse13 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse11 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse12 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse14 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (or .cse0 (and .cse1 (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_28 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_29 (Array Int Int))) (let ((.cse7 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse8 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse4 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse7 .cse8)) (.cse6 (+ .cse7 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse2 .cse3) 1) 0) (= 0 (select .cse4 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse4 .cse3) 1) (= (select .cse5 .cse6) 1) (= (+ (select v_DerPreprocessor_29 .cse6) 1) 0) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)) (= (select v_DerPreprocessor_29 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0))))) .cse9) .cse10) .cse11 (not (and .cse12 .cse13 .cse14 (exists ((v_DerPreprocessor_15 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse20 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse15 (+ .cse20 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse17 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse18 (+ .cse20 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse19 (select .cse17 .cse18)) (.cse16 (select .cse5 .cse15))) (and (= .cse5 (store v_DerPreprocessor_14 .cse15 .cse16)) (= .cse17 (store .cse2 .cse18 .cse19)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse19 1) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= (select v_DerPreprocessor_14 .cse15) 1) (= (select .cse2 .cse18) 1) (= (+ .cse16 1) 0)))))))) (or .cse0 (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse21 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse22 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse21 .cse22)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse5 (+ .cse21 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse22)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse1 .cse9) (and .cse1 .cse9 (exists ((v_DerPreprocessor_19 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse26 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse24 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse26)) (.cse23 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse25 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse26))) (and (= (select .cse23 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse5 .cse24) 1) 0) (= (select v_DerPreprocessor_19 .cse24) 1) (= (select .cse2 .cse25) 1) (= (+ (select .cse23 .cse25) 1) 0) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0))))))) (not (and .cse13 .cse14 (exists ((|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse32 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse29 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse27 (+ .cse32 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse31 (+ .cse32 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse30 (select v_DerPreprocessor_47 .cse31)) (.cse28 (select .cse29 .cse27))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (store .cse2 .cse27 .cse28) .cse29) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= 1 .cse30) (= (store .cse5 .cse31 .cse30) v_DerPreprocessor_47) (= (select .cse2 .cse27) 1) (= (+ 1 .cse28) 0) (= (+ (select .cse5 .cse31) 1) 0)))))))) (or .cse0 (and .cse1 .cse9 (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse36 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse37 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse34 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse33 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse36 .cse37)) (.cse35 (+ .cse36 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse37))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse2 .cse33) 1) 0) (= (select .cse34 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select v_DerPreprocessor_49 .cse35) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse34 .cse33) 1) (= (select .cse5 .cse35) 1) (= (select v_DerPreprocessor_49 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))))) .cse10) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse39 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse38 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse38 0) (= (+ (select .cse5 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse39)) 1) 0) (= (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse39)) 1) (<= 0 .cse38)))) (not (<= c_~ARR_SIZE~0 0)) .cse12 .cse13 (not (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse42 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse40 (+ .cse42 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse41 (+ .cse42 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (select v_DerPreprocessor_6 .cse40) 1) (= (select .cse2 .cse41) 1) (= (+ (select .cse5 .cse40) 1) 0) (= (+ 1 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base|) .cse41)) 0))))) .cse11 .cse12 .cse14)) .cse14)))))) is different from true [2022-11-16 08:13:55,646 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~count~0#1| 0)) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse13 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse14 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (let ((.cse1 (select .cse5 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse2 (select .cse9 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse3 (= .cse2 0)) (.cse4 (= .cse1 0))) (or (and (= .cse1 1) (= (+ .cse2 1) 0)) (and .cse3 .cse4 (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse10 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse11 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse7 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse6 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse10 .cse11)) (.cse8 (+ .cse10 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse11))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse5 .cse6) 1) 0) (= (select .cse7 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select v_DerPreprocessor_49 .cse8) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse7 .cse6) 1) (= (select .cse9 .cse8) 1) (= (select v_DerPreprocessor_49 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))))) (and .cse3 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse12 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (= (+ (select .cse9 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse12)) 1) 0) (= (select .cse5 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse12)) 1)))) .cse4)))) (not (<= c_~ARR_SIZE~0 0)) (not (and .cse0 .cse13 .cse14 (exists ((|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse20 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse17 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse15 (+ .cse20 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse19 (+ .cse20 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse18 (select v_DerPreprocessor_47 .cse19)) (.cse16 (select .cse17 .cse15))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (store .cse5 .cse15 .cse16) .cse17) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= 1 .cse18) (= (store .cse9 .cse19 .cse18) v_DerPreprocessor_47) (= (select .cse5 .cse15) 1) (= (+ 1 .cse16) 0) (= (+ (select .cse9 .cse19) 1) 0)))))))) (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0) (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse26 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse21 (+ .cse26 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse23 (+ .cse26 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse24 (select .cse5 .cse23)) (.cse25 (select .cse9 .cse21)) (.cse22 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_32 .cse21) 1) (= (store .cse22 .cse23 .cse24) .cse5) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= .cse9 (store v_DerPreprocessor_32 .cse21 .cse25)) (= .cse24 1) (= (+ .cse25 1) 0) (= 0 (+ (select .cse22 .cse23) 1))))))) .cse13 .cse14)) is different from false [2022-11-16 08:13:56,102 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse0 (= |c_ULTIMATE.start_main_~count~0#1| 0)) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse13 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse14 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (let ((.cse1 (select .cse5 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse2 (select .cse9 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse3 (= .cse2 0)) (.cse4 (= .cse1 0))) (or (and (= .cse1 1) (= (+ .cse2 1) 0)) (and .cse3 .cse4 (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse10 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse11 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse7 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse6 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse10 .cse11)) (.cse8 (+ .cse10 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse11))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse5 .cse6) 1) 0) (= (select .cse7 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select v_DerPreprocessor_49 .cse8) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse7 .cse6) 1) (= (select .cse9 .cse8) 1) (= (select v_DerPreprocessor_49 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))))) (and .cse3 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse12 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (= (+ (select .cse9 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse12)) 1) 0) (= (select .cse5 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse12)) 1)))) .cse4)))) (not (<= c_~ARR_SIZE~0 0)) (not (and .cse0 .cse13 .cse14 (exists ((|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse20 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse17 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse15 (+ .cse20 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse19 (+ .cse20 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse18 (select v_DerPreprocessor_47 .cse19)) (.cse16 (select .cse17 .cse15))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (store .cse5 .cse15 .cse16) .cse17) (<= |ULTIMATE.start_main_~index~0#1| 0) (<= 1 .cse18) (= (store .cse9 .cse19 .cse18) v_DerPreprocessor_47) (= (select .cse5 .cse15) 1) (= (+ 1 .cse16) 0) (= (+ (select .cse9 .cse19) 1) 0)))))))) (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0) (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse26 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse21 (+ .cse26 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse23 (+ .cse26 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse24 (select .cse5 .cse23)) (.cse25 (select .cse9 .cse21)) (.cse22 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_32 .cse21) 1) (= (store .cse22 .cse23 .cse24) .cse5) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= .cse9 (store v_DerPreprocessor_32 .cse21 .cse25)) (= .cse24 1) (= (+ .cse25 1) 0) (= 0 (+ (select .cse22 .cse23) 1))))))) .cse13 .cse14))) is different from true [2022-11-16 08:13:56,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:56,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 46 states and 182 transitions. [2022-11-16 08:13:56,115 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 182 transitions. [2022-11-16 08:13:56,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:56,115 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:56,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:56,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:13:56,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:56,198 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:56,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:56,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:13:56,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:13:56,290 INFO L350 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 12 treesize of output 11 [2022-11-16 08:13:56,294 INFO L350 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 12 treesize of output 13 [2022-11-16 08:13:56,305 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:13:56,357 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:13:56,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 38 treesize of output 20 [2022-11-16 08:13:56,362 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:56,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:56,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 45 states and 162 transitions. [2022-11-16 08:13:56,466 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 162 transitions. [2022-11-16 08:13:56,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:56,466 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:56,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:56,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:56,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-16 08:13:56,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:56,540 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:56,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:56,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:13:56,678 INFO L350 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 12 treesize of output 11 [2022-11-16 08:13:56,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:13:56,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:13:56,764 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:56,780 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:13:56,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:13:56,785 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:56,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:56,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 45 states and 162 transitions. [2022-11-16 08:13:56,870 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 162 transitions. [2022-11-16 08:13:56,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:56,871 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:56,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:56,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:56,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 57 conjunts are in the unsatisfiable core [2022-11-16 08:13:56,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:56,948 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:57,084 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:57,086 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:13:57,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:57,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:13:57,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:13:57,099 INFO L350 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 12 treesize of output 11 [2022-11-16 08:13:57,102 INFO L350 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 12 treesize of output 13 [2022-11-16 08:13:57,165 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:13:57,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 38 treesize of output 20 [2022-11-16 08:13:57,182 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:57,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:57,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 45 states and 162 transitions. [2022-11-16 08:13:57,230 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 162 transitions. [2022-11-16 08:13:57,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:57,230 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:57,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:57,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:13:57,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:57,307 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:57,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:57,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:13:57,431 INFO L350 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 12 treesize of output 11 [2022-11-16 08:13:57,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:13:57,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:13:57,502 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:57,516 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:13:57,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:13:57,522 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:57,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:57,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 45 states and 162 transitions. [2022-11-16 08:13:57,572 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 162 transitions. [2022-11-16 08:13:57,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:57,573 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:57,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:57,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:57,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-16 08:13:57,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:57,638 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:57,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:57,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:13:57,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:13:57,722 INFO L350 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 12 treesize of output 11 [2022-11-16 08:13:57,726 INFO L350 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 12 treesize of output 13 [2022-11-16 08:13:57,738 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:57,740 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:13:57,792 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:13:57,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 38 treesize of output 20 [2022-11-16 08:13:57,797 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:57,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:57,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 45 states and 162 transitions. [2022-11-16 08:13:57,846 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 162 transitions. [2022-11-16 08:13:57,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:57,846 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:57,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:57,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:57,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-16 08:13:57,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:57,916 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:58,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:13:58,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:58,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:13:58,057 INFO L350 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 12 treesize of output 11 [2022-11-16 08:13:58,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:13:58,124 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:13:58,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 38 treesize of output 20 [2022-11-16 08:13:58,129 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:13:58,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:13:58,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 45 states and 162 transitions. [2022-11-16 08:13:58,176 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 162 transitions. [2022-11-16 08:13:58,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:13:58,176 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:13:58,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:13:58,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:13:58,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-16 08:13:58,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:13:58,253 INFO L350 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 10 treesize of output 8 [2022-11-16 08:13:58,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:58,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 83 [2022-11-16 08:13:58,402 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:13:58,403 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 74 [2022-11-16 08:13:58,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 104 [2022-11-16 08:13:58,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:13:58,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 95 [2022-11-16 08:13:58,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 25 treesize of output 47 [2022-11-16 08:13:58,451 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-11-16 08:13:58,454 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:13:58,454 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 94 [2022-11-16 08:13:59,163 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 08:13:59,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 124 [2022-11-16 08:13:59,170 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:13:59,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 73 [2022-11-16 08:13:59,180 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:13:59,181 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2022-11-16 08:13:59,212 INFO L321 Elim1Store]: treesize reduction 19, result has 38.7 percent of original size [2022-11-16 08:13:59,212 INFO L350 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 49 treesize of output 46 [2022-11-16 08:13:59,216 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:13:59,217 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2022-11-16 08:13:59,221 INFO L350 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 5 [2022-11-16 08:13:59,221 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-11-16 08:13:59,228 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:00,066 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~count~0#1| 0)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse1 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (not (and .cse0 .cse1 (exists ((v_DerPreprocessor_51 (Array Int Int)) (v_DerPreprocessor_52 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse9 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse7 (+ .cse9 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_51) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_52) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse4 (+ .cse9 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse5 (select .cse2 .cse4)) (.cse8 (select .cse6 .cse7))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (= .cse2 (store .cse3 .cse4 .cse5)) (<= |ULTIMATE.start_main_~index~0#1| 0) (= .cse6 (store v_DerPreprocessor_52 .cse7 .cse8)) (= (select .cse3 .cse4) 1) (<= 0 (+ .cse5 1)) (= (+ .cse8 1) 0) (= (select v_DerPreprocessor_52 .cse7) 1)))))))) .cse0 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse11 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse10 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse10 0) (= (+ (select .cse6 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse11)) 1) 0) (= (select .cse3 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse11)) 1) (<= 0 .cse10)))) (not (<= c_~ARR_SIZE~0 0)) .cse1 (not (and (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0))))) is different from false [2022-11-16 08:14:00,348 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse0 (= |c_ULTIMATE.start_main_~count~0#1| 0)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse1 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (not (and .cse0 .cse1 (exists ((v_DerPreprocessor_51 (Array Int Int)) (v_DerPreprocessor_52 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse9 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse7 (+ .cse9 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_51) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_52) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse4 (+ .cse9 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse5 (select .cse2 .cse4)) (.cse8 (select .cse6 .cse7))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (= .cse2 (store .cse3 .cse4 .cse5)) (<= |ULTIMATE.start_main_~index~0#1| 0) (= .cse6 (store v_DerPreprocessor_52 .cse7 .cse8)) (= (select .cse3 .cse4) 1) (<= 0 (+ .cse5 1)) (= (+ .cse8 1) 0) (= (select v_DerPreprocessor_52 .cse7) 1)))))))) .cse0 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse11 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse10 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse10 0) (= (+ (select .cse6 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse11)) 1) 0) (= (select .cse3 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse11)) 1) (<= 0 .cse10)))) (not (<= c_~ARR_SIZE~0 0)) .cse1 (not (and (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)))))) is different from true [2022-11-16 08:14:00,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:00,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 46 states and 181 transitions. [2022-11-16 08:14:00,365 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 181 transitions. [2022-11-16 08:14:00,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:00,365 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:00,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:00,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:00,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-16 08:14:00,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:00,446 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:00,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:00,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 83 [2022-11-16 08:14:00,558 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:14:00,559 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 74 [2022-11-16 08:14:00,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 106 [2022-11-16 08:14:00,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:00,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 98 [2022-11-16 08:14:00,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:00,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 25 treesize of output 47 [2022-11-16 08:14:00,593 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:14:00,594 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 95 [2022-11-16 08:14:00,626 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-11-16 08:14:01,357 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 08:14:01,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 100 [2022-11-16 08:14:01,361 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:14:01,362 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 62 [2022-11-16 08:14:01,367 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:14:01,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2022-11-16 08:14:01,374 INFO L350 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 50 treesize of output 48 [2022-11-16 08:14:01,385 INFO L350 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 [2022-11-16 08:14:01,388 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:14:01,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-11-16 08:14:01,395 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:02,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:02,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 46 states and 181 transitions. [2022-11-16 08:14:02,049 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 181 transitions. [2022-11-16 08:14:02,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:02,049 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:02,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:02,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:02,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-16 08:14:02,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:02,132 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:02,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:02,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:14:02,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:14:02,232 INFO L350 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 12 treesize of output 11 [2022-11-16 08:14:02,236 INFO L350 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 12 treesize of output 13 [2022-11-16 08:14:02,248 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:14:02,250 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:14:02,303 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:14:02,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 38 treesize of output 20 [2022-11-16 08:14:02,309 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:02,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:02,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 46 states and 181 transitions. [2022-11-16 08:14:02,364 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 181 transitions. [2022-11-16 08:14:02,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:02,364 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:02,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:02,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:02,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:14:02,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:02,438 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:02,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:14:02,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:02,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:14:02,565 INFO L350 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 12 treesize of output 11 [2022-11-16 08:14:02,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:14:02,628 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:14:02,642 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:14:02,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:14:02,648 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:02,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:02,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 46 states and 181 transitions. [2022-11-16 08:14:02,719 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 181 transitions. [2022-11-16 08:14:02,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:02,719 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:02,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:02,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:02,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-16 08:14:02,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:02,790 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:02,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:02,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 83 [2022-11-16 08:14:02,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 76 [2022-11-16 08:14:02,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 78 [2022-11-16 08:14:02,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 45 [2022-11-16 08:14:02,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 25 treesize of output 47 [2022-11-16 08:14:02,976 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-11-16 08:14:02,979 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:14:02,980 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 104 [2022-11-16 08:14:03,680 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 08:14:03,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 124 [2022-11-16 08:14:03,687 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:14:03,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 73 [2022-11-16 08:14:03,699 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:14:03,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 11 [2022-11-16 08:14:03,707 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:04,367 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse6 (select .cse14 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse7 (select .cse12 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse9 (= .cse7 0)) (.cse10 (= .cse6 0))) (let ((.cse8 (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse35 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse36 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse14 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse35 .cse36)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse12 (+ .cse35 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse36)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse9 .cse10)) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= |c_ULTIMATE.start_main_~count~0#1| 0)) (.cse2 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse34 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse33 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse33 0) (= (+ (select .cse12 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse34)) 1) 0) (= (select .cse14 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse34)) 1) (<= 0 .cse33))))) (.cse4 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse3 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (and .cse1 .cse2 .cse4 .cse5 .cse3)) (or (and (= .cse6 1) (= (+ .cse7 1) 0)) .cse8 (and .cse9 .cse10 (exists ((v_DerPreprocessor_19 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse16 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse13 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse16)) (.cse11 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse15 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse16))) (and (= (select .cse11 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse12 .cse13) 1) 0) (= (select v_DerPreprocessor_19 .cse13) 1) (= (select .cse14 .cse15) 1) (= (+ (select .cse11 .cse15) 1) 0) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0))))))) (not (and .cse1 (exists ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_59 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse22 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse18 (+ .cse22 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse21 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_59) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_60) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_59) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse20 (+ .cse22 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse17 (select .cse21 .cse20)) (.cse19 (select v_DerPreprocessor_59 .cse18))) (and (<= 0 (+ .cse17 1)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= v_DerPreprocessor_59 (store .cse12 .cse18 .cse19)) (= (store .cse14 .cse20 .cse17) .cse21) (= (select .cse14 .cse20) 1) (= (+ (select .cse12 .cse18) 1) 0) (= .cse19 1)))))) .cse3)) (not (and (or .cse8 (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse26 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse23 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse24 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse26)) (.cse25 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse26))) (and (= (select .cse23 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse12 .cse24) 1) 0) (= (+ (select .cse23 .cse25) 1) 0) (= (select v_DerPreprocessor_4 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_4 .cse24) 1) (= (select .cse14 .cse25) 1))))) .cse9 .cse10)) .cse1 .cse4 .cse5)) (not (and (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse32 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse31 (+ .cse32 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse28 (+ .cse32 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse27 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_40) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse29 (select .cse14 .cse28)) (.cse30 (select .cse12 .cse31))) (and (= (+ (select .cse27 .cse28) 1) 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store .cse27 .cse28 .cse29) .cse14) (= .cse29 1) (= (+ .cse30 1) 0) (<= (select v_DerPreprocessor_41 .cse31) 1) (= .cse12 (store v_DerPreprocessor_41 .cse31 .cse30))))))) .cse1 .cse4 .cse5 .cse3)) (not (and (<= c_~ARR_SIZE~0 0) (<= 0 |c_ULTIMATE.start_main_~count~0#1|))) .cse1 (not (and .cse0 .cse1 .cse2)) .cse4 .cse5 .cse3))))) is different from false [2022-11-16 08:14:04,384 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse6 (select .cse14 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse7 (select .cse12 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse9 (= .cse7 0)) (.cse10 (= .cse6 0))) (let ((.cse8 (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse35 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse36 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse14 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse35 .cse36)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse12 (+ .cse35 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse36)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse9 .cse10)) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= |c_ULTIMATE.start_main_~count~0#1| 0)) (.cse2 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse34 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse33 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse33 0) (= (+ (select .cse12 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse34)) 1) 0) (= (select .cse14 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse34)) 1) (<= 0 .cse33))))) (.cse4 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse3 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (and .cse1 .cse2 .cse4 .cse5 .cse3)) (or (and (= .cse6 1) (= (+ .cse7 1) 0)) .cse8 (and .cse9 .cse10 (exists ((v_DerPreprocessor_19 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse16 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse13 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse16)) (.cse11 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse15 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse16))) (and (= (select .cse11 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse12 .cse13) 1) 0) (= (select v_DerPreprocessor_19 .cse13) 1) (= (select .cse14 .cse15) 1) (= (+ (select .cse11 .cse15) 1) 0) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0))))))) (not (and .cse1 (exists ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_59 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse22 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse18 (+ .cse22 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse21 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_59) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_60) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_59) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse20 (+ .cse22 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse17 (select .cse21 .cse20)) (.cse19 (select v_DerPreprocessor_59 .cse18))) (and (<= 0 (+ .cse17 1)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= v_DerPreprocessor_59 (store .cse12 .cse18 .cse19)) (= (store .cse14 .cse20 .cse17) .cse21) (= (select .cse14 .cse20) 1) (= (+ (select .cse12 .cse18) 1) 0) (= .cse19 1)))))) .cse3)) (not (and (or .cse8 (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse26 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse23 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse24 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse26)) (.cse25 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse26))) (and (= (select .cse23 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse12 .cse24) 1) 0) (= (+ (select .cse23 .cse25) 1) 0) (= (select v_DerPreprocessor_4 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_4 .cse24) 1) (= (select .cse14 .cse25) 1))))) .cse9 .cse10)) .cse1 .cse4 .cse5)) (not (and (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse32 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse31 (+ .cse32 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse28 (+ .cse32 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse27 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_40) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse29 (select .cse14 .cse28)) (.cse30 (select .cse12 .cse31))) (and (= (+ (select .cse27 .cse28) 1) 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store .cse27 .cse28 .cse29) .cse14) (= .cse29 1) (= (+ .cse30 1) 0) (<= (select v_DerPreprocessor_41 .cse31) 1) (= .cse12 (store v_DerPreprocessor_41 .cse31 .cse30))))))) .cse1 .cse4 .cse5 .cse3)) (not (and (<= c_~ARR_SIZE~0 0) (<= 0 |c_ULTIMATE.start_main_~count~0#1|))) .cse1 (not (and .cse0 .cse1 .cse2)) .cse4 .cse5 .cse3)))))) is different from true [2022-11-16 08:14:04,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:04,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 46 states and 181 transitions. [2022-11-16 08:14:04,400 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 181 transitions. [2022-11-16 08:14:04,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:04,401 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:04,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:04,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:04,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 55 conjunts are in the unsatisfiable core [2022-11-16 08:14:04,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:04,482 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:04,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:04,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:14:04,619 INFO L350 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 12 treesize of output 11 [2022-11-16 08:14:04,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:14:04,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:14:04,681 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:14:04,696 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:14:04,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:14:04,700 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:04,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:04,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 46 states and 181 transitions. [2022-11-16 08:14:04,753 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 181 transitions. [2022-11-16 08:14:04,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:04,754 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:04,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:04,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-16 08:14:04,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:04,827 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:04,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:04,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:14:04,941 INFO L350 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 12 treesize of output 11 [2022-11-16 08:14:04,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:14:04,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:14:05,003 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:14:05,018 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:14:05,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:14:05,023 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:05,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:05,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 46 states and 181 transitions. [2022-11-16 08:14:05,075 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 181 transitions. [2022-11-16 08:14:05,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:05,075 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:05,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:05,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:05,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:14:05,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:05,150 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:05,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:14:05,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:05,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:14:05,262 INFO L350 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 12 treesize of output 11 [2022-11-16 08:14:05,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:14:05,343 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:14:05,358 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:14:05,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:14:05,363 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:05,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:05,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 46 states and 181 transitions. [2022-11-16 08:14:05,415 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 181 transitions. [2022-11-16 08:14:05,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:05,416 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:05,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:05,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:05,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:14:05,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:05,499 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:05,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:05,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:14:05,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:14:05,601 INFO L350 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 12 treesize of output 13 [2022-11-16 08:14:05,606 INFO L350 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 12 treesize of output 11 [2022-11-16 08:14:05,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:14:05,662 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:14:05,676 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:14:05,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:14:05,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:05,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:05,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 46 states and 181 transitions. [2022-11-16 08:14:05,733 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 181 transitions. [2022-11-16 08:14:05,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:05,733 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:05,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:05,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:05,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:14:05,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:05,801 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:05,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:05,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:14:05,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:14:05,914 INFO L350 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 12 treesize of output 13 [2022-11-16 08:14:05,918 INFO L350 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 12 treesize of output 11 [2022-11-16 08:14:05,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:14:05,976 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:14:05,991 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:14:05,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:14:05,996 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:06,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:06,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 46 states and 181 transitions. [2022-11-16 08:14:06,050 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 181 transitions. [2022-11-16 08:14:06,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:06,051 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:06,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:06,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:06,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-16 08:14:06,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:06,135 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:06,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:14:06,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:06,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:14:06,286 INFO L350 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 12 treesize of output 11 [2022-11-16 08:14:06,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:14:06,349 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:14:06,364 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:14:06,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:14:06,370 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:06,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:06,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 46 states and 181 transitions. [2022-11-16 08:14:06,434 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 181 transitions. [2022-11-16 08:14:06,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:06,435 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:06,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:06,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-16 08:14:06,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:06,512 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:06,654 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:14:06,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:06,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:14:06,664 INFO L350 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 12 treesize of output 11 [2022-11-16 08:14:06,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:14:06,737 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:14:06,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 38 treesize of output 20 [2022-11-16 08:14:06,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:06,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:06,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 46 states and 181 transitions. [2022-11-16 08:14:06,793 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 181 transitions. [2022-11-16 08:14:06,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:06,794 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:06,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:06,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-16 08:14:06,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:06,863 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:07,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:14:07,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:07,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:14:07,027 INFO L350 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 12 treesize of output 11 [2022-11-16 08:14:07,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:14:07,091 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:14:07,105 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:14:07,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:14:07,110 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:07,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:07,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 46 states and 181 transitions. [2022-11-16 08:14:07,189 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 181 transitions. [2022-11-16 08:14:07,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:07,189 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:07,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:07,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:07,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:14:07,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:07,271 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:07,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:07,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:14:07,392 INFO L350 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 12 treesize of output 11 [2022-11-16 08:14:07,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:14:07,407 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:14:07,451 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:14:07,466 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:14:07,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:14:07,472 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:07,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:07,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 46 states and 181 transitions. [2022-11-16 08:14:07,536 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 181 transitions. [2022-11-16 08:14:07,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:07,536 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:07,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:07,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:07,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:14:07,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:07,610 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:07,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:14:07,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:07,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:14:07,727 INFO L350 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 12 treesize of output 11 [2022-11-16 08:14:07,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:14:07,780 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:14:07,795 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:14:07,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:14:07,800 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:07,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:07,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 46 states and 181 transitions. [2022-11-16 08:14:07,848 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 181 transitions. [2022-11-16 08:14:07,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:07,848 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:07,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:07,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:07,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-16 08:14:07,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:07,928 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:07,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:07,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-16 08:14:07,944 INFO L350 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 [2022-11-16 08:14:07,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-16 08:14:08,230 INFO L321 Elim1Store]: treesize reduction 60, result has 46.9 percent of original size [2022-11-16 08:14:08,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 107 treesize of output 150 [2022-11-16 08:14:08,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:08,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 43 [2022-11-16 08:14:08,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:08,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 13 [2022-11-16 08:14:08,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:08,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 23 treesize of output 15 [2022-11-16 08:14:08,306 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:14:08,307 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 88 [2022-11-16 08:14:10,098 INFO L321 Elim1Store]: treesize reduction 124, result has 40.7 percent of original size [2022-11-16 08:14:10,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 180 treesize of output 200 [2022-11-16 08:14:10,113 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:14:10,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 109 [2022-11-16 08:14:10,128 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:14:10,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 103 [2022-11-16 08:14:10,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:10,624 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse0 (select .cse8 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse1 (select .cse7 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse3 (= .cse1 0)) (.cse10 (= .cse0 0))) (let ((.cse2 (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse19 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse20 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse8 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse19 .cse20)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse7 (+ .cse19 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse20)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse3 .cse10)) (.cse11 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse16 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0))) (and (or (and (= .cse0 1) (= (+ .cse1 1) 0)) .cse2 (and .cse3 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse9 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse6 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse9)) (.cse5 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse9))) (and (exists ((v_DerPreprocessor_62 (Array Int Int))) (and (exists ((v_DerPreprocessor_61 (Array Int Int))) (let ((.cse4 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (+ (select .cse4 .cse5) 1) 0) (= (select .cse4 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0)))) (= (select v_DerPreprocessor_62 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_62 .cse6) 1))) (= (+ (select .cse7 .cse6) 1) 0) (= (select .cse8 .cse5) 1))))) .cse10)) (not (<= c_~ARR_SIZE~0 0)) .cse11 (not (and (or .cse2 (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse15 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse12 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse13 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse15)) (.cse14 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse15))) (and (= (select .cse12 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse7 .cse13) 1) 0) (= (+ (select .cse12 .cse14) 1) 0) (= (select v_DerPreprocessor_4 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_4 .cse13) 1) (= (select .cse8 .cse14) 1))))) .cse3 .cse10)) .cse11 .cse16)) .cse16 (not (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse18 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse17 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse17 0) (= (+ (select .cse7 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse18)) 1) 0) (= (select .cse8 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse18)) 1) (<= 0 .cse17)))))) (= |c_ULTIMATE.start_main_~sum~0#1| 0)))))) is different from false [2022-11-16 08:14:11,733 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse0 (select .cse8 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse1 (select .cse7 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse3 (= .cse1 0)) (.cse10 (= .cse0 0))) (let ((.cse2 (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse19 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse20 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse8 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse19 .cse20)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse7 (+ .cse19 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse20)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse3 .cse10)) (.cse11 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse16 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0))) (and (or (and (= .cse0 1) (= (+ .cse1 1) 0)) .cse2 (and .cse3 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse9 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse6 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse9)) (.cse5 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse9))) (and (exists ((v_DerPreprocessor_62 (Array Int Int))) (and (exists ((v_DerPreprocessor_61 (Array Int Int))) (let ((.cse4 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (+ (select .cse4 .cse5) 1) 0) (= (select .cse4 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0)))) (= (select v_DerPreprocessor_62 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_62 .cse6) 1))) (= (+ (select .cse7 .cse6) 1) 0) (= (select .cse8 .cse5) 1))))) .cse10)) (not (<= c_~ARR_SIZE~0 0)) .cse11 (not (and (or .cse2 (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse15 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse12 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse13 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse15)) (.cse14 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse15))) (and (= (select .cse12 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse7 .cse13) 1) 0) (= (+ (select .cse12 .cse14) 1) 0) (= (select v_DerPreprocessor_4 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_4 .cse13) 1) (= (select .cse8 .cse14) 1))))) .cse3 .cse10)) .cse11 .cse16)) .cse16 (not (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse18 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse17 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse17 0) (= (+ (select .cse7 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse18)) 1) 0) (= (select .cse8 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse18)) 1) (<= 0 .cse17)))))) (= |c_ULTIMATE.start_main_~sum~0#1| 0))))))) is different from true [2022-11-16 08:14:13,410 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse40 (select .cse7 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse41 (select .cse6 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse2 (= .cse41 0)) (.cse9 (= .cse40 0))) (let ((.cse0 (and (= .cse40 1) (= (+ .cse41 1) 0))) (.cse1 (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse38 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse39 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse7 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse38 .cse39)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse6 (+ .cse38 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse39)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse2 .cse9)) (.cse10 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse11 (= |c_ULTIMATE.start_main_~count~0#1| 0)) (.cse12 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse37 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse36 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse36 0) (= (+ (select .cse6 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse37)) 1) 0) (= (select .cse7 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse37)) 1) (<= 0 .cse36))))) (.cse14 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse15 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse13 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (or .cse0 .cse1 (and .cse2 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse8 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse5 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse8)) (.cse4 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse8))) (and (exists ((v_DerPreprocessor_62 (Array Int Int))) (and (exists ((v_DerPreprocessor_61 (Array Int Int))) (let ((.cse3 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (+ (select .cse3 .cse4) 1) 0) (= (select .cse3 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0)))) (= (select v_DerPreprocessor_62 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_62 .cse5) 1))) (= (+ (select .cse6 .cse5) 1) 0) (= (select .cse7 .cse4) 1))))) .cse9)) (not (and .cse10 .cse11 .cse12 .cse13)) (not (and .cse11 .cse12 .cse14 .cse15 .cse13)) (or .cse0 .cse1 (and .cse2 .cse9 (exists ((v_DerPreprocessor_19 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse19 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse17 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse19)) (.cse16 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse18 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse19))) (and (= (select .cse16 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse6 .cse17) 1) 0) (= (select v_DerPreprocessor_19 .cse17) 1) (= (select .cse7 .cse18) 1) (= (+ (select .cse16 .cse18) 1) 0) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0))))))) (not (and .cse11 (exists ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_59 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse25 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse21 (+ .cse25 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse24 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_59) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_60) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_59) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse23 (+ .cse25 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse20 (select .cse24 .cse23)) (.cse22 (select v_DerPreprocessor_59 .cse21))) (and (<= 0 (+ .cse20 1)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= v_DerPreprocessor_59 (store .cse6 .cse21 .cse22)) (= (store .cse7 .cse23 .cse20) .cse24) (= (select .cse7 .cse23) 1) (= (+ (select .cse6 .cse21) 1) 0) (= .cse22 1)))))) .cse13)) (not (and (or .cse1 (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse29 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse26 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse27 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse29)) (.cse28 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse29))) (and (= (select .cse26 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse6 .cse27) 1) 0) (= (+ (select .cse26 .cse28) 1) 0) (= (select v_DerPreprocessor_4 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_4 .cse27) 1) (= (select .cse7 .cse28) 1))))) .cse2 .cse9)) .cse11 .cse14 .cse15)) (not (and (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse35 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse34 (+ .cse35 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse31 (+ .cse35 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse30 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_40) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse32 (select .cse7 .cse31)) (.cse33 (select .cse6 .cse34))) (and (= (+ (select .cse30 .cse31) 1) 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store .cse30 .cse31 .cse32) .cse7) (= .cse32 1) (= (+ .cse33 1) 0) (<= (select v_DerPreprocessor_41 .cse34) 1) (= .cse6 (store v_DerPreprocessor_41 .cse34 .cse33))))))) .cse11 .cse14 .cse15 .cse13)) (not (and (<= c_~ARR_SIZE~0 0) (<= 0 |c_ULTIMATE.start_main_~count~0#1|))) .cse11 (not (and .cse10 .cse11 .cse12)) .cse14 .cse15 .cse13))))) is different from false [2022-11-16 08:14:13,978 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse40 (select .cse13 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse41 (select .cse12 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse8 (= .cse41 0)) (.cse15 (= .cse40 0))) (let ((.cse6 (and (= .cse40 1) (= (+ .cse41 1) 0))) (.cse7 (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse38 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse39 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse13 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse38 .cse39)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse12 (+ .cse38 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse39)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse8 .cse15)) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= |c_ULTIMATE.start_main_~count~0#1| 0)) (.cse2 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse37 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse36 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse36 0) (= (+ (select .cse12 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse37)) 1) 0) (= (select .cse13 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse37)) 1) (<= 0 .cse36))))) (.cse4 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse3 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (and .cse1 .cse2 .cse4 .cse5 .cse3)) (not (and (or .cse6 .cse7 (and .cse8 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse14 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse11 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse14)) (.cse10 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse14))) (and (exists ((v_DerPreprocessor_62 (Array Int Int))) (and (exists ((v_DerPreprocessor_61 (Array Int Int))) (let ((.cse9 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (+ (select .cse9 .cse10) 1) 0) (= (select .cse9 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0)))) (= (select v_DerPreprocessor_62 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_62 .cse11) 1))) (= (+ (select .cse12 .cse11) 1) 0) (= (select .cse13 .cse10) 1))))) .cse15)) .cse1 .cse4 .cse5 .cse3)) (or .cse6 .cse7 (and .cse8 .cse15 (exists ((v_DerPreprocessor_19 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse19 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse17 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse19)) (.cse16 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse18 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse19))) (and (= (select .cse16 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse12 .cse17) 1) 0) (= (select v_DerPreprocessor_19 .cse17) 1) (= (select .cse13 .cse18) 1) (= (+ (select .cse16 .cse18) 1) 0) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0))))))) (not (and .cse1 (exists ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_59 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse25 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse21 (+ .cse25 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse24 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_59) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_60) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_59) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse23 (+ .cse25 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse20 (select .cse24 .cse23)) (.cse22 (select v_DerPreprocessor_59 .cse21))) (and (<= 0 (+ .cse20 1)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= v_DerPreprocessor_59 (store .cse12 .cse21 .cse22)) (= (store .cse13 .cse23 .cse20) .cse24) (= (select .cse13 .cse23) 1) (= (+ (select .cse12 .cse21) 1) 0) (= .cse22 1)))))) .cse3)) (not (and (or .cse7 (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse29 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse26 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse27 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse29)) (.cse28 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse29))) (and (= (select .cse26 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse12 .cse27) 1) 0) (= (+ (select .cse26 .cse28) 1) 0) (= (select v_DerPreprocessor_4 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_4 .cse27) 1) (= (select .cse13 .cse28) 1))))) .cse8 .cse15)) .cse1 .cse4 .cse5)) (not (and (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse35 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse34 (+ .cse35 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse31 (+ .cse35 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse30 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_40) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse32 (select .cse13 .cse31)) (.cse33 (select .cse12 .cse34))) (and (= (+ (select .cse30 .cse31) 1) 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store .cse30 .cse31 .cse32) .cse13) (= .cse32 1) (= (+ .cse33 1) 0) (<= (select v_DerPreprocessor_41 .cse34) 1) (= .cse12 (store v_DerPreprocessor_41 .cse34 .cse33))))))) .cse1 .cse4 .cse5 .cse3)) (not (and (<= c_~ARR_SIZE~0 0) (<= 0 |c_ULTIMATE.start_main_~count~0#1|))) .cse1 (not (and .cse0 .cse1 .cse2)) .cse4 .cse5 .cse3))))) is different from false [2022-11-16 08:14:14,007 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse40 (select .cse7 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse41 (select .cse6 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse2 (= .cse41 0)) (.cse9 (= .cse40 0))) (let ((.cse0 (and (= .cse40 1) (= (+ .cse41 1) 0))) (.cse1 (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse38 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse39 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse7 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse38 .cse39)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse6 (+ .cse38 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse39)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse2 .cse9)) (.cse10 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse11 (= |c_ULTIMATE.start_main_~count~0#1| 0)) (.cse12 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse37 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse36 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse36 0) (= (+ (select .cse6 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse37)) 1) 0) (= (select .cse7 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse37)) 1) (<= 0 .cse36))))) (.cse14 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse15 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse13 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (or .cse0 .cse1 (and .cse2 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse8 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse5 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse8)) (.cse4 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse8))) (and (exists ((v_DerPreprocessor_62 (Array Int Int))) (and (exists ((v_DerPreprocessor_61 (Array Int Int))) (let ((.cse3 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (+ (select .cse3 .cse4) 1) 0) (= (select .cse3 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0)))) (= (select v_DerPreprocessor_62 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_62 .cse5) 1))) (= (+ (select .cse6 .cse5) 1) 0) (= (select .cse7 .cse4) 1))))) .cse9)) (not (and .cse10 .cse11 .cse12 .cse13)) (not (and .cse11 .cse12 .cse14 .cse15 .cse13)) (or .cse0 .cse1 (and .cse2 .cse9 (exists ((v_DerPreprocessor_19 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse19 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse17 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse19)) (.cse16 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse18 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse19))) (and (= (select .cse16 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse6 .cse17) 1) 0) (= (select v_DerPreprocessor_19 .cse17) 1) (= (select .cse7 .cse18) 1) (= (+ (select .cse16 .cse18) 1) 0) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0))))))) (not (and .cse11 (exists ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_59 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse25 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse21 (+ .cse25 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse24 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_59) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_60) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_59) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse23 (+ .cse25 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse20 (select .cse24 .cse23)) (.cse22 (select v_DerPreprocessor_59 .cse21))) (and (<= 0 (+ .cse20 1)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= v_DerPreprocessor_59 (store .cse6 .cse21 .cse22)) (= (store .cse7 .cse23 .cse20) .cse24) (= (select .cse7 .cse23) 1) (= (+ (select .cse6 .cse21) 1) 0) (= .cse22 1)))))) .cse13)) (not (and (or .cse1 (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse29 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse26 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse27 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse29)) (.cse28 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse29))) (and (= (select .cse26 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse6 .cse27) 1) 0) (= (+ (select .cse26 .cse28) 1) 0) (= (select v_DerPreprocessor_4 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_4 .cse27) 1) (= (select .cse7 .cse28) 1))))) .cse2 .cse9)) .cse11 .cse14 .cse15)) (not (and (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse35 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse34 (+ .cse35 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse31 (+ .cse35 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse30 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_40) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse32 (select .cse7 .cse31)) (.cse33 (select .cse6 .cse34))) (and (= (+ (select .cse30 .cse31) 1) 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store .cse30 .cse31 .cse32) .cse7) (= .cse32 1) (= (+ .cse33 1) 0) (<= (select v_DerPreprocessor_41 .cse34) 1) (= .cse6 (store v_DerPreprocessor_41 .cse34 .cse33))))))) .cse11 .cse14 .cse15 .cse13)) (not (and (<= c_~ARR_SIZE~0 0) (<= 0 |c_ULTIMATE.start_main_~count~0#1|))) .cse11 (not (and .cse10 .cse11 .cse12)) .cse14 .cse15 .cse13)))))) is different from true [2022-11-16 08:14:14,023 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse40 (select .cse13 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse41 (select .cse12 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse8 (= .cse41 0)) (.cse15 (= .cse40 0))) (let ((.cse6 (and (= .cse40 1) (= (+ .cse41 1) 0))) (.cse7 (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse38 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse39 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse13 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse38 .cse39)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse12 (+ .cse38 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse39)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse8 .cse15)) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= |c_ULTIMATE.start_main_~count~0#1| 0)) (.cse2 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse37 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse36 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse36 0) (= (+ (select .cse12 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse37)) 1) 0) (= (select .cse13 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse37)) 1) (<= 0 .cse36))))) (.cse4 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse3 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (and .cse1 .cse2 .cse4 .cse5 .cse3)) (not (and (or .cse6 .cse7 (and .cse8 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse14 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse11 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse14)) (.cse10 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse14))) (and (exists ((v_DerPreprocessor_62 (Array Int Int))) (and (exists ((v_DerPreprocessor_61 (Array Int Int))) (let ((.cse9 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (+ (select .cse9 .cse10) 1) 0) (= (select .cse9 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0)))) (= (select v_DerPreprocessor_62 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_62 .cse11) 1))) (= (+ (select .cse12 .cse11) 1) 0) (= (select .cse13 .cse10) 1))))) .cse15)) .cse1 .cse4 .cse5 .cse3)) (or .cse6 .cse7 (and .cse8 .cse15 (exists ((v_DerPreprocessor_19 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse19 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse17 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse19)) (.cse16 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse18 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse19))) (and (= (select .cse16 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse12 .cse17) 1) 0) (= (select v_DerPreprocessor_19 .cse17) 1) (= (select .cse13 .cse18) 1) (= (+ (select .cse16 .cse18) 1) 0) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0))))))) (not (and .cse1 (exists ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_59 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse25 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse21 (+ .cse25 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse24 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_59) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_60) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_59) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse23 (+ .cse25 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse20 (select .cse24 .cse23)) (.cse22 (select v_DerPreprocessor_59 .cse21))) (and (<= 0 (+ .cse20 1)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= v_DerPreprocessor_59 (store .cse12 .cse21 .cse22)) (= (store .cse13 .cse23 .cse20) .cse24) (= (select .cse13 .cse23) 1) (= (+ (select .cse12 .cse21) 1) 0) (= .cse22 1)))))) .cse3)) (not (and (or .cse7 (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse29 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse26 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse27 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse29)) (.cse28 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse29))) (and (= (select .cse26 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse12 .cse27) 1) 0) (= (+ (select .cse26 .cse28) 1) 0) (= (select v_DerPreprocessor_4 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_4 .cse27) 1) (= (select .cse13 .cse28) 1))))) .cse8 .cse15)) .cse1 .cse4 .cse5)) (not (and (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse35 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse34 (+ .cse35 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse31 (+ .cse35 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse30 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_40) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse32 (select .cse13 .cse31)) (.cse33 (select .cse12 .cse34))) (and (= (+ (select .cse30 .cse31) 1) 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store .cse30 .cse31 .cse32) .cse13) (= .cse32 1) (= (+ .cse33 1) 0) (<= (select v_DerPreprocessor_41 .cse34) 1) (= .cse12 (store v_DerPreprocessor_41 .cse34 .cse33))))))) .cse1 .cse4 .cse5 .cse3)) (not (and (<= c_~ARR_SIZE~0 0) (<= 0 |c_ULTIMATE.start_main_~count~0#1|))) .cse1 (not (and .cse0 .cse1 .cse2)) .cse4 .cse5 .cse3)))))) is different from true [2022-11-16 08:14:14,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:14,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 48 states and 213 transitions. [2022-11-16 08:14:14,050 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 213 transitions. [2022-11-16 08:14:14,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:14,051 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:14,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:14,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:14,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-16 08:14:14,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:14,135 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:14,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:14,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:14:14,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:14:14,294 INFO L350 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 12 treesize of output 13 [2022-11-16 08:14:14,298 INFO L350 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 12 treesize of output 11 [2022-11-16 08:14:14,310 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:14:14,411 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:14:14,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 38 treesize of output 20 [2022-11-16 08:14:14,417 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:14,444 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse0 (select .cse8 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse1 (select .cse7 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse3 (= .cse1 0)) (.cse10 (= .cse0 0))) (let ((.cse2 (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse22 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse23 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse8 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse22 .cse23)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse7 (+ .cse22 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse23)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse3 .cse10)) (.cse14 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse19 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse11 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse12 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse21 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse20 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse20 0) (= (+ (select .cse7 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse21)) 1) 0) (= (select .cse8 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse21)) 1) (<= 0 .cse20))))) (.cse13 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (or (and (= .cse0 1) (= (+ .cse1 1) 0)) .cse2 (and .cse3 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse9 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse6 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse9)) (.cse5 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse9))) (and (exists ((v_DerPreprocessor_62 (Array Int Int))) (and (exists ((v_DerPreprocessor_61 (Array Int Int))) (let ((.cse4 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (+ (select .cse4 .cse5) 1) 0) (= (select .cse4 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0)))) (= (select v_DerPreprocessor_62 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_62 .cse6) 1))) (= (+ (select .cse7 .cse6) 1) 0) (= (select .cse8 .cse5) 1))))) .cse10)) (not (and .cse11 .cse12 .cse13)) (not (<= c_~ARR_SIZE~0 0)) .cse14 (not (and (or .cse2 (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse18 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse15 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse16 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse18)) (.cse17 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse18))) (and (= (select .cse15 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse7 .cse16) 1) 0) (= (+ (select .cse15 .cse17) 1) 0) (= (select v_DerPreprocessor_4 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_4 .cse16) 1) (= (select .cse8 .cse17) 1))))) .cse3 .cse10)) .cse14 .cse19)) .cse19 (not (and .cse11 .cse12)) .cse13))))) is different from false [2022-11-16 08:14:14,456 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse0 (select .cse8 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse1 (select .cse7 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse3 (= .cse1 0)) (.cse10 (= .cse0 0))) (let ((.cse2 (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse22 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse23 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse8 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse22 .cse23)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse7 (+ .cse22 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse23)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse3 .cse10)) (.cse14 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse19 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse11 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse12 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse21 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse20 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse20 0) (= (+ (select .cse7 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse21)) 1) 0) (= (select .cse8 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse21)) 1) (<= 0 .cse20))))) (.cse13 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (or (and (= .cse0 1) (= (+ .cse1 1) 0)) .cse2 (and .cse3 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse9 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse6 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse9)) (.cse5 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse9))) (and (exists ((v_DerPreprocessor_62 (Array Int Int))) (and (exists ((v_DerPreprocessor_61 (Array Int Int))) (let ((.cse4 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (+ (select .cse4 .cse5) 1) 0) (= (select .cse4 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0)))) (= (select v_DerPreprocessor_62 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_62 .cse6) 1))) (= (+ (select .cse7 .cse6) 1) 0) (= (select .cse8 .cse5) 1))))) .cse10)) (not (and .cse11 .cse12 .cse13)) (not (<= c_~ARR_SIZE~0 0)) .cse14 (not (and (or .cse2 (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse18 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse15 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse16 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse18)) (.cse17 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse18))) (and (= (select .cse15 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse7 .cse16) 1) 0) (= (+ (select .cse15 .cse17) 1) 0) (= (select v_DerPreprocessor_4 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_4 .cse16) 1) (= (select .cse8 .cse17) 1))))) .cse3 .cse10)) .cse14 .cse19)) .cse19 (not (and .cse11 .cse12)) .cse13)))))) is different from true [2022-11-16 08:14:14,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:14,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 48 states and 213 transitions. [2022-11-16 08:14:14,494 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 213 transitions. [2022-11-16 08:14:14,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:14,495 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:14,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:14,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:14,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:14:14,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:14,583 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:14,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:14:14,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:14,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:14:14,696 INFO L350 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 12 treesize of output 11 [2022-11-16 08:14:14,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:14:14,752 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:14:14,767 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:14:14,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:14:14,772 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:14,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:14,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 48 states and 213 transitions. [2022-11-16 08:14:14,831 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 213 transitions. [2022-11-16 08:14:14,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:14,831 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:14,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:14,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:14,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-16 08:14:14,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:14,917 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:14,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:14,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-16 08:14:14,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 20 [2022-11-16 08:14:14,944 INFO L350 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 [2022-11-16 08:14:14,950 INFO L350 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 [2022-11-16 08:14:15,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 88 [2022-11-16 08:14:15,261 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:14:15,262 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 91 [2022-11-16 08:14:15,267 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:14:15,267 INFO L350 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 142 treesize of output 93 [2022-11-16 08:14:15,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:15,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-16 08:14:15,282 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:14:15,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2022-11-16 08:14:15,398 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:14:15,413 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:14:15,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:14:15,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:15,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:15,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 48 states and 213 transitions. [2022-11-16 08:14:15,477 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 213 transitions. [2022-11-16 08:14:15,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:15,477 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:15,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:15,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:15,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-16 08:14:15,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:15,556 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:15,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:15,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:14:15,701 INFO L350 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 12 treesize of output 11 [2022-11-16 08:14:15,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:14:15,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:14:15,762 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:14:15,777 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:14:15,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:14:15,785 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:15,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:15,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 48 states and 213 transitions. [2022-11-16 08:14:15,849 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 213 transitions. [2022-11-16 08:14:15,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:15,849 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:15,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:15,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:15,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-16 08:14:15,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:15,927 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:16,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:14:16,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:16,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:14:16,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:14:16,020 INFO L350 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 12 treesize of output 11 [2022-11-16 08:14:16,023 INFO L350 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 12 treesize of output 13 [2022-11-16 08:14:16,089 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:14:16,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 38 treesize of output 20 [2022-11-16 08:14:16,094 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:16,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:16,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 48 states and 213 transitions. [2022-11-16 08:14:16,154 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 213 transitions. [2022-11-16 08:14:16,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:16,155 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:16,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:16,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:16,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-16 08:14:16,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:16,262 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:16,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:16,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-16 08:14:16,281 INFO L350 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 [2022-11-16 08:14:16,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:16,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 90 [2022-11-16 08:14:16,459 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:14:16,460 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 84 [2022-11-16 08:14:16,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 116 [2022-11-16 08:14:16,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:16,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 105 [2022-11-16 08:14:16,476 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:14:16,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 50 [2022-11-16 08:14:16,487 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:14:16,488 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 97 [2022-11-16 08:14:16,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 57 [2022-11-16 08:14:16,529 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:14:16,530 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2022-11-16 08:14:16,533 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:14:16,533 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2022-11-16 08:14:16,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:16,730 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:14:16,735 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-16 08:14:16,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 28 [2022-11-16 08:14:16,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:16,794 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse43 (select .cse7 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse44 (select .cse6 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse2 (= .cse44 0)) (.cse9 (= .cse43 0))) (let ((.cse0 (and (= .cse43 1) (= (+ .cse44 1) 0))) (.cse1 (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse41 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse42 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse7 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse41 .cse42)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse6 (+ .cse41 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse42)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse2 .cse9)) (.cse10 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse11 (= |c_ULTIMATE.start_main_~count~0#1| 0)) (.cse12 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse40 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse39 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse39 0) (= (+ (select .cse6 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse40)) 1) 0) (= (select .cse7 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse40)) 1) (<= 0 .cse39))))) (.cse14 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse15 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse13 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (or .cse0 .cse1 (and .cse2 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse8 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse5 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse8)) (.cse4 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse8))) (and (exists ((v_DerPreprocessor_62 (Array Int Int))) (and (exists ((v_DerPreprocessor_61 (Array Int Int))) (let ((.cse3 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (+ (select .cse3 .cse4) 1) 0) (= (select .cse3 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0)))) (= (select v_DerPreprocessor_62 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_62 .cse5) 1))) (= (+ (select .cse6 .cse5) 1) 0) (= (select .cse7 .cse4) 1))))) .cse9)) (not (and .cse10 .cse11 .cse12 .cse13)) (not (and .cse11 .cse12 .cse14 .cse15 .cse13)) (or .cse0 .cse1 (and .cse2 .cse9 (exists ((v_DerPreprocessor_19 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse19 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse17 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse19)) (.cse16 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse18 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse19))) (and (= (select .cse16 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse6 .cse17) 1) 0) (= (select v_DerPreprocessor_19 .cse17) 1) (= (select .cse7 .cse18) 1) (= (+ (select .cse16 .cse18) 1) 0) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0))))))) (not (and .cse11 (exists ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_59 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse25 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse21 (+ .cse25 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse24 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_59) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_60) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_59) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse23 (+ .cse25 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse20 (select .cse24 .cse23)) (.cse22 (select v_DerPreprocessor_59 .cse21))) (and (<= 0 (+ .cse20 1)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= v_DerPreprocessor_59 (store .cse6 .cse21 .cse22)) (= (store .cse7 .cse23 .cse20) .cse24) (= (select .cse7 .cse23) 1) (= (+ (select .cse6 .cse21) 1) 0) (= .cse22 1)))))) .cse13)) (not (and (or .cse1 (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse29 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse26 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse27 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse29)) (.cse28 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse29))) (and (= (select .cse26 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse6 .cse27) 1) 0) (= (+ (select .cse26 .cse28) 1) 0) (= (select v_DerPreprocessor_4 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_4 .cse27) 1) (= (select .cse7 .cse28) 1))))) .cse2 .cse9)) .cse11 .cse14 .cse15)) (not (and (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse35 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse34 (+ .cse35 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse31 (+ .cse35 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse30 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_40) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse32 (select .cse7 .cse31)) (.cse33 (select .cse6 .cse34))) (and (= (+ (select .cse30 .cse31) 1) 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store .cse30 .cse31 .cse32) .cse7) (= .cse32 1) (= (+ .cse33 1) 0) (<= (select v_DerPreprocessor_41 .cse34) 1) (= .cse6 (store v_DerPreprocessor_41 .cse34 .cse33))))))) .cse11 .cse14 .cse15 .cse13)) (not (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse38 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse36 (+ .cse38 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse37 (+ .cse38 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (select v_DerPreprocessor_6 .cse36) 1) (= (select .cse7 .cse37) 1) (= (+ (select .cse6 .cse36) 1) 0) (= (+ 1 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base|) .cse37)) 0))))) .cse10 .cse11 .cse14 .cse13)) (not (and (<= c_~ARR_SIZE~0 0) (<= 0 |c_ULTIMATE.start_main_~count~0#1|))) .cse11 (not (and .cse10 .cse11 .cse12)) .cse14 .cse15 .cse13))))) is different from false [2022-11-16 08:14:16,814 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse43 (select .cse7 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse44 (select .cse6 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse2 (= .cse44 0)) (.cse9 (= .cse43 0))) (let ((.cse0 (and (= .cse43 1) (= (+ .cse44 1) 0))) (.cse1 (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse41 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse42 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse7 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse41 .cse42)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse6 (+ .cse41 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse42)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse2 .cse9)) (.cse10 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse11 (= |c_ULTIMATE.start_main_~count~0#1| 0)) (.cse12 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse40 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse39 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse39 0) (= (+ (select .cse6 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse40)) 1) 0) (= (select .cse7 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse40)) 1) (<= 0 .cse39))))) (.cse14 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse15 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse13 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (or .cse0 .cse1 (and .cse2 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse8 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse5 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse8)) (.cse4 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse8))) (and (exists ((v_DerPreprocessor_62 (Array Int Int))) (and (exists ((v_DerPreprocessor_61 (Array Int Int))) (let ((.cse3 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (+ (select .cse3 .cse4) 1) 0) (= (select .cse3 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0)))) (= (select v_DerPreprocessor_62 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_62 .cse5) 1))) (= (+ (select .cse6 .cse5) 1) 0) (= (select .cse7 .cse4) 1))))) .cse9)) (not (and .cse10 .cse11 .cse12 .cse13)) (not (and .cse11 .cse12 .cse14 .cse15 .cse13)) (or .cse0 .cse1 (and .cse2 .cse9 (exists ((v_DerPreprocessor_19 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse19 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse17 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse19)) (.cse16 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse18 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse19))) (and (= (select .cse16 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse6 .cse17) 1) 0) (= (select v_DerPreprocessor_19 .cse17) 1) (= (select .cse7 .cse18) 1) (= (+ (select .cse16 .cse18) 1) 0) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0))))))) (not (and .cse11 (exists ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_59 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse25 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse21 (+ .cse25 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse24 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_59) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_60) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_59) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse23 (+ .cse25 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse20 (select .cse24 .cse23)) (.cse22 (select v_DerPreprocessor_59 .cse21))) (and (<= 0 (+ .cse20 1)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= v_DerPreprocessor_59 (store .cse6 .cse21 .cse22)) (= (store .cse7 .cse23 .cse20) .cse24) (= (select .cse7 .cse23) 1) (= (+ (select .cse6 .cse21) 1) 0) (= .cse22 1)))))) .cse13)) (not (and (or .cse1 (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse29 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse26 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse27 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse29)) (.cse28 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse29))) (and (= (select .cse26 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse6 .cse27) 1) 0) (= (+ (select .cse26 .cse28) 1) 0) (= (select v_DerPreprocessor_4 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_4 .cse27) 1) (= (select .cse7 .cse28) 1))))) .cse2 .cse9)) .cse11 .cse14 .cse15)) (not (and (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse35 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse34 (+ .cse35 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse31 (+ .cse35 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse30 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_40) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse32 (select .cse7 .cse31)) (.cse33 (select .cse6 .cse34))) (and (= (+ (select .cse30 .cse31) 1) 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store .cse30 .cse31 .cse32) .cse7) (= .cse32 1) (= (+ .cse33 1) 0) (<= (select v_DerPreprocessor_41 .cse34) 1) (= .cse6 (store v_DerPreprocessor_41 .cse34 .cse33))))))) .cse11 .cse14 .cse15 .cse13)) (not (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse38 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse36 (+ .cse38 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse37 (+ .cse38 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (select v_DerPreprocessor_6 .cse36) 1) (= (select .cse7 .cse37) 1) (= (+ (select .cse6 .cse36) 1) 0) (= (+ 1 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base|) .cse37)) 0))))) .cse10 .cse11 .cse14 .cse13)) (not (and (<= c_~ARR_SIZE~0 0) (<= 0 |c_ULTIMATE.start_main_~count~0#1|))) .cse11 (not (and .cse10 .cse11 .cse12)) .cse14 .cse15 .cse13)))))) is different from true [2022-11-16 08:14:16,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:16,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 48 states and 213 transitions. [2022-11-16 08:14:16,837 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 213 transitions. [2022-11-16 08:14:16,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:16,837 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:16,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:16,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:16,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-16 08:14:16,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:16,904 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:16,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:16,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:14:16,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:14:16,990 INFO L350 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 12 treesize of output 11 [2022-11-16 08:14:16,994 INFO L350 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 12 treesize of output 13 [2022-11-16 08:14:17,012 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:14:17,014 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:14:17,073 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:14:17,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 38 treesize of output 20 [2022-11-16 08:14:17,080 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:17,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:17,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 48 states and 213 transitions. [2022-11-16 08:14:17,140 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 213 transitions. [2022-11-16 08:14:17,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:17,140 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:17,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:17,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:17,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:14:17,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:17,209 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:17,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:17,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:14:17,355 INFO L350 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 12 treesize of output 11 [2022-11-16 08:14:17,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:14:17,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:14:17,419 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:14:17,434 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:14:17,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:14:17,439 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:17,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:17,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 48 states and 213 transitions. [2022-11-16 08:14:17,501 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 213 transitions. [2022-11-16 08:14:17,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:17,501 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:17,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:17,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-16 08:14:17,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:17,585 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:17,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:17,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-16 08:14:17,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 20 [2022-11-16 08:14:17,622 INFO L350 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 [2022-11-16 08:14:17,629 INFO L350 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 [2022-11-16 08:14:17,952 INFO L321 Elim1Store]: treesize reduction 60, result has 46.9 percent of original size [2022-11-16 08:14:17,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 107 treesize of output 150 [2022-11-16 08:14:17,991 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:14:17,992 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 88 [2022-11-16 08:14:18,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:18,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 43 [2022-11-16 08:14:18,114 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:14:18,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2022-11-16 08:14:18,127 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:14:18,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-11-16 08:14:19,658 INFO L321 Elim1Store]: treesize reduction 124, result has 40.7 percent of original size [2022-11-16 08:14:19,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 190 treesize of output 210 [2022-11-16 08:14:19,674 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:14:19,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 125 [2022-11-16 08:14:19,690 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:14:19,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 105 [2022-11-16 08:14:20,024 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:20,053 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse12 (select .cse0 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse13 (select .cse3 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse10 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse11 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse4 (= .cse13 0)) (.cse5 (= .cse12 0))) (and (not (and (or (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse1 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse2 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse0 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse1 .cse2)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse3 (+ .cse1 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse2)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse4 .cse5) (and .cse4 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse9 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse9)) (.cse7 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse9))) (and (exists ((v_DerPreprocessor_62 (Array Int Int))) (and (exists ((v_DerPreprocessor_61 (Array Int Int))) (let ((.cse6 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (+ (select .cse6 .cse7) 1) 0) (= (select .cse6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0)))) (= (select v_DerPreprocessor_62 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_62 .cse8) 1))) (= (+ (select .cse3 .cse8) 1) 0) (= (select .cse0 .cse7) 1))))) .cse5)) .cse10 .cse11)) (not (<= c_~ARR_SIZE~0 0)) .cse10 .cse11 (or (and (= .cse12 1) (= (+ .cse13 1) 0)) (and .cse4 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse14 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (= (+ (select .cse3 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse14)) 1) 0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse14)) 1)))) .cse5) (and .cse4 .cse5 (exists ((v_DerPreprocessor_70 (Array Int Int)) (v_DerPreprocessor_71 (Array Int Int)) (|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse18 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse19 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse15 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_70) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_71) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_70) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_71) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse16 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse18 .cse19)) (.cse17 (+ .cse18 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse19))) (and (= (select v_DerPreprocessor_71 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select .cse15 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse0 .cse16) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse15 .cse16) 1) (= (select .cse3 .cse17) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)) (= (+ (select v_DerPreprocessor_71 .cse17) 1) 0))))))) (not (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse21 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse20 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse20 0) (= (+ (select .cse3 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse21)) 1) 0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse21)) 1) (<= 0 .cse20)))))) (= |c_ULTIMATE.start_main_~sum~0#1| 0))))) is different from false [2022-11-16 08:14:21,072 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse12 (select .cse0 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse13 (select .cse3 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse10 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse11 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse4 (= .cse13 0)) (.cse5 (= .cse12 0))) (and (not (and (or (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse1 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse2 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse0 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse1 .cse2)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse3 (+ .cse1 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse2)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse4 .cse5) (and .cse4 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse9 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse9)) (.cse7 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse9))) (and (exists ((v_DerPreprocessor_62 (Array Int Int))) (and (exists ((v_DerPreprocessor_61 (Array Int Int))) (let ((.cse6 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (+ (select .cse6 .cse7) 1) 0) (= (select .cse6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0)))) (= (select v_DerPreprocessor_62 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_62 .cse8) 1))) (= (+ (select .cse3 .cse8) 1) 0) (= (select .cse0 .cse7) 1))))) .cse5)) .cse10 .cse11)) (not (<= c_~ARR_SIZE~0 0)) .cse10 .cse11 (or (and (= .cse12 1) (= (+ .cse13 1) 0)) (and .cse4 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse14 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (= (+ (select .cse3 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse14)) 1) 0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse14)) 1)))) .cse5) (and .cse4 .cse5 (exists ((v_DerPreprocessor_70 (Array Int Int)) (v_DerPreprocessor_71 (Array Int Int)) (|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse18 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse19 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse15 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_70) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_71) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_70) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_71) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse16 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse18 .cse19)) (.cse17 (+ .cse18 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse19))) (and (= (select v_DerPreprocessor_71 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select .cse15 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse0 .cse16) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse15 .cse16) 1) (= (select .cse3 .cse17) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)) (= (+ (select v_DerPreprocessor_71 .cse17) 1) 0))))))) (not (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse21 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse20 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse20 0) (= (+ (select .cse3 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse21)) 1) 0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse21)) 1) (<= 0 .cse20)))))) (= |c_ULTIMATE.start_main_~sum~0#1| 0)))))) is different from true [2022-11-16 08:14:21,877 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse12 (select .cse1 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse13 (select .cse4 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse0 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse11 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse5 (= .cse13 0)) (.cse6 (= .cse12 0))) (and (not (<= c_~ARR_SIZE~0 0)) .cse0 (not (and (or (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse2 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse3 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse1 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse2 .cse3)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse4 (+ .cse2 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse3)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse5 .cse6) (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse10 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse7 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse8 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse10)) (.cse9 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse10))) (and (= (select .cse7 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse4 .cse8) 1) 0) (= (+ (select .cse7 .cse9) 1) 0) (= (select v_DerPreprocessor_4 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_4 .cse8) 1) (= (select .cse1 .cse9) 1))))) .cse5 .cse6)) .cse0 .cse11)) .cse11 (or (and (= .cse12 1) (= (+ .cse13 1) 0)) (and .cse5 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse14 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (= (+ (select .cse4 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse14)) 1) 0) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse14)) 1)))) .cse6) (and .cse5 .cse6 (exists ((v_DerPreprocessor_70 (Array Int Int)) (v_DerPreprocessor_71 (Array Int Int)) (|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse18 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse19 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse15 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_70) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_71) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_70) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_71) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse16 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse18 .cse19)) (.cse17 (+ .cse18 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse19))) (and (= (select v_DerPreprocessor_71 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select .cse15 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse1 .cse16) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse15 .cse16) 1) (= (select .cse4 .cse17) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)) (= (+ (select v_DerPreprocessor_71 .cse17) 1) 0))))))) (not (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse21 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse20 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse20 0) (= (+ (select .cse4 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse21)) 1) 0) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse21)) 1) (<= 0 .cse20)))))) (= |c_ULTIMATE.start_main_~sum~0#1| 0))))) is different from false [2022-11-16 08:14:22,179 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse12 (select .cse1 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse13 (select .cse4 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse0 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse11 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse5 (= .cse13 0)) (.cse6 (= .cse12 0))) (and (not (<= c_~ARR_SIZE~0 0)) .cse0 (not (and (or (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse2 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse3 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse1 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse2 .cse3)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse4 (+ .cse2 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse3)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse5 .cse6) (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse10 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse7 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse8 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse10)) (.cse9 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse10))) (and (= (select .cse7 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse4 .cse8) 1) 0) (= (+ (select .cse7 .cse9) 1) 0) (= (select v_DerPreprocessor_4 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_4 .cse8) 1) (= (select .cse1 .cse9) 1))))) .cse5 .cse6)) .cse0 .cse11)) .cse11 (or (and (= .cse12 1) (= (+ .cse13 1) 0)) (and .cse5 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse14 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (= (+ (select .cse4 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse14)) 1) 0) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse14)) 1)))) .cse6) (and .cse5 .cse6 (exists ((v_DerPreprocessor_70 (Array Int Int)) (v_DerPreprocessor_71 (Array Int Int)) (|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse18 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse19 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse15 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_70) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_71) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_70) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_71) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse16 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse18 .cse19)) (.cse17 (+ .cse18 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse19))) (and (= (select v_DerPreprocessor_71 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select .cse15 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse1 .cse16) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse15 .cse16) 1) (= (select .cse4 .cse17) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)) (= (+ (select v_DerPreprocessor_71 .cse17) 1) 0))))))) (not (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse21 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse20 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse20 0) (= (+ (select .cse4 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse21)) 1) 0) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse21)) 1) (<= 0 .cse20)))))) (= |c_ULTIMATE.start_main_~sum~0#1| 0)))))) is different from true [2022-11-16 08:14:22,197 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse42 (select .cse13 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse43 (select .cse12 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse8 (= .cse43 0)) (.cse15 (= .cse42 0))) (let ((.cse7 (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse46 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse47 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse13 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse46 .cse47)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse12 (+ .cse46 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse47)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse8 .cse15)) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= |c_ULTIMATE.start_main_~count~0#1| 0)) (.cse2 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse45 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse44 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse44 0) (= (+ (select .cse12 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse45)) 1) 0) (= (select .cse13 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse45)) 1) (<= 0 .cse44))))) (.cse4 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse6 (and (= .cse42 1) (= (+ .cse43 1) 0))) (.cse3 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (and .cse1 .cse2 .cse4 .cse5 .cse3)) (not (and (or .cse6 .cse7 (and .cse8 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse14 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse11 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse14)) (.cse10 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse14))) (and (exists ((v_DerPreprocessor_62 (Array Int Int))) (and (exists ((v_DerPreprocessor_61 (Array Int Int))) (let ((.cse9 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (+ (select .cse9 .cse10) 1) 0) (= (select .cse9 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0)))) (= (select v_DerPreprocessor_62 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_62 .cse11) 1))) (= (+ (select .cse12 .cse11) 1) 0) (= (select .cse13 .cse10) 1))))) .cse15)) .cse1 .cse4 .cse5 .cse3)) (or .cse6 .cse7 (and .cse8 .cse15 (exists ((v_DerPreprocessor_19 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse19 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse17 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse19)) (.cse16 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse18 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse19))) (and (= (select .cse16 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse12 .cse17) 1) 0) (= (select v_DerPreprocessor_19 .cse17) 1) (= (select .cse13 .cse18) 1) (= (+ (select .cse16 .cse18) 1) 0) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0))))))) (not (and .cse1 (exists ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_59 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse25 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse21 (+ .cse25 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse24 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_59) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_60) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_59) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse23 (+ .cse25 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse20 (select .cse24 .cse23)) (.cse22 (select v_DerPreprocessor_59 .cse21))) (and (<= 0 (+ .cse20 1)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= v_DerPreprocessor_59 (store .cse12 .cse21 .cse22)) (= (store .cse13 .cse23 .cse20) .cse24) (= (select .cse13 .cse23) 1) (= (+ (select .cse12 .cse21) 1) 0) (= .cse22 1)))))) .cse3)) (not (and (or .cse7 (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse29 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse26 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse27 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse29)) (.cse28 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse29))) (and (= (select .cse26 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse12 .cse27) 1) 0) (= (+ (select .cse26 .cse28) 1) 0) (= (select v_DerPreprocessor_4 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_4 .cse27) 1) (= (select .cse13 .cse28) 1))))) .cse8 .cse15)) .cse1 .cse4 .cse5)) (not (and (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse35 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse34 (+ .cse35 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse31 (+ .cse35 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse30 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_40) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse32 (select .cse13 .cse31)) (.cse33 (select .cse12 .cse34))) (and (= (+ (select .cse30 .cse31) 1) 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store .cse30 .cse31 .cse32) .cse13) (= .cse32 1) (= (+ .cse33 1) 0) (<= (select v_DerPreprocessor_41 .cse34) 1) (= .cse12 (store v_DerPreprocessor_41 .cse34 .cse33))))))) .cse1 .cse4 .cse5 .cse3)) (not (and (<= c_~ARR_SIZE~0 0) (<= 0 |c_ULTIMATE.start_main_~count~0#1|))) .cse1 (not (and .cse0 .cse1 .cse2)) .cse4 .cse5 (or .cse6 (and .cse8 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse36 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (= (+ (select .cse12 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse36)) 1) 0) (= (select .cse13 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse36)) 1)))) .cse15) (and .cse8 .cse15 (exists ((v_DerPreprocessor_70 (Array Int Int)) (v_DerPreprocessor_71 (Array Int Int)) (|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse40 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse41 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse37 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_70) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_71) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_70) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_71) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse38 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse40 .cse41)) (.cse39 (+ .cse40 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse41))) (and (= (select v_DerPreprocessor_71 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select .cse37 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse13 .cse38) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse37 .cse38) 1) (= (select .cse12 .cse39) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)) (= (+ (select v_DerPreprocessor_71 .cse39) 1) 0))))))) .cse3))))) is different from false [2022-11-16 08:14:22,877 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse42 (select .cse13 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse43 (select .cse12 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse8 (= .cse43 0)) (.cse15 (= .cse42 0))) (let ((.cse7 (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse46 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse47 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse13 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse46 .cse47)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse12 (+ .cse46 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse47)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse8 .cse15)) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= |c_ULTIMATE.start_main_~count~0#1| 0)) (.cse2 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse45 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse44 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse44 0) (= (+ (select .cse12 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse45)) 1) 0) (= (select .cse13 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse45)) 1) (<= 0 .cse44))))) (.cse4 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse6 (and (= .cse42 1) (= (+ .cse43 1) 0))) (.cse3 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (and .cse1 .cse2 .cse4 .cse5 .cse3)) (not (and (or .cse6 .cse7 (and .cse8 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse14 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse11 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse14)) (.cse10 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse14))) (and (exists ((v_DerPreprocessor_62 (Array Int Int))) (and (exists ((v_DerPreprocessor_61 (Array Int Int))) (let ((.cse9 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (+ (select .cse9 .cse10) 1) 0) (= (select .cse9 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0)))) (= (select v_DerPreprocessor_62 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_62 .cse11) 1))) (= (+ (select .cse12 .cse11) 1) 0) (= (select .cse13 .cse10) 1))))) .cse15)) .cse1 .cse4 .cse5 .cse3)) (or .cse6 .cse7 (and .cse8 .cse15 (exists ((v_DerPreprocessor_19 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse19 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse17 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse19)) (.cse16 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse18 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse19))) (and (= (select .cse16 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse12 .cse17) 1) 0) (= (select v_DerPreprocessor_19 .cse17) 1) (= (select .cse13 .cse18) 1) (= (+ (select .cse16 .cse18) 1) 0) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0))))))) (not (and .cse1 (exists ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_59 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse25 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse21 (+ .cse25 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse24 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_59) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_60) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_59) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse23 (+ .cse25 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse20 (select .cse24 .cse23)) (.cse22 (select v_DerPreprocessor_59 .cse21))) (and (<= 0 (+ .cse20 1)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= v_DerPreprocessor_59 (store .cse12 .cse21 .cse22)) (= (store .cse13 .cse23 .cse20) .cse24) (= (select .cse13 .cse23) 1) (= (+ (select .cse12 .cse21) 1) 0) (= .cse22 1)))))) .cse3)) (not (and (or .cse7 (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse29 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse26 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse27 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse29)) (.cse28 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse29))) (and (= (select .cse26 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse12 .cse27) 1) 0) (= (+ (select .cse26 .cse28) 1) 0) (= (select v_DerPreprocessor_4 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_4 .cse27) 1) (= (select .cse13 .cse28) 1))))) .cse8 .cse15)) .cse1 .cse4 .cse5)) (not (and (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse35 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse34 (+ .cse35 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse31 (+ .cse35 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse30 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_40) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse32 (select .cse13 .cse31)) (.cse33 (select .cse12 .cse34))) (and (= (+ (select .cse30 .cse31) 1) 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store .cse30 .cse31 .cse32) .cse13) (= .cse32 1) (= (+ .cse33 1) 0) (<= (select v_DerPreprocessor_41 .cse34) 1) (= .cse12 (store v_DerPreprocessor_41 .cse34 .cse33))))))) .cse1 .cse4 .cse5 .cse3)) (not (and (<= c_~ARR_SIZE~0 0) (<= 0 |c_ULTIMATE.start_main_~count~0#1|))) .cse1 (not (and .cse0 .cse1 .cse2)) .cse4 .cse5 (or .cse6 (and .cse8 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse36 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (= (+ (select .cse12 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse36)) 1) 0) (= (select .cse13 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse36)) 1)))) .cse15) (and .cse8 .cse15 (exists ((v_DerPreprocessor_70 (Array Int Int)) (v_DerPreprocessor_71 (Array Int Int)) (|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse40 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse41 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse37 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_70) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_71) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_70) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_71) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse38 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse40 .cse41)) (.cse39 (+ .cse40 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse41))) (and (= (select v_DerPreprocessor_71 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select .cse37 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse13 .cse38) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse37 .cse38) 1) (= (select .cse12 .cse39) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)) (= (+ (select v_DerPreprocessor_71 .cse39) 1) 0))))))) .cse3)))))) is different from true [2022-11-16 08:14:22,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:22,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 50 states and 230 transitions. [2022-11-16 08:14:22,901 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 230 transitions. [2022-11-16 08:14:22,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:22,901 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:22,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:22,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:22,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-16 08:14:22,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:22,982 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:23,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:23,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:14:23,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:14:23,070 INFO L350 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 12 treesize of output 13 [2022-11-16 08:14:23,073 INFO L350 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 12 treesize of output 11 [2022-11-16 08:14:23,086 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:14:23,088 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:14:23,143 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:14:23,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 38 treesize of output 20 [2022-11-16 08:14:23,148 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:23,185 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse15 (select .cse4 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse16 (select .cse7 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse14 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse8 (= .cse16 0)) (.cse9 (= .cse15 0)) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse24 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse23 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse23 0) (= (+ (select .cse7 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse24)) 1) 0) (= (select .cse4 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse24)) 1) (<= 0 .cse23))))) (.cse2 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (not (and .cse0 .cse1 .cse2)) (not (<= c_~ARR_SIZE~0 0)) .cse3 (not (and (or (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse5 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse6 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse4 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse5 .cse6)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse7 (+ .cse5 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse6)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse8 .cse9) (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse13 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse10 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse11 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse13)) (.cse12 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse13))) (and (= (select .cse10 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse7 .cse11) 1) 0) (= (+ (select .cse10 .cse12) 1) 0) (= (select v_DerPreprocessor_4 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_4 .cse11) 1) (= (select .cse4 .cse12) 1))))) .cse8 .cse9)) .cse3 .cse14)) .cse14 (or (and (= .cse15 1) (= (+ .cse16 1) 0)) (and .cse8 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse17 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (= (+ (select .cse7 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse17)) 1) 0) (= (select .cse4 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse17)) 1)))) .cse9) (and .cse8 .cse9 (exists ((v_DerPreprocessor_70 (Array Int Int)) (v_DerPreprocessor_71 (Array Int Int)) (|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse21 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse22 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse18 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_70) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_71) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_70) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_71) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse19 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse21 .cse22)) (.cse20 (+ .cse21 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse22))) (and (= (select v_DerPreprocessor_71 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select .cse18 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse4 .cse19) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse18 .cse19) 1) (= (select .cse7 .cse20) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)) (= (+ (select v_DerPreprocessor_71 .cse20) 1) 0))))))) (not (and .cse0 .cse1)) .cse2)))) is different from false [2022-11-16 08:14:23,203 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse15 (select .cse4 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse16 (select .cse7 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse14 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse8 (= .cse16 0)) (.cse9 (= .cse15 0)) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse24 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse23 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse23 0) (= (+ (select .cse7 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse24)) 1) 0) (= (select .cse4 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse24)) 1) (<= 0 .cse23))))) (.cse2 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (not (and .cse0 .cse1 .cse2)) (not (<= c_~ARR_SIZE~0 0)) .cse3 (not (and (or (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse5 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse6 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse4 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse5 .cse6)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse7 (+ .cse5 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse6)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse8 .cse9) (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse13 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse10 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse11 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse13)) (.cse12 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse13))) (and (= (select .cse10 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse7 .cse11) 1) 0) (= (+ (select .cse10 .cse12) 1) 0) (= (select v_DerPreprocessor_4 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_4 .cse11) 1) (= (select .cse4 .cse12) 1))))) .cse8 .cse9)) .cse3 .cse14)) .cse14 (or (and (= .cse15 1) (= (+ .cse16 1) 0)) (and .cse8 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse17 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (= (+ (select .cse7 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse17)) 1) 0) (= (select .cse4 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse17)) 1)))) .cse9) (and .cse8 .cse9 (exists ((v_DerPreprocessor_70 (Array Int Int)) (v_DerPreprocessor_71 (Array Int Int)) (|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse21 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse22 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse18 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_70) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_71) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_70) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_71) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse19 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse21 .cse22)) (.cse20 (+ .cse21 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse22))) (and (= (select v_DerPreprocessor_71 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select .cse18 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse4 .cse19) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse18 .cse19) 1) (= (select .cse7 .cse20) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)) (= (+ (select v_DerPreprocessor_71 .cse20) 1) 0))))))) (not (and .cse0 .cse1)) .cse2))))) is different from true [2022-11-16 08:14:23,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:23,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 50 states and 230 transitions. [2022-11-16 08:14:23,265 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 230 transitions. [2022-11-16 08:14:23,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:23,265 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:23,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:23,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:23,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:14:23,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:23,345 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:23,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:14:23,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:23,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:14:23,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:14:23,471 INFO L350 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 12 treesize of output 11 [2022-11-16 08:14:23,476 INFO L350 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 12 treesize of output 13 [2022-11-16 08:14:23,533 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:14:23,548 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:14:23,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:14:23,553 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:23,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:23,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 50 states and 230 transitions. [2022-11-16 08:14:23,638 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 230 transitions. [2022-11-16 08:14:23,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:23,639 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:23,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:23,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:23,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:14:23,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:23,715 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:23,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:14:23,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:23,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:14:23,837 INFO L350 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 12 treesize of output 11 [2022-11-16 08:14:23,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:14:23,898 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:14:23,913 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:14:23,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:14:23,918 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:23,953 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse14 (select .cse4 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse15 (select .cse7 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse1 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse2 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse8 (= .cse15 0)) (.cse9 (= .cse14 0)) (.cse0 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse23 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse22 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse22 0) (= (+ (select .cse7 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse23)) 1) 0) (= (select .cse4 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse23)) 1) (<= 0 .cse22))))) (.cse3 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (and (or (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse5 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse6 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse4 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse5 .cse6)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse7 (+ .cse5 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse6)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse8 .cse9) (and .cse8 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse13 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse12 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse13)) (.cse11 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse13))) (and (exists ((v_DerPreprocessor_62 (Array Int Int))) (and (exists ((v_DerPreprocessor_61 (Array Int Int))) (let ((.cse10 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (+ (select .cse10 .cse11) 1) 0) (= (select .cse10 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0)))) (= (select v_DerPreprocessor_62 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_62 .cse12) 1))) (= (+ (select .cse7 .cse12) 1) 0) (= (select .cse4 .cse11) 1))))) .cse9)) .cse1 .cse2)) (not (<= c_~ARR_SIZE~0 0)) .cse1 .cse2 (or (and (= .cse14 1) (= (+ .cse15 1) 0)) (and .cse8 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse16 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (= (+ (select .cse7 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse16)) 1) 0) (= (select .cse4 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse16)) 1)))) .cse9) (and .cse8 .cse9 (exists ((v_DerPreprocessor_70 (Array Int Int)) (v_DerPreprocessor_71 (Array Int Int)) (|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse20 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse21 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse17 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_70) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_71) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_70) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_71) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse18 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse20 .cse21)) (.cse19 (+ .cse20 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse21))) (and (= (select v_DerPreprocessor_71 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select .cse17 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse4 .cse18) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse17 .cse18) 1) (= (select .cse7 .cse19) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)) (= (+ (select v_DerPreprocessor_71 .cse19) 1) 0))))))) (not (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) .cse0)) .cse3)))) is different from false [2022-11-16 08:14:24,003 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse14 (select .cse4 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse15 (select .cse7 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse1 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse2 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse8 (= .cse15 0)) (.cse9 (= .cse14 0)) (.cse0 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse23 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse22 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse22 0) (= (+ (select .cse7 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse23)) 1) 0) (= (select .cse4 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse23)) 1) (<= 0 .cse22))))) (.cse3 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (and (or (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse5 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse6 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse4 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse5 .cse6)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse7 (+ .cse5 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse6)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse8 .cse9) (and .cse8 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse13 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse12 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse13)) (.cse11 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse13))) (and (exists ((v_DerPreprocessor_62 (Array Int Int))) (and (exists ((v_DerPreprocessor_61 (Array Int Int))) (let ((.cse10 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (+ (select .cse10 .cse11) 1) 0) (= (select .cse10 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0)))) (= (select v_DerPreprocessor_62 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_62 .cse12) 1))) (= (+ (select .cse7 .cse12) 1) 0) (= (select .cse4 .cse11) 1))))) .cse9)) .cse1 .cse2)) (not (<= c_~ARR_SIZE~0 0)) .cse1 .cse2 (or (and (= .cse14 1) (= (+ .cse15 1) 0)) (and .cse8 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse16 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (= (+ (select .cse7 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse16)) 1) 0) (= (select .cse4 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse16)) 1)))) .cse9) (and .cse8 .cse9 (exists ((v_DerPreprocessor_70 (Array Int Int)) (v_DerPreprocessor_71 (Array Int Int)) (|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse20 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse21 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse17 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_70) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_71) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_70) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_71) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse18 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse20 .cse21)) (.cse19 (+ .cse20 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse21))) (and (= (select v_DerPreprocessor_71 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select .cse17 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse4 .cse18) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse17 .cse18) 1) (= (select .cse7 .cse19) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)) (= (+ (select v_DerPreprocessor_71 .cse19) 1) 0))))))) (not (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) .cse0)) .cse3))))) is different from true [2022-11-16 08:14:24,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:24,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 50 states and 229 transitions. [2022-11-16 08:14:24,045 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 229 transitions. [2022-11-16 08:14:24,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:24,046 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:24,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:24,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-16 08:14:24,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:24,131 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:24,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:24,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 83 [2022-11-16 08:14:24,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 45 [2022-11-16 08:14:24,294 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:14:24,294 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 95 [2022-11-16 08:14:24,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:24,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 93 [2022-11-16 08:14:24,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 25 treesize of output 47 [2022-11-16 08:14:24,313 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:14:24,314 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 94 [2022-11-16 08:14:24,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 59 [2022-11-16 08:14:24,356 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-11-16 08:14:24,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 5 [2022-11-16 08:14:24,364 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:14:24,365 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2022-11-16 08:14:24,522 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:14:24,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 38 treesize of output 20 [2022-11-16 08:14:24,527 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:24,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:24,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 50 states and 229 transitions. [2022-11-16 08:14:24,616 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 229 transitions. [2022-11-16 08:14:24,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:24,617 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:24,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:24,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:24,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-16 08:14:24,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:24,685 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:24,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:24,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:14:24,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:14:24,832 INFO L350 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 12 treesize of output 11 [2022-11-16 08:14:24,835 INFO L350 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 12 treesize of output 13 [2022-11-16 08:14:24,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:14:24,901 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:14:24,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 38 treesize of output 20 [2022-11-16 08:14:24,906 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:24,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:24,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 50 states and 229 transitions. [2022-11-16 08:14:24,972 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 229 transitions. [2022-11-16 08:14:24,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:24,973 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:24,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:25,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-16 08:14:25,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:25,057 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:25,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:25,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:14:25,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:14:25,146 INFO L350 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 12 treesize of output 11 [2022-11-16 08:14:25,149 INFO L350 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 12 treesize of output 13 [2022-11-16 08:14:25,162 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:14:25,163 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:14:25,218 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:14:25,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 38 treesize of output 20 [2022-11-16 08:14:25,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:25,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:25,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 50 states and 229 transitions. [2022-11-16 08:14:25,289 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 229 transitions. [2022-11-16 08:14:25,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:25,289 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:25,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:25,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-16 08:14:25,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:25,360 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:25,433 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:14:25,435 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:14:25,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:25,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:14:25,445 INFO L350 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 12 treesize of output 11 [2022-11-16 08:14:25,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:14:25,512 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:14:25,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 38 treesize of output 20 [2022-11-16 08:14:25,517 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:25,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:25,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 50 states and 229 transitions. [2022-11-16 08:14:25,584 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 229 transitions. [2022-11-16 08:14:25,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:25,585 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:25,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:25,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:25,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-16 08:14:25,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:25,668 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:25,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:25,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 83 [2022-11-16 08:14:25,784 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:14:25,785 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 74 [2022-11-16 08:14:25,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:25,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 102 [2022-11-16 08:14:25,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:25,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 100 [2022-11-16 08:14:25,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2022-11-16 08:14:25,813 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-11-16 08:14:25,838 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:14:25,839 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 104 [2022-11-16 08:14:25,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:25,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 61 [2022-11-16 08:14:25,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 5 [2022-11-16 08:14:25,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 3 [2022-11-16 08:14:25,965 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:14:25,980 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:14:25,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:14:25,985 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:26,024 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse15 (select .cse5 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse16 (select .cse8 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse1 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse2 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse9 (= .cse16 0)) (.cse10 (= .cse15 0)) (.cse4 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse0 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse24 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse23 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse23 0) (= (+ (select .cse8 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse24)) 1) 0) (= (select .cse5 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse24)) 1) (<= 0 .cse23))))) (.cse3 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (and .cse4 .cse0 .cse3)) (not (<= c_~ARR_SIZE~0 0)) .cse1 (not (and (or (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse6 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse7 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse5 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse6 .cse7)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse8 (+ .cse6 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse7)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse9 .cse10) (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse14 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse11 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse12 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse14)) (.cse13 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse14))) (and (= (select .cse11 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse8 .cse12) 1) 0) (= (+ (select .cse11 .cse13) 1) 0) (= (select v_DerPreprocessor_4 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_4 .cse12) 1) (= (select .cse5 .cse13) 1))))) .cse9 .cse10)) .cse1 .cse2)) .cse2 (or (and (= .cse15 1) (= (+ .cse16 1) 0)) (and .cse9 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse17 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (= (+ (select .cse8 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse17)) 1) 0) (= (select .cse5 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse17)) 1)))) .cse10) (and .cse9 .cse10 (exists ((v_DerPreprocessor_70 (Array Int Int)) (v_DerPreprocessor_71 (Array Int Int)) (|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse21 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse22 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse18 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_70) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_71) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_70) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_71) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse19 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse21 .cse22)) (.cse20 (+ .cse21 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse22))) (and (= (select v_DerPreprocessor_71 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select .cse18 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse5 .cse19) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse18 .cse19) 1) (= (select .cse8 .cse20) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)) (= (+ (select v_DerPreprocessor_71 .cse20) 1) 0))))))) (not (and .cse4 .cse0)) .cse3)))) is different from false [2022-11-16 08:14:26,038 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse15 (select .cse5 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse16 (select .cse8 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse1 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse2 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse9 (= .cse16 0)) (.cse10 (= .cse15 0)) (.cse4 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse0 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse24 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse23 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse23 0) (= (+ (select .cse8 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse24)) 1) 0) (= (select .cse5 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse24)) 1) (<= 0 .cse23))))) (.cse3 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (and .cse4 .cse0 .cse3)) (not (<= c_~ARR_SIZE~0 0)) .cse1 (not (and (or (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse6 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse7 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse5 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse6 .cse7)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse8 (+ .cse6 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse7)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse9 .cse10) (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse14 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse11 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse12 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse14)) (.cse13 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse14))) (and (= (select .cse11 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse8 .cse12) 1) 0) (= (+ (select .cse11 .cse13) 1) 0) (= (select v_DerPreprocessor_4 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_4 .cse12) 1) (= (select .cse5 .cse13) 1))))) .cse9 .cse10)) .cse1 .cse2)) .cse2 (or (and (= .cse15 1) (= (+ .cse16 1) 0)) (and .cse9 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse17 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (= (+ (select .cse8 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse17)) 1) 0) (= (select .cse5 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse17)) 1)))) .cse10) (and .cse9 .cse10 (exists ((v_DerPreprocessor_70 (Array Int Int)) (v_DerPreprocessor_71 (Array Int Int)) (|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse21 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse22 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse18 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_70) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_71) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_70) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_71) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse19 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse21 .cse22)) (.cse20 (+ .cse21 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse22))) (and (= (select v_DerPreprocessor_71 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select .cse18 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse5 .cse19) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse18 .cse19) 1) (= (select .cse8 .cse20) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)) (= (+ (select v_DerPreprocessor_71 .cse20) 1) 0))))))) (not (and .cse4 .cse0)) .cse3))))) is different from true [2022-11-16 08:14:26,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:26,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 50 states and 229 transitions. [2022-11-16 08:14:26,074 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 229 transitions. [2022-11-16 08:14:26,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:26,074 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:26,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:26,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-16 08:14:26,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:26,153 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:26,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:26,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:14:26,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:14:26,353 INFO L350 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 12 treesize of output 11 [2022-11-16 08:14:26,359 INFO L350 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 12 treesize of output 13 [2022-11-16 08:14:26,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:14:26,419 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:14:26,435 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:14:26,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:14:26,441 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:26,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:26,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 50 states and 229 transitions. [2022-11-16 08:14:26,527 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 229 transitions. [2022-11-16 08:14:26,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:26,528 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:26,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:26,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:26,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:14:26,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:26,605 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:26,724 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:14:26,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:26,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:14:26,736 INFO L350 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 12 treesize of output 11 [2022-11-16 08:14:26,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:14:26,794 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:14:26,809 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:14:26,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:14:26,814 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:26,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:26,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 50 states and 229 transitions. [2022-11-16 08:14:26,877 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 229 transitions. [2022-11-16 08:14:26,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:26,878 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:26,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:26,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:26,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-16 08:14:26,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:26,954 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:27,026 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:14:27,028 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:14:27,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:27,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:14:27,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:14:27,041 INFO L350 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 12 treesize of output 13 [2022-11-16 08:14:27,045 INFO L350 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 12 treesize of output 11 [2022-11-16 08:14:27,108 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:14:27,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 38 treesize of output 20 [2022-11-16 08:14:27,113 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:27,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:27,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 50 states and 229 transitions. [2022-11-16 08:14:27,177 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 229 transitions. [2022-11-16 08:14:27,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:27,177 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:27,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:27,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:27,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-16 08:14:27,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:27,255 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:27,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:27,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:14:27,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:14:27,363 INFO L350 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 12 treesize of output 11 [2022-11-16 08:14:27,367 INFO L350 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 12 treesize of output 13 [2022-11-16 08:14:27,380 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:14:27,382 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:14:27,437 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:14:27,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 38 treesize of output 20 [2022-11-16 08:14:27,442 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:27,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:27,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 50 states and 229 transitions. [2022-11-16 08:14:27,502 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 229 transitions. [2022-11-16 08:14:27,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:27,502 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:27,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:27,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-16 08:14:27,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:27,591 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:27,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2022-11-16 08:14:27,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-11-16 08:14:27,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:27,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 81 [2022-11-16 08:14:27,831 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:14:27,832 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 75 [2022-11-16 08:14:27,837 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:14:27,838 INFO L350 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 112 treesize of output 77 [2022-11-16 08:14:27,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:27,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2022-11-16 08:14:27,855 INFO L350 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 12 treesize of output 13 [2022-11-16 08:14:27,926 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:14:27,931 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-16 08:14:27,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 17 [2022-11-16 08:14:27,937 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:28,735 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse43 (select .cse13 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse44 (select .cse12 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse8 (= .cse44 0)) (.cse15 (= .cse43 0))) (let ((.cse7 (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse47 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse48 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse13 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse47 .cse48)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse12 (+ .cse47 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse48)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse8 .cse15)) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= |c_ULTIMATE.start_main_~count~0#1| 0)) (.cse2 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse46 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse45 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse45 0) (= (+ (select .cse12 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse46)) 1) 0) (= (select .cse13 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse46)) 1) (<= 0 .cse45))))) (.cse4 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse6 (and (= .cse43 1) (= (+ .cse44 1) 0))) (.cse3 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (and .cse1 .cse2 .cse4 .cse5 .cse3)) (not (and (or .cse6 .cse7 (and .cse8 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse14 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse11 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse14)) (.cse10 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse14))) (and (exists ((v_DerPreprocessor_62 (Array Int Int))) (and (exists ((v_DerPreprocessor_61 (Array Int Int))) (let ((.cse9 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (+ (select .cse9 .cse10) 1) 0) (= (select .cse9 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0)))) (= (select v_DerPreprocessor_62 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_62 .cse11) 1))) (= (+ (select .cse12 .cse11) 1) 0) (= (select .cse13 .cse10) 1))))) .cse15)) .cse1 .cse4 .cse5 .cse3)) (or .cse6 .cse7 (and .cse8 .cse15 (exists ((v_DerPreprocessor_19 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse19 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse17 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse19)) (.cse16 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse18 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse19))) (and (= (select .cse16 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse12 .cse17) 1) 0) (= (select v_DerPreprocessor_19 .cse17) 1) (= (select .cse13 .cse18) 1) (= (+ (select .cse16 .cse18) 1) 0) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0))))))) (not (and .cse1 (exists ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_59 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse25 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse21 (+ .cse25 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse24 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_59) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_60) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_59) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse23 (+ .cse25 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse20 (select .cse24 .cse23)) (.cse22 (select v_DerPreprocessor_59 .cse21))) (and (<= 0 (+ .cse20 1)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= v_DerPreprocessor_59 (store .cse12 .cse21 .cse22)) (= (store .cse13 .cse23 .cse20) .cse24) (= (select .cse13 .cse23) 1) (= (+ (select .cse12 .cse21) 1) 0) (= .cse22 1)))))) .cse3)) (not (and (or .cse7 (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse29 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse26 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse27 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse29)) (.cse28 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse29))) (and (= (select .cse26 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse12 .cse27) 1) 0) (= (+ (select .cse26 .cse28) 1) 0) (= (select v_DerPreprocessor_4 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_4 .cse27) 1) (= (select .cse13 .cse28) 1))))) .cse8 .cse15)) .cse1 .cse4 .cse5)) (not (and (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse35 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse34 (+ .cse35 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse31 (+ .cse35 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse30 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_40) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse32 (select .cse13 .cse31)) (.cse33 (select .cse12 .cse34))) (and (= (+ (select .cse30 .cse31) 1) 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store .cse30 .cse31 .cse32) .cse13) (= .cse32 1) (= (+ .cse33 1) 0) (<= (select v_DerPreprocessor_41 .cse34) 1) (= .cse12 (store v_DerPreprocessor_41 .cse34 .cse33))))))) .cse1 .cse4 .cse5 .cse3)) (not (and .cse0 (exists ((|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse36 (* 4 |ULTIMATE.start_main_~index~0#1|))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (select .cse13 (+ .cse36 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) 1) (= (+ (select .cse12 (+ .cse36 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 1) 0)))) .cse1 .cse5 .cse3)) (not (and (<= c_~ARR_SIZE~0 0) (<= 0 |c_ULTIMATE.start_main_~count~0#1|))) .cse1 (not (and .cse0 .cse1 .cse2)) .cse4 .cse5 (or .cse6 (and .cse8 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse37 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (= (+ (select .cse12 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse37)) 1) 0) (= (select .cse13 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse37)) 1)))) .cse15) (and .cse8 .cse15 (exists ((v_DerPreprocessor_70 (Array Int Int)) (v_DerPreprocessor_71 (Array Int Int)) (|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse41 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse42 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse38 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_70) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_71) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_70) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_71) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse39 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse41 .cse42)) (.cse40 (+ .cse41 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse42))) (and (= (select v_DerPreprocessor_71 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select .cse38 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse13 .cse39) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse38 .cse39) 1) (= (select .cse12 .cse40) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)) (= (+ (select v_DerPreprocessor_71 .cse40) 1) 0))))))) .cse3))))) is different from false [2022-11-16 08:14:28,763 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse43 (select .cse13 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse44 (select .cse12 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse8 (= .cse44 0)) (.cse15 (= .cse43 0))) (let ((.cse7 (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse47 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse48 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse13 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse47 .cse48)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse12 (+ .cse47 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse48)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse8 .cse15)) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= |c_ULTIMATE.start_main_~count~0#1| 0)) (.cse2 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse46 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse45 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse45 0) (= (+ (select .cse12 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse46)) 1) 0) (= (select .cse13 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse46)) 1) (<= 0 .cse45))))) (.cse4 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse6 (and (= .cse43 1) (= (+ .cse44 1) 0))) (.cse3 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (and .cse1 .cse2 .cse4 .cse5 .cse3)) (not (and (or .cse6 .cse7 (and .cse8 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse14 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse11 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse14)) (.cse10 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse14))) (and (exists ((v_DerPreprocessor_62 (Array Int Int))) (and (exists ((v_DerPreprocessor_61 (Array Int Int))) (let ((.cse9 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (+ (select .cse9 .cse10) 1) 0) (= (select .cse9 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0)))) (= (select v_DerPreprocessor_62 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_62 .cse11) 1))) (= (+ (select .cse12 .cse11) 1) 0) (= (select .cse13 .cse10) 1))))) .cse15)) .cse1 .cse4 .cse5 .cse3)) (or .cse6 .cse7 (and .cse8 .cse15 (exists ((v_DerPreprocessor_19 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse19 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse17 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse19)) (.cse16 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse18 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse19))) (and (= (select .cse16 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse12 .cse17) 1) 0) (= (select v_DerPreprocessor_19 .cse17) 1) (= (select .cse13 .cse18) 1) (= (+ (select .cse16 .cse18) 1) 0) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0))))))) (not (and .cse1 (exists ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_59 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse25 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse21 (+ .cse25 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse24 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_59) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_60) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_59) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse23 (+ .cse25 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse20 (select .cse24 .cse23)) (.cse22 (select v_DerPreprocessor_59 .cse21))) (and (<= 0 (+ .cse20 1)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= v_DerPreprocessor_59 (store .cse12 .cse21 .cse22)) (= (store .cse13 .cse23 .cse20) .cse24) (= (select .cse13 .cse23) 1) (= (+ (select .cse12 .cse21) 1) 0) (= .cse22 1)))))) .cse3)) (not (and (or .cse7 (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse29 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse26 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse27 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse29)) (.cse28 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse29))) (and (= (select .cse26 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse12 .cse27) 1) 0) (= (+ (select .cse26 .cse28) 1) 0) (= (select v_DerPreprocessor_4 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_4 .cse27) 1) (= (select .cse13 .cse28) 1))))) .cse8 .cse15)) .cse1 .cse4 .cse5)) (not (and (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse35 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse34 (+ .cse35 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse31 (+ .cse35 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse30 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_40) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse32 (select .cse13 .cse31)) (.cse33 (select .cse12 .cse34))) (and (= (+ (select .cse30 .cse31) 1) 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store .cse30 .cse31 .cse32) .cse13) (= .cse32 1) (= (+ .cse33 1) 0) (<= (select v_DerPreprocessor_41 .cse34) 1) (= .cse12 (store v_DerPreprocessor_41 .cse34 .cse33))))))) .cse1 .cse4 .cse5 .cse3)) (not (and .cse0 (exists ((|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse36 (* 4 |ULTIMATE.start_main_~index~0#1|))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (select .cse13 (+ .cse36 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) 1) (= (+ (select .cse12 (+ .cse36 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 1) 0)))) .cse1 .cse5 .cse3)) (not (and (<= c_~ARR_SIZE~0 0) (<= 0 |c_ULTIMATE.start_main_~count~0#1|))) .cse1 (not (and .cse0 .cse1 .cse2)) .cse4 .cse5 (or .cse6 (and .cse8 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse37 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (= (+ (select .cse12 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse37)) 1) 0) (= (select .cse13 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse37)) 1)))) .cse15) (and .cse8 .cse15 (exists ((v_DerPreprocessor_70 (Array Int Int)) (v_DerPreprocessor_71 (Array Int Int)) (|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse41 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse42 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse38 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_70) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_71) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_70) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_71) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse39 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse41 .cse42)) (.cse40 (+ .cse41 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse42))) (and (= (select v_DerPreprocessor_71 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select .cse38 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse13 .cse39) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse38 .cse39) 1) (= (select .cse12 .cse40) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)) (= (+ (select v_DerPreprocessor_71 .cse40) 1) 0))))))) .cse3)))))) is different from true [2022-11-16 08:14:28,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:28,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 52 states and 240 transitions. [2022-11-16 08:14:28,790 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 240 transitions. [2022-11-16 08:14:28,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:28,790 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:28,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:28,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:28,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-16 08:14:28,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:28,861 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:28,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:28,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:14:28,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:14:28,940 INFO L350 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 12 treesize of output 11 [2022-11-16 08:14:28,944 INFO L350 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 12 treesize of output 13 [2022-11-16 08:14:28,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:14:29,031 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:14:29,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 38 treesize of output 20 [2022-11-16 08:14:29,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:29,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:29,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 52 states and 240 transitions. [2022-11-16 08:14:29,105 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 240 transitions. [2022-11-16 08:14:29,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:29,105 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:29,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:29,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:29,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-16 08:14:29,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:29,177 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:29,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:29,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:14:29,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:14:29,258 INFO L350 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 12 treesize of output 11 [2022-11-16 08:14:29,262 INFO L350 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 12 treesize of output 13 [2022-11-16 08:14:29,276 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:14:29,278 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:14:29,329 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:14:29,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 38 treesize of output 20 [2022-11-16 08:14:29,334 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:29,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:29,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 52 states and 240 transitions. [2022-11-16 08:14:29,396 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 240 transitions. [2022-11-16 08:14:29,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:29,396 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:29,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:29,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:29,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-16 08:14:29,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:29,465 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:29,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:14:29,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:29,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:14:29,616 INFO L350 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 12 treesize of output 11 [2022-11-16 08:14:29,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:14:29,684 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:14:29,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 38 treesize of output 20 [2022-11-16 08:14:29,689 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:29,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:29,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 52 states and 240 transitions. [2022-11-16 08:14:29,750 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 240 transitions. [2022-11-16 08:14:29,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:29,751 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:29,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:29,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-16 08:14:29,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:29,841 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:29,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:29,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:14:30,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:14:30,004 INFO L350 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 12 treesize of output 13 [2022-11-16 08:14:30,008 INFO L350 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 12 treesize of output 11 [2022-11-16 08:14:30,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:14:30,081 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:14:30,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 38 treesize of output 20 [2022-11-16 08:14:30,086 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:30,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:30,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 52 states and 240 transitions. [2022-11-16 08:14:30,175 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 240 transitions. [2022-11-16 08:14:30,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:30,175 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:30,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:30,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:30,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:14:30,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:30,250 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:30,358 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:14:30,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:30,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:14:30,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:14:30,373 INFO L350 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 12 treesize of output 13 [2022-11-16 08:14:30,378 INFO L350 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 12 treesize of output 11 [2022-11-16 08:14:30,432 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:14:30,446 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:14:30,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:14:30,452 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:30,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:30,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 52 states and 240 transitions. [2022-11-16 08:14:30,532 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 240 transitions. [2022-11-16 08:14:30,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:30,535 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:30,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:30,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:30,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-16 08:14:30,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:30,615 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:30,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:30,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:14:30,737 INFO L350 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 12 treesize of output 11 [2022-11-16 08:14:30,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:14:30,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:14:30,801 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:14:30,816 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:14:30,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:14:30,823 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:30,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:30,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 52 states and 240 transitions. [2022-11-16 08:14:30,883 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 240 transitions. [2022-11-16 08:14:30,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:30,883 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:30,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:30,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-16 08:14:30,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:30,964 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:30,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:30,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:14:30,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:14:31,002 INFO L350 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 13 treesize of output 12 [2022-11-16 08:14:31,011 INFO L350 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 13 treesize of output 12 [2022-11-16 08:14:31,401 INFO L321 Elim1Store]: treesize reduction 60, result has 46.9 percent of original size [2022-11-16 08:14:31,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 107 treesize of output 150 [2022-11-16 08:14:31,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:31,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 34 [2022-11-16 08:14:31,450 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:14:31,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2022-11-16 08:14:31,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 08:14:31,534 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:14:31,535 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 82 [2022-11-16 08:14:32,741 INFO L321 Elim1Store]: treesize reduction 78, result has 41.4 percent of original size [2022-11-16 08:14:32,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 177 treesize of output 177 [2022-11-16 08:14:32,757 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:14:32,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 124 [2022-11-16 08:14:32,771 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:14:32,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 104 [2022-11-16 08:14:33,088 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:33,594 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse48 (select .cse13 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse49 (select .cse12 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse8 (= .cse49 0)) (.cse15 (= .cse48 0))) (let ((.cse7 (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse52 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse53 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse13 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse52 .cse53)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse12 (+ .cse52 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse53)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse8 .cse15)) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= |c_ULTIMATE.start_main_~count~0#1| 0)) (.cse2 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse51 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse50 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse50 0) (= (+ (select .cse12 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse51)) 1) 0) (= (select .cse13 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse51)) 1) (<= 0 .cse50))))) (.cse4 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse3 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse6 (and (= .cse48 1) (= (+ .cse49 1) 0))) (.cse37 (and .cse8 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse47 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (= (+ (select .cse12 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse47)) 1) 0) (= (select .cse13 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse47)) 1)))) .cse15))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (and .cse1 .cse2 .cse4 .cse5 .cse3)) (not (and (or .cse6 .cse7 (and .cse8 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse14 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse11 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse14)) (.cse10 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse14))) (and (exists ((v_DerPreprocessor_62 (Array Int Int))) (and (exists ((v_DerPreprocessor_61 (Array Int Int))) (let ((.cse9 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (+ (select .cse9 .cse10) 1) 0) (= (select .cse9 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0)))) (= (select v_DerPreprocessor_62 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_62 .cse11) 1))) (= (+ (select .cse12 .cse11) 1) 0) (= (select .cse13 .cse10) 1))))) .cse15)) .cse1 .cse4 .cse5 .cse3)) (or .cse6 .cse7 (and .cse8 .cse15 (exists ((v_DerPreprocessor_19 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse19 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse17 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse19)) (.cse16 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse18 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse19))) (and (= (select .cse16 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse12 .cse17) 1) 0) (= (select v_DerPreprocessor_19 .cse17) 1) (= (select .cse13 .cse18) 1) (= (+ (select .cse16 .cse18) 1) 0) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0))))))) (not (and .cse1 (exists ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_59 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse25 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse21 (+ .cse25 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse24 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_59) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_60) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_59) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse23 (+ .cse25 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse20 (select .cse24 .cse23)) (.cse22 (select v_DerPreprocessor_59 .cse21))) (and (<= 0 (+ .cse20 1)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= v_DerPreprocessor_59 (store .cse12 .cse21 .cse22)) (= (store .cse13 .cse23 .cse20) .cse24) (= (select .cse13 .cse23) 1) (= (+ (select .cse12 .cse21) 1) 0) (= .cse22 1)))))) .cse3)) (not (and (or .cse7 (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse29 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse26 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse27 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse29)) (.cse28 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse29))) (and (= (select .cse26 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse12 .cse27) 1) 0) (= (+ (select .cse26 .cse28) 1) 0) (= (select v_DerPreprocessor_4 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_4 .cse27) 1) (= (select .cse13 .cse28) 1))))) .cse8 .cse15)) .cse1 .cse4 .cse5)) (not (and (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse35 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse34 (+ .cse35 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse31 (+ .cse35 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse30 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_40) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse32 (select .cse13 .cse31)) (.cse33 (select .cse12 .cse34))) (and (= (+ (select .cse30 .cse31) 1) 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store .cse30 .cse31 .cse32) .cse13) (= .cse32 1) (= (+ .cse33 1) 0) (<= (select v_DerPreprocessor_41 .cse34) 1) (= .cse12 (store v_DerPreprocessor_41 .cse34 .cse33))))))) .cse1 .cse4 .cse5 .cse3)) (not (and .cse0 (exists ((|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse36 (* 4 |ULTIMATE.start_main_~index~0#1|))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (select .cse13 (+ .cse36 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) 1) (= (+ (select .cse12 (+ .cse36 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 1) 0)))) .cse1 .cse5 .cse3)) (not (and (<= c_~ARR_SIZE~0 0) (<= 0 |c_ULTIMATE.start_main_~count~0#1|))) .cse1 (not (and .cse0 .cse1 .cse2)) .cse4 .cse5 (or .cse6 .cse37 (and .cse8 .cse15 (exists ((v_DerPreprocessor_70 (Array Int Int)) (v_DerPreprocessor_71 (Array Int Int)) (|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse41 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse42 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse38 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_70) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_71) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_70) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_71) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse39 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse41 .cse42)) (.cse40 (+ .cse41 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse42))) (and (= (select v_DerPreprocessor_71 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select .cse38 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse13 .cse39) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse38 .cse39) 1) (= (select .cse12 .cse40) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)) (= (+ (select v_DerPreprocessor_71 .cse40) 1) 0))))))) .cse3 (or .cse6 .cse37 (and .cse8 .cse15 (exists ((v_DerPreprocessor_81 (Array Int Int)) (v_DerPreprocessor_82 (Array Int Int)) (|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse43 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse44 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse45 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse43 .cse44)) (.cse46 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_81) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_82) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_81) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_82) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select v_DerPreprocessor_82 (+ .cse43 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse44)) 1) 0) (= (+ (select .cse13 .cse45) 1) 0) (= (select v_DerPreprocessor_82 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse46 .cse45) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)) (= (select .cse46 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0)))))))))))) is different from false [2022-11-16 08:14:34,115 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse48 (select .cse13 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse49 (select .cse12 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse8 (= .cse49 0)) (.cse15 (= .cse48 0))) (let ((.cse7 (and (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse52 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse53 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse13 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse52 .cse53)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse12 (+ .cse52 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse53)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0))))) .cse8 .cse15)) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= |c_ULTIMATE.start_main_~count~0#1| 0)) (.cse2 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse51 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse50 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse50 0) (= (+ (select .cse12 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse51)) 1) 0) (= (select .cse13 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse51)) 1) (<= 0 .cse50))))) (.cse4 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse3 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse6 (and (= .cse48 1) (= (+ .cse49 1) 0))) (.cse37 (and .cse8 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse47 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (= (+ (select .cse12 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse47)) 1) 0) (= (select .cse13 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse47)) 1)))) .cse15))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (and .cse1 .cse2 .cse4 .cse5 .cse3)) (not (and (or .cse6 .cse7 (and .cse8 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse14 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse11 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse14)) (.cse10 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse14))) (and (exists ((v_DerPreprocessor_62 (Array Int Int))) (and (exists ((v_DerPreprocessor_61 (Array Int Int))) (let ((.cse9 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (+ (select .cse9 .cse10) 1) 0) (= (select .cse9 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0)))) (= (select v_DerPreprocessor_62 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_62 .cse11) 1))) (= (+ (select .cse12 .cse11) 1) 0) (= (select .cse13 .cse10) 1))))) .cse15)) .cse1 .cse4 .cse5 .cse3)) (or .cse6 .cse7 (and .cse8 .cse15 (exists ((v_DerPreprocessor_19 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse19 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse17 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse19)) (.cse16 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse18 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse19))) (and (= (select .cse16 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse12 .cse17) 1) 0) (= (select v_DerPreprocessor_19 .cse17) 1) (= (select .cse13 .cse18) 1) (= (+ (select .cse16 .cse18) 1) 0) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0))))))) (not (and .cse1 (exists ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_59 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse25 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse21 (+ .cse25 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse24 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_59) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_60) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_59) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse23 (+ .cse25 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse20 (select .cse24 .cse23)) (.cse22 (select v_DerPreprocessor_59 .cse21))) (and (<= 0 (+ .cse20 1)) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= v_DerPreprocessor_59 (store .cse12 .cse21 .cse22)) (= (store .cse13 .cse23 .cse20) .cse24) (= (select .cse13 .cse23) 1) (= (+ (select .cse12 .cse21) 1) 0) (= .cse22 1)))))) .cse3)) (not (and (or .cse7 (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse29 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse26 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse27 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse29)) (.cse28 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse29))) (and (= (select .cse26 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (select .cse12 .cse27) 1) 0) (= (+ (select .cse26 .cse28) 1) 0) (= (select v_DerPreprocessor_4 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select v_DerPreprocessor_4 .cse27) 1) (= (select .cse13 .cse28) 1))))) .cse8 .cse15)) .cse1 .cse4 .cse5)) (not (and (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse35 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse34 (+ .cse35 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse31 (+ .cse35 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse30 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_40) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse32 (select .cse13 .cse31)) (.cse33 (select .cse12 .cse34))) (and (= (+ (select .cse30 .cse31) 1) 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store .cse30 .cse31 .cse32) .cse13) (= .cse32 1) (= (+ .cse33 1) 0) (<= (select v_DerPreprocessor_41 .cse34) 1) (= .cse12 (store v_DerPreprocessor_41 .cse34 .cse33))))))) .cse1 .cse4 .cse5 .cse3)) (not (and .cse0 (exists ((|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse36 (* 4 |ULTIMATE.start_main_~index~0#1|))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (select .cse13 (+ .cse36 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) 1) (= (+ (select .cse12 (+ .cse36 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 1) 0)))) .cse1 .cse5 .cse3)) (not (and (<= c_~ARR_SIZE~0 0) (<= 0 |c_ULTIMATE.start_main_~count~0#1|))) .cse1 (not (and .cse0 .cse1 .cse2)) .cse4 .cse5 (or .cse6 .cse37 (and .cse8 .cse15 (exists ((v_DerPreprocessor_70 (Array Int Int)) (v_DerPreprocessor_71 (Array Int Int)) (|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse41 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse42 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse38 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_70) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_71) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_70) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_71) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse39 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse41 .cse42)) (.cse40 (+ .cse41 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse42))) (and (= (select v_DerPreprocessor_71 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (select .cse38 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse13 .cse39) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse38 .cse39) 1) (= (select .cse12 .cse40) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)) (= (+ (select v_DerPreprocessor_71 .cse40) 1) 0))))))) .cse3 (or .cse6 .cse37 (and .cse8 .cse15 (exists ((v_DerPreprocessor_81 (Array Int Int)) (v_DerPreprocessor_82 (Array Int Int)) (|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse43 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse44 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse45 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse43 .cse44)) (.cse46 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_81) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_82) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_81) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_82) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select v_DerPreprocessor_82 (+ .cse43 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse44)) 1) 0) (= (+ (select .cse13 .cse45) 1) 0) (= (select v_DerPreprocessor_82 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse46 .cse45) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)) (= (select .cse46 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))))))))))))) is different from true [2022-11-16 08:14:34,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:34,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 52 states and 240 transitions. [2022-11-16 08:14:34,142 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 240 transitions. [2022-11-16 08:14:34,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:34,143 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:34,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:34,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 08:14:34,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:34,217 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:34,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:34,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:14:34,715 INFO L350 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 12 treesize of output 11 [2022-11-16 08:14:34,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:14:34,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:14:35,297 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:14:35,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 11 [2022-11-16 08:14:35,302 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:36,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:36,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 51 states and 213 transitions. [2022-11-16 08:14:36,462 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 213 transitions. [2022-11-16 08:14:36,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:36,462 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:36,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:36,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:36,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:14:36,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:36,531 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:36,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:14:36,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:36,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:14:36,637 INFO L350 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 12 treesize of output 11 [2022-11-16 08:14:36,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:14:36,696 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:14:36,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 11 [2022-11-16 08:14:36,701 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:36,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:36,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 50 states and 188 transitions. [2022-11-16 08:14:36,757 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 188 transitions. [2022-11-16 08:14:36,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:36,757 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:36,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:36,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:36,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:14:36,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:36,835 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:36,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:14:36,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:36,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:14:36,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:14:36,973 INFO L350 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 12 treesize of output 11 [2022-11-16 08:14:36,977 INFO L350 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 22 treesize of output 21 [2022-11-16 08:14:37,034 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:14:37,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 11 [2022-11-16 08:14:37,039 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:38,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:38,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 50 states and 187 transitions. [2022-11-16 08:14:38,937 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 187 transitions. [2022-11-16 08:14:38,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:38,937 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:38,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:38,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:38,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-16 08:14:38,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:39,008 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:39,470 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:14:39,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:39,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:14:39,480 INFO L350 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 12 treesize of output 11 [2022-11-16 08:14:39,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:14:40,032 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:14:40,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:14:40,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:14:41,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:14:41,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 50 states and 187 transitions. [2022-11-16 08:14:41,083 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 187 transitions. [2022-11-16 08:14:41,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:14:41,083 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:14:41,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:14:41,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:14:41,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-16 08:14:41,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:14:41,152 INFO L350 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 10 treesize of output 8 [2022-11-16 08:14:41,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:14:41,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:14:41,247 INFO L350 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 12 treesize of output 11 WARNING: YOUR LOGFILE WAS TOO LONG, SOME LINES IN THE MIDDLE WERE REMOVED. [2022-11-16 08:19:56,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:19:56,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:19:56,938 INFO L350 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 27 treesize of output 11 [2022-11-16 08:19:56,942 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:19:57,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:19:57,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:19:57,006 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:19:57,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:19:57,007 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:19:57,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:19:57,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:19:57,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-16 08:19:57,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:19:57,099 INFO L350 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 10 treesize of output 8 [2022-11-16 08:19:57,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:19:57,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:19:57,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:19:57,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:19:57,194 INFO L350 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 14 treesize of output 13 [2022-11-16 08:19:57,197 INFO L350 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 22 treesize of output 21 [2022-11-16 08:19:57,256 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:19:57,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:19:57,261 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:19:57,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:19:57,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:19:57,316 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:19:57,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:19:57,316 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:19:57,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:19:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:19:57,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 08:19:57,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:19:57,427 INFO L350 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 10 treesize of output 8 [2022-11-16 08:19:57,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:19:57,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:19:57,529 INFO L350 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 12 treesize of output 11 [2022-11-16 08:19:57,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:19:57,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:19:57,579 INFO L350 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 27 treesize of output 11 [2022-11-16 08:19:57,583 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:19:57,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:19:57,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:19:57,636 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:19:57,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:19:57,637 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:19:57,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:19:57,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:19:57,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 08:19:57,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:19:57,754 INFO L350 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 10 treesize of output 8 [2022-11-16 08:19:57,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:19:57,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:19:57,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:19:57,847 INFO L350 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 12 treesize of output 11 [2022-11-16 08:19:57,851 INFO L350 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 22 treesize of output 21 [2022-11-16 08:19:57,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:19:57,895 INFO L350 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 27 treesize of output 11 [2022-11-16 08:19:57,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:19:57,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:19:57,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:19:57,973 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:19:57,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:19:57,973 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:19:57,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:19:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:19:58,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:19:58,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:19:58,070 INFO L350 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 10 treesize of output 8 [2022-11-16 08:19:58,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:19:58,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:19:58,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:19:58,174 INFO L350 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 14 treesize of output 13 [2022-11-16 08:19:58,178 INFO L350 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 22 treesize of output 21 [2022-11-16 08:19:58,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:19:58,221 INFO L350 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 27 treesize of output 11 [2022-11-16 08:19:58,225 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:19:58,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:19:58,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:19:58,293 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:19:58,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:19:58,293 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:19:58,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:19:58,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:19:58,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 08:19:58,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:19:58,396 INFO L350 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 10 treesize of output 8 [2022-11-16 08:19:58,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:19:58,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:19:58,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:19:58,496 INFO L350 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 12 treesize of output 11 [2022-11-16 08:19:58,500 INFO L350 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 22 treesize of output 21 [2022-11-16 08:19:58,509 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:19:58,542 INFO L350 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 27 treesize of output 11 [2022-11-16 08:19:58,546 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:19:58,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:19:58,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:19:58,619 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:19:58,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:19:58,620 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:19:58,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:19:58,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:19:58,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:19:58,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:19:58,717 INFO L350 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 10 treesize of output 8 [2022-11-16 08:19:58,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:19:58,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:19:58,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:19:58,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:19:58,827 INFO L350 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 12 treesize of output 11 [2022-11-16 08:19:58,831 INFO L350 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 22 treesize of output 21 [2022-11-16 08:19:58,876 INFO L350 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 27 treesize of output 11 [2022-11-16 08:19:58,881 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:19:58,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:19:58,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:19:58,941 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:19:58,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:19:58,942 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:19:58,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:19:59,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:19:59,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:19:59,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:19:59,034 INFO L350 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 10 treesize of output 8 [2022-11-16 08:19:59,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:19:59,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:19:59,140 INFO L350 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 12 treesize of output 11 [2022-11-16 08:19:59,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:19:59,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:19:59,192 INFO L350 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 27 treesize of output 11 [2022-11-16 08:19:59,196 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:19:59,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:19:59,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:19:59,266 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:19:59,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:19:59,266 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:19:59,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:19:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:19:59,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-16 08:19:59,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:19:59,356 INFO L350 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 10 treesize of output 8 [2022-11-16 08:19:59,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:19:59,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:19:59,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:19:59,454 INFO L350 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 14 treesize of output 13 [2022-11-16 08:19:59,458 INFO L350 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 22 treesize of output 21 [2022-11-16 08:19:59,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:19:59,519 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:19:59,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:19:59,524 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:19:59,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:19:59,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:19:59,586 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:19:59,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:19:59,586 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:19:59,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:19:59,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:19:59,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-16 08:19:59,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:19:59,677 INFO L350 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 10 treesize of output 8 [2022-11-16 08:19:59,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:19:59,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:19:59,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:19:59,955 INFO L350 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 14 treesize of output 13 [2022-11-16 08:19:59,958 INFO L350 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 22 treesize of output 21 [2022-11-16 08:19:59,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:00,021 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:20:00,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:20:00,026 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:00,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:00,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:00,120 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:00,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:00,120 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:00,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:00,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:00,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-16 08:20:00,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:00,215 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:00,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:00,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:00,303 INFO L350 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 12 treesize of output 11 [2022-11-16 08:20:00,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:20:00,316 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:20:00,365 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:20:00,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:20:00,370 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:00,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:00,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:00,437 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:00,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:00,437 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:00,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:00,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:00,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-16 08:20:00,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:00,534 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:00,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:00,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:00,816 INFO L350 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 12 treesize of output 11 [2022-11-16 08:20:00,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:20:00,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:00,880 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:20:00,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:20:00,885 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:00,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:00,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:00,939 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:00,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:00,939 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:00,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:01,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-16 08:20:01,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:01,046 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:01,324 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:20:01,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:01,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:01,334 INFO L350 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 12 treesize of output 11 [2022-11-16 08:20:01,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:20:01,395 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:20:01,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:20:01,400 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:01,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:01,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:01,464 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:01,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:01,464 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:01,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:01,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:01,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-16 08:20:01,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:01,564 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:01,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:01,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:01,649 INFO L350 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 12 treesize of output 11 [2022-11-16 08:20:01,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:20:01,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:01,707 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:20:01,712 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-16 08:20:01,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 14 [2022-11-16 08:20:01,717 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:01,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:01,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:01,769 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:01,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:01,769 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:01,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:01,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:01,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:20:01,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:01,859 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:01,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:01,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:01,960 INFO L350 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 12 treesize of output 11 [2022-11-16 08:20:01,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:20:01,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:02,010 INFO L350 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 27 treesize of output 11 [2022-11-16 08:20:02,014 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:02,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:02,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:02,080 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:02,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:02,081 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:02,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:02,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:02,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 08:20:02,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:02,171 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:02,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:02,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:02,454 INFO L350 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 12 treesize of output 11 [2022-11-16 08:20:02,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:20:02,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:02,520 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:20:02,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:20:02,525 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:02,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:02,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:02,612 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:02,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:02,612 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:02,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:02,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:02,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 08:20:02,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:02,745 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:02,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:02,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:02,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:20:02,833 INFO L350 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 14 treesize of output 13 [2022-11-16 08:20:02,836 INFO L350 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 22 treesize of output 21 [2022-11-16 08:20:02,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:02,892 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:20:02,896 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-16 08:20:02,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 14 [2022-11-16 08:20:02,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:02,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:02,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:02,986 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:02,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:02,986 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:02,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:03,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:03,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-16 08:20:03,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:03,081 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:03,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:03,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:03,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:20:03,167 INFO L350 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 14 treesize of output 13 [2022-11-16 08:20:03,170 INFO L350 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 22 treesize of output 21 [2022-11-16 08:20:03,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:03,230 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:20:03,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:20:03,235 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:03,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:03,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:03,303 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:03,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:03,303 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:03,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:03,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:03,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-16 08:20:03,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:03,393 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:03,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:03,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:03,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:03,679 INFO L350 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 12 treesize of output 11 [2022-11-16 08:20:03,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:20:03,739 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:20:03,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:20:03,744 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:03,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:03,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:03,792 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:03,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:03,792 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:03,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:03,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-16 08:20:03,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:03,885 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:04,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:04,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:04,177 INFO L350 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 12 treesize of output 11 [2022-11-16 08:20:04,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:20:04,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:04,245 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:20:04,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:20:04,250 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:04,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:04,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:04,307 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:04,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:04,307 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:04,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:04,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-16 08:20:04,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:04,404 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:04,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:04,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:04,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:04,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:20:04,699 INFO L350 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 12 treesize of output 11 [2022-11-16 08:20:04,703 INFO L350 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 22 treesize of output 21 [2022-11-16 08:20:04,761 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:20:04,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:20:04,766 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:04,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:04,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:04,820 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:04,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:04,820 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:04,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:04,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 08:20:04,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:04,914 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:05,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:05,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:05,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:05,024 INFO L350 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 12 treesize of output 11 [2022-11-16 08:20:05,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:20:05,071 INFO L350 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 27 treesize of output 11 [2022-11-16 08:20:05,075 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:05,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:05,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:05,133 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:05,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:05,133 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:05,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:05,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:05,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:20:05,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:05,235 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:05,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:05,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:05,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:20:05,362 INFO L350 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 12 treesize of output 11 [2022-11-16 08:20:05,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:20:05,427 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:20:05,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 38 treesize of output 20 [2022-11-16 08:20:05,431 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:05,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:05,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:05,484 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:05,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:05,484 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:05,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:05,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:05,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 08:20:05,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:05,575 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:05,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:05,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:05,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:20:05,673 INFO L350 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 12 treesize of output 11 [2022-11-16 08:20:05,676 INFO L350 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 22 treesize of output 21 [2022-11-16 08:20:05,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:05,720 INFO L350 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 27 treesize of output 11 [2022-11-16 08:20:05,724 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:05,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:05,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:05,781 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:05,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:05,781 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:05,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:05,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 08:20:05,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:05,878 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:05,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:05,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:05,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:20:05,974 INFO L350 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 14 treesize of output 13 [2022-11-16 08:20:05,977 INFO L350 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 22 treesize of output 21 [2022-11-16 08:20:05,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:06,021 INFO L350 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 27 treesize of output 11 [2022-11-16 08:20:06,025 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:06,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:06,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:06,080 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:06,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:06,080 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:06,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:06,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:06,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:20:06,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:06,175 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:06,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:06,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:06,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:06,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:20:06,280 INFO L350 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 12 treesize of output 11 [2022-11-16 08:20:06,284 INFO L350 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 22 treesize of output 21 [2022-11-16 08:20:06,323 INFO L350 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 27 treesize of output 11 [2022-11-16 08:20:06,328 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:06,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:06,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:06,401 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:06,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:06,402 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:06,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:06,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-16 08:20:06,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:06,494 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:06,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:06,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:06,786 INFO L350 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 12 treesize of output 11 [2022-11-16 08:20:06,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:20:06,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:06,853 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:20:06,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:20:06,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:06,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:06,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:06,929 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:06,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:06,929 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:06,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:06,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:07,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-16 08:20:07,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:07,026 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:07,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:07,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:07,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:07,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:20:07,308 INFO L350 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 12 treesize of output 11 [2022-11-16 08:20:07,311 INFO L350 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 22 treesize of output 21 [2022-11-16 08:20:07,371 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:20:07,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:20:07,376 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:07,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:07,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:07,486 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:07,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:07,486 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:07,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:07,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:07,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-16 08:20:07,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:07,585 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:07,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:07,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:07,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:07,727 INFO L350 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 12 treesize of output 11 [2022-11-16 08:20:07,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:20:07,775 INFO L350 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 27 treesize of output 11 [2022-11-16 08:20:07,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:07,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:07,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:07,889 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:07,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:07,889 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:07,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:07,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-16 08:20:07,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:07,980 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:08,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:08,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:08,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:08,109 INFO L350 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 12 treesize of output 11 [2022-11-16 08:20:08,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:20:08,150 INFO L350 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 27 treesize of output 11 [2022-11-16 08:20:08,154 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:08,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:08,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:08,228 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:08,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:08,228 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:08,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:08,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:08,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:20:08,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:08,321 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:08,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:08,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:08,422 INFO L350 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 12 treesize of output 11 [2022-11-16 08:20:08,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:20:08,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:08,469 INFO L350 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 27 treesize of output 11 [2022-11-16 08:20:08,474 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:08,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:08,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:08,586 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:08,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:08,586 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:08,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:08,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:08,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-16 08:20:08,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:08,685 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:08,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:08,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:08,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:08,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:20:08,825 INFO L350 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 14 treesize of output 13 [2022-11-16 08:20:08,829 INFO L350 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 22 treesize of output 21 [2022-11-16 08:20:08,868 INFO L350 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 27 treesize of output 11 [2022-11-16 08:20:08,873 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:08,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:08,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:08,942 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:08,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:08,943 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:08,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:09,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:09,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-16 08:20:09,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:09,045 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:09,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:09,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:09,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:09,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:20:09,140 INFO L350 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 12 treesize of output 11 [2022-11-16 08:20:09,143 INFO L350 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 22 treesize of output 21 [2022-11-16 08:20:09,200 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:20:09,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:20:09,205 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:09,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:09,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:09,260 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:09,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:09,260 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:09,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:09,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:09,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 08:20:09,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:09,357 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:09,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:09,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:09,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:20:09,465 INFO L350 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 14 treesize of output 13 [2022-11-16 08:20:09,469 INFO L350 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 22 treesize of output 21 [2022-11-16 08:20:09,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:09,514 INFO L350 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 27 treesize of output 11 [2022-11-16 08:20:09,518 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:09,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:09,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:09,574 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:09,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:09,574 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:09,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:09,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:09,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-16 08:20:09,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:09,673 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:09,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:09,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:09,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:20:09,826 INFO L350 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 12 treesize of output 11 [2022-11-16 08:20:09,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:20:09,889 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:20:09,904 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:20:09,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:20:09,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:09,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:10,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:10,000 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:10,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:10,000 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:10,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:10,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:10,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-16 08:20:10,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:10,090 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:10,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:10,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:10,177 INFO L350 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 12 treesize of output 11 [2022-11-16 08:20:10,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:20:10,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:10,238 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:20:10,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:20:10,243 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:10,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:10,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:10,291 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:10,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:10,292 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:10,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:10,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:20:10,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:10,386 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:10,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:10,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:20:10,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:20:10,490 INFO L350 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 12 treesize of output 13 [2022-11-16 08:20:10,495 INFO L350 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 12 treesize of output 11 [2022-11-16 08:20:10,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:10,552 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:20:10,567 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:20:10,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:20:10,572 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:10,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:10,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:10,626 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:10,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:10,626 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:10,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:10,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 08:20:10,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:10,721 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:10,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:10,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:10,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:10,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:20:10,833 INFO L350 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 14 treesize of output 13 [2022-11-16 08:20:10,837 INFO L350 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 22 treesize of output 21 [2022-11-16 08:20:10,876 INFO L350 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 27 treesize of output 11 [2022-11-16 08:20:10,881 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:10,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:10,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:10,955 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:10,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:10,956 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:10,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:11,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:11,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-16 08:20:11,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:11,058 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:11,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:11,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:11,147 INFO L350 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 12 treesize of output 11 [2022-11-16 08:20:11,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:20:11,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:11,213 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:20:11,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:20:11,217 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:11,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:11,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:11,268 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:11,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:11,268 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:11,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:11,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-16 08:20:11,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:11,357 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:11,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:11,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:11,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:20:11,452 INFO L350 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 14 treesize of output 13 [2022-11-16 08:20:11,455 INFO L350 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 22 treesize of output 21 [2022-11-16 08:20:11,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:11,518 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:20:11,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:20:11,523 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:11,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:11,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:11,576 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:11,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:11,576 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:11,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:11,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:11,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:20:11,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:11,669 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:11,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:11,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:11,780 INFO L350 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 12 treesize of output 11 [2022-11-16 08:20:11,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:20:11,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:11,836 INFO L350 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 27 treesize of output 11 [2022-11-16 08:20:11,840 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:11,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:11,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:11,899 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:11,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:11,899 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:11,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:11,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:11,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-16 08:20:11,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:11,998 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:12,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:12,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:12,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:12,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:20:12,145 INFO L350 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 12 treesize of output 11 [2022-11-16 08:20:12,149 INFO L350 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 22 treesize of output 21 [2022-11-16 08:20:12,193 INFO L350 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 27 treesize of output 11 [2022-11-16 08:20:12,197 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:12,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:12,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:12,305 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:12,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:12,305 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:12,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:12,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:12,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-16 08:20:12,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:12,421 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:12,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:12,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:12,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:12,520 INFO L350 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 12 treesize of output 11 [2022-11-16 08:20:12,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:20:12,589 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:20:12,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:20:12,594 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:12,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:12,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:12,687 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:12,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:12,687 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:12,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:12,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-16 08:20:12,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:12,812 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:12,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:12,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:20:12,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:20:12,936 INFO L350 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 12 treesize of output 13 [2022-11-16 08:20:12,941 INFO L350 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 12 treesize of output 11 [2022-11-16 08:20:12,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:13,008 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:20:13,023 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:20:13,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:20:13,029 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:13,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:13,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:13,106 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:13,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:13,106 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:13,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:13,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:13,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-16 08:20:13,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:13,205 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:13,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:13,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-16 08:20:13,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 20 [2022-11-16 08:20:13,234 INFO L350 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 [2022-11-16 08:20:13,240 INFO L350 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 [2022-11-16 08:20:13,570 INFO L321 Elim1Store]: treesize reduction 60, result has 46.9 percent of original size [2022-11-16 08:20:13,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 113 treesize of output 150 [2022-11-16 08:20:13,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 59 [2022-11-16 08:20:13,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:13,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 48 treesize of output 34 [2022-11-16 08:20:13,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:13,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 29 treesize of output 21 [2022-11-16 08:20:13,632 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:20:13,633 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2022-11-16 08:20:13,695 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:20:13,696 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 62 [2022-11-16 08:20:14,185 INFO L350 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 27 treesize of output 11 [2022-11-16 08:20:14,189 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:14,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:14,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:14,264 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:14,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:14,264 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:14,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:14,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:20:14,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:14,357 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:14,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:14,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:14,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:20:14,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:20:14,481 INFO L350 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 12 treesize of output 11 [2022-11-16 08:20:14,486 INFO L350 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 12 treesize of output 13 [2022-11-16 08:20:14,544 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:20:14,558 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:20:14,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:20:14,563 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:14,592 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse5 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse24 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse23 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse23 0) (= (+ (select .cse4 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse24)) 1) 0) (= (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse24)) 1) (<= 0 .cse23))))) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse6 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse7 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse9 (select .cse4 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse8 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse1 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse1 0) (<= 0 .cse1) (= (let ((.cse3 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (+ (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse3)) (select .cse4 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse3)))) 0)))) (not (and .cse5 .cse6 .cse7 .cse8)) (= .cse9 0) (not (and .cse0 .cse5 .cse8)) (not (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse10 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (= (+ (select .cse4 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse10)) 1) 0) (= (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse10)) 1))))) (not (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse11 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse12 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse11 .cse12)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse4 (+ .cse11 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse12)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)))))) (not (and .cse0 (exists ((v_DerPreprocessor_112 (Array Int Int)) (v_DerPreprocessor_113 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse18 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse15 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_112) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_113) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_112) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse13 (+ .cse18 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse14 (select .cse15 .cse13)) (.cse17 (select .cse2 .cse13)) (.cse16 (+ .cse18 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (and (= (store .cse2 .cse13 .cse14) .cse15) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ (select .cse4 .cse16) .cse17) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (+ .cse14 .cse17) 0) (= (store .cse4 .cse16 (select v_DerPreprocessor_112 .cse16)) v_DerPreprocessor_112)))))) .cse6 .cse7 .cse8)) (not (<= c_~ARR_SIZE~0 0)) .cse6 .cse7 (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_107 (Array Int Int)) (v_DerPreprocessor_108 (Array Int Int))) (let ((.cse19 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse20 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse22 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_107) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_108) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_107) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_108) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse21 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse19 .cse20))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select v_DerPreprocessor_108 (+ .cse19 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse20)) 1) 0) (= (+ (select .cse2 .cse21) 1) 0) (= (select .cse22 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select v_DerPreprocessor_108 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)) (= (select .cse22 .cse21) 1))))) (= 0 (+ .cse9 (select .cse2 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) .cse8))) is different from false [2022-11-16 08:20:14,607 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse5 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse24 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse23 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse23 0) (= (+ (select .cse4 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse24)) 1) 0) (= (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse24)) 1) (<= 0 .cse23))))) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse6 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse7 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse9 (select .cse4 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse8 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse1 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse1 0) (<= 0 .cse1) (= (let ((.cse3 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (+ (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse3)) (select .cse4 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse3)))) 0)))) (not (and .cse5 .cse6 .cse7 .cse8)) (= .cse9 0) (not (and .cse0 .cse5 .cse8)) (not (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse10 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (= (+ (select .cse4 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse10)) 1) 0) (= (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse10)) 1))))) (not (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse11 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse12 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse11 .cse12)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse4 (+ .cse11 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse12)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)))))) (not (and .cse0 (exists ((v_DerPreprocessor_112 (Array Int Int)) (v_DerPreprocessor_113 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse18 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse15 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_112) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_113) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_112) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse13 (+ .cse18 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse14 (select .cse15 .cse13)) (.cse17 (select .cse2 .cse13)) (.cse16 (+ .cse18 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (and (= (store .cse2 .cse13 .cse14) .cse15) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ (select .cse4 .cse16) .cse17) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (+ .cse14 .cse17) 0) (= (store .cse4 .cse16 (select v_DerPreprocessor_112 .cse16)) v_DerPreprocessor_112)))))) .cse6 .cse7 .cse8)) (not (<= c_~ARR_SIZE~0 0)) .cse6 .cse7 (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_107 (Array Int Int)) (v_DerPreprocessor_108 (Array Int Int))) (let ((.cse19 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse20 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse22 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_107) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_108) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_107) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_108) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse21 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse19 .cse20))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select v_DerPreprocessor_108 (+ .cse19 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse20)) 1) 0) (= (+ (select .cse2 .cse21) 1) 0) (= (select .cse22 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select v_DerPreprocessor_108 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)) (= (select .cse22 .cse21) 1))))) (= 0 (+ .cse9 (select .cse2 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) .cse8)))) is different from true [2022-11-16 08:20:14,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:14,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:14,686 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:14,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:14,686 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:14,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:14,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-16 08:20:14,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:14,783 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:14,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:14,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:14,820 INFO L350 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 13 treesize of output 12 [2022-11-16 08:20:14,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-11-16 08:20:15,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:15,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 99 [2022-11-16 08:20:15,148 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:20:15,149 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 88 [2022-11-16 08:20:15,155 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:20:15,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 119 [2022-11-16 08:20:15,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:15,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 119 [2022-11-16 08:20:15,171 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:20:15,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 58 [2022-11-16 08:20:15,204 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:20:15,205 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 105 [2022-11-16 08:20:15,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:15,847 INFO L350 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 74 treesize of output 60 [2022-11-16 08:20:15,850 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:20:15,851 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-11-16 08:20:15,854 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:20:15,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 26 [2022-11-16 08:20:15,857 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:20:15,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-16 08:20:15,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:15,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:15,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:15,921 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:15,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:15,921 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:15,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:15,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:15,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-16 08:20:15,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:16,009 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:16,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:16,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:16,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:16,107 INFO L350 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 12 treesize of output 11 [2022-11-16 08:20:16,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:20:16,210 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:20:16,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:20:16,215 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:16,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:16,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:16,276 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:16,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:16,276 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:16,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:16,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:16,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-16 08:20:16,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:16,366 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:16,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:16,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:16,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:20:16,647 INFO L350 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 14 treesize of output 13 [2022-11-16 08:20:16,651 INFO L350 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 22 treesize of output 21 [2022-11-16 08:20:16,660 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:20:16,709 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:20:16,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:20:16,714 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:16,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:16,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:16,799 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:16,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:16,799 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:16,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:16,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-16 08:20:16,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:16,897 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:16,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:16,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:16,984 INFO L350 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 12 treesize of output 11 [2022-11-16 08:20:16,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:20:16,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:17,045 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:20:17,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:20:17,050 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:17,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:17,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:17,137 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:17,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:17,138 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:17,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:17,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:17,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:20:17,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:17,236 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:17,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:17,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:17,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:17,332 INFO L350 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 12 treesize of output 11 [2022-11-16 08:20:17,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:20:17,387 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:20:17,392 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-16 08:20:17,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 14 [2022-11-16 08:20:17,397 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:17,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:17,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:17,462 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:17,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:17,462 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:17,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:17,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:17,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 08:20:17,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:17,567 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:17,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:17,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:17,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:20:17,672 INFO L350 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 14 treesize of output 13 [2022-11-16 08:20:17,676 INFO L350 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 22 treesize of output 21 [2022-11-16 08:20:17,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:17,723 INFO L350 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 27 treesize of output 11 [2022-11-16 08:20:17,727 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:17,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:17,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:17,803 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:17,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:17,803 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:17,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:17,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:20:17,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:17,902 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:18,015 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:20:18,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:18,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:18,027 INFO L350 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 12 treesize of output 11 [2022-11-16 08:20:18,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:20:18,073 INFO L350 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 27 treesize of output 11 [2022-11-16 08:20:18,077 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:18,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:18,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:18,158 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:18,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:18,159 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:18,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:18,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-16 08:20:18,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:18,258 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:18,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:18,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:18,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:18,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:20:18,405 INFO L350 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 12 treesize of output 11 [2022-11-16 08:20:18,410 INFO L350 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 22 treesize of output 21 [2022-11-16 08:20:18,452 INFO L350 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 27 treesize of output 11 [2022-11-16 08:20:18,456 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:18,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:18,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:18,524 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:18,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:18,524 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:18,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:18,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-16 08:20:18,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:18,619 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:18,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:18,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:18,714 INFO L350 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 12 treesize of output 11 [2022-11-16 08:20:18,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:20:18,732 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:20:18,790 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:20:18,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:20:18,795 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:18,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:18,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:18,860 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:18,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:18,860 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:18,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:18,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:18,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-16 08:20:18,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:18,961 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:19,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:19,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:19,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:19,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:20:19,119 INFO L350 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 14 treesize of output 13 [2022-11-16 08:20:19,122 INFO L350 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 22 treesize of output 21 [2022-11-16 08:20:19,178 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:20:19,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:20:19,183 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:19,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:19,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:19,242 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:19,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:19,243 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:19,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:19,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:19,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-16 08:20:19,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:19,339 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:19,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:19,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:19,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:20:19,432 INFO L350 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 12 treesize of output 11 [2022-11-16 08:20:19,435 INFO L350 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 22 treesize of output 21 [2022-11-16 08:20:19,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:19,492 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:20:19,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:20:19,497 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:19,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:19,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:19,549 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:19,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:19,550 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:19,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:19,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 08:20:19,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:19,639 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:19,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:19,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:19,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:20:19,922 INFO L350 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 14 treesize of output 13 [2022-11-16 08:20:19,925 INFO L350 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 22 treesize of output 21 [2022-11-16 08:20:19,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:19,986 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:20:19,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:20:19,991 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:20,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:20,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:20,064 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:20,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:20,064 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:20,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:20,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:20,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 08:20:20,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:20,156 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:20,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:20,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:20,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:20:20,274 INFO L350 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 12 treesize of output 11 [2022-11-16 08:20:20,279 INFO L350 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 22 treesize of output 21 [2022-11-16 08:20:20,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:20,325 INFO L350 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 27 treesize of output 11 [2022-11-16 08:20:20,330 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:20,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:20,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:20,396 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:20,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:20,396 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:20,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:20,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:20,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:20:20,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:20,501 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:20,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:20,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:20,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:20,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:20:20,611 INFO L350 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 12 treesize of output 11 [2022-11-16 08:20:20,615 INFO L350 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 22 treesize of output 21 [2022-11-16 08:20:20,652 INFO L350 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 27 treesize of output 11 [2022-11-16 08:20:20,656 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:20,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:20,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:20,726 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:20,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:20,726 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:20,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:20,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:20,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-16 08:20:20,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:20,823 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:20,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:20,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:20,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:20,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:20:20,922 INFO L350 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 14 treesize of output 13 [2022-11-16 08:20:20,925 INFO L350 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 22 treesize of output 21 [2022-11-16 08:20:20,988 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:20:20,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:20:20,993 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:21,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:21,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:21,064 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:21,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:21,064 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:21,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:21,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:21,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-16 08:20:21,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:21,165 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:21,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:21,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:21,257 INFO L350 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 12 treesize of output 11 [2022-11-16 08:20:21,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:20:21,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:21,325 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:20:21,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:20:21,330 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:21,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:21,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:21,391 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:21,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:21,391 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:21,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:21,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:21,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:20:21,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:21,488 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:21,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:21,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:21,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:20:21,607 INFO L350 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 14 treesize of output 13 [2022-11-16 08:20:21,611 INFO L350 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 22 treesize of output 21 [2022-11-16 08:20:21,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:21,658 INFO L350 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 27 treesize of output 11 [2022-11-16 08:20:21,662 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:21,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:21,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:21,720 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:21,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:21,721 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:21,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:21,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:21,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-16 08:20:21,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:21,814 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:21,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:21,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:21,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:21,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:20:21,952 INFO L350 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 14 treesize of output 13 [2022-11-16 08:20:21,955 INFO L350 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 22 treesize of output 21 [2022-11-16 08:20:22,009 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:20:22,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:20:22,014 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:22,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:22,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:22,062 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:22,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:22,062 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:22,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:22,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:22,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-16 08:20:22,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:22,162 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:22,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:22,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:22,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:20:22,284 INFO L350 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 12 treesize of output 11 [2022-11-16 08:20:22,288 INFO L350 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 22 treesize of output 21 [2022-11-16 08:20:22,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:22,333 INFO L350 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 27 treesize of output 11 [2022-11-16 08:20:22,337 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:22,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:22,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:22,391 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:22,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:22,391 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:22,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:22,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-16 08:20:22,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:22,485 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:22,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:22,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:22,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:20:22,601 INFO L350 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 12 treesize of output 11 [2022-11-16 08:20:22,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:20:22,659 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:20:22,674 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:20:22,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:20:22,679 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:22,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:22,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:22,731 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:22,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:22,731 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:22,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:22,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-16 08:20:22,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:22,822 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:23,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:23,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:23,102 INFO L350 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 12 treesize of output 11 [2022-11-16 08:20:23,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:20:23,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:23,168 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:20:23,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:20:23,172 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:23,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:23,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:23,237 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:23,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:23,237 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:23,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:23,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-16 08:20:23,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:23,326 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:23,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:23,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:23,417 INFO L350 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 12 treesize of output 11 [2022-11-16 08:20:23,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:20:23,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:23,485 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:20:23,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:20:23,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:23,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:23,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:23,552 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:23,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:23,552 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:23,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:23,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:23,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:20:23,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:23,652 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:23,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:23,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:23,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:23,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:20:23,763 INFO L350 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 12 treesize of output 11 [2022-11-16 08:20:23,767 INFO L350 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 22 treesize of output 21 [2022-11-16 08:20:23,805 INFO L350 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 27 treesize of output 11 [2022-11-16 08:20:23,809 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:23,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:23,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:23,863 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:23,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:23,863 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:23,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:23,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-16 08:20:23,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:23,957 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:24,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:24,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:24,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:20:24,236 INFO L350 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 14 treesize of output 13 [2022-11-16 08:20:24,240 INFO L350 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 22 treesize of output 21 [2022-11-16 08:20:24,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:24,306 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:20:24,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:20:24,311 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:24,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:24,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 61 states and 370 transitions. [2022-11-16 08:20:24,389 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 370 transitions. [2022-11-16 08:20:24,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:24,389 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:24,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:24,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:20:24,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:24,486 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:24,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:24,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:24,577 INFO L350 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 12 treesize of output 11 [2022-11-16 08:20:24,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:20:24,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:24,640 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:20:24,645 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-16 08:20:24,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 14 [2022-11-16 08:20:24,649 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:25,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:25,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:20:25,881 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:20:25,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:25,881 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:25,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:25,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:25,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-16 08:20:25,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:25,977 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:26,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:20:26,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:26,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:20:26,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:20:26,072 INFO L350 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 12 treesize of output 11 [2022-11-16 08:20:26,076 INFO L350 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 22 treesize of output 21 [2022-11-16 08:20:26,131 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:20:26,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:20:26,135 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:20:26,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:20:26,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:20:26,198 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:20:26,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:20:26,198 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:20:26,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:20:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:20:26,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-16 08:20:26,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:20:26,297 INFO L350 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 10 treesize of output 8 [2022-11-16 08:20:26,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:26,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-16 08:20:26,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 20 [2022-11-16 08:20:26,328 INFO L350 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 [2022-11-16 08:20:26,335 INFO L350 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 [2022-11-16 08:20:26,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:26,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 99 [2022-11-16 08:20:26,576 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:20:26,577 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 88 [2022-11-16 08:20:26,582 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:20:26,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 121 [2022-11-16 08:20:26,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:20:26,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 119 [2022-11-16 08:20:26,596 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:20:26,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 58 [2022-11-16 08:20:26,604 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:20:26,604 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 96 [2022-11-16 08:22:47,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:22:47,363 INFO L350 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 78 treesize of output 60 [2022-11-16 08:22:47,366 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:22:47,367 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2022-11-16 08:22:47,369 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:22:47,370 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2022-11-16 08:22:47,372 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:22:47,373 INFO L350 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 20 treesize of output 12 [2022-11-16 08:22:47,375 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:22:47,380 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:24:22,728 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse5 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse30 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse29 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse29 0) (= (+ (select .cse4 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse30)) 1) 0) (= (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse30)) 1) (<= 0 .cse29))))) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse6 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse7 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse9 (select .cse4 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse8 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse1 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse1 0) (<= 0 .cse1) (= (let ((.cse3 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (+ (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse3)) (select .cse4 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse3)))) 0)))) (not (and .cse5 .cse6 .cse7 .cse8)) (= .cse9 0) (not (and .cse0 .cse5 .cse8)) (not (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse10 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (= (+ (select .cse4 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse10)) 1) 0) (= (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse10)) 1))))) (not (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse11 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse12 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse11 .cse12)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse4 (+ .cse11 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse12)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)))))) (not (and .cse0 (exists ((v_DerPreprocessor_112 (Array Int Int)) (v_DerPreprocessor_113 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse18 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse15 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_112) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_113) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_112) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse13 (+ .cse18 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse14 (select .cse15 .cse13)) (.cse17 (select .cse2 .cse13)) (.cse16 (+ .cse18 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (and (= (store .cse2 .cse13 .cse14) .cse15) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ (select .cse4 .cse16) .cse17) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (+ .cse14 .cse17) 0) (= (store .cse4 .cse16 (select v_DerPreprocessor_112 .cse16)) v_DerPreprocessor_112)))))) .cse6 .cse7 .cse8)) (not (and .cse0 .cse6 (exists ((v_DerPreprocessor_125 (Array Int Int)) (v_DerPreprocessor_126 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse24 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse22 (+ .cse24 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse23 (+ .cse24 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse19 (select .cse4 .cse23)) (.cse20 (select .cse2 .cse22)) (.cse21 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_125) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_126) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_125) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse19 .cse20) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store .cse21 .cse22 .cse20) .cse2) (= .cse4 (store v_DerPreprocessor_125 .cse23 .cse19)) (= (+ .cse20 (select .cse21 .cse22)) 0)))))) .cse7 .cse8)) (not (<= c_~ARR_SIZE~0 0)) .cse6 .cse7 (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_107 (Array Int Int)) (v_DerPreprocessor_108 (Array Int Int))) (let ((.cse25 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse26 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse28 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_107) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_108) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_107) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_108) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse27 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse25 .cse26))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select v_DerPreprocessor_108 (+ .cse25 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse26)) 1) 0) (= (+ (select .cse2 .cse27) 1) 0) (= (select .cse28 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select v_DerPreprocessor_108 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)) (= (select .cse28 .cse27) 1))))) (= 0 (+ .cse9 (select .cse2 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) .cse8))) is different from false [2022-11-16 08:24:22,746 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse5 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse30 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (.cse29 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse29 0) (= (+ (select .cse4 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse30)) 1) 0) (= (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse30)) 1) (<= 0 .cse29))))) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse6 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse7 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse9 (select .cse4 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse8 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse1 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|))) (and (<= .cse1 0) (<= 0 .cse1) (= (let ((.cse3 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (+ (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse3)) (select .cse4 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse3)))) 0)))) (not (and .cse5 .cse6 .cse7 .cse8)) (= .cse9 0) (not (and .cse0 .cse5 .cse8)) (not (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse10 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (= (+ (select .cse4 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse10)) 1) 0) (= (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse10)) 1))))) (not (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse11 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse12 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse11 .cse12)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse4 (+ .cse11 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse12)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)))))) (not (and .cse0 (exists ((v_DerPreprocessor_112 (Array Int Int)) (v_DerPreprocessor_113 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse18 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse15 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_112) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_113) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_112) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse13 (+ .cse18 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse14 (select .cse15 .cse13)) (.cse17 (select .cse2 .cse13)) (.cse16 (+ .cse18 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (and (= (store .cse2 .cse13 .cse14) .cse15) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ (select .cse4 .cse16) .cse17) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (+ .cse14 .cse17) 0) (= (store .cse4 .cse16 (select v_DerPreprocessor_112 .cse16)) v_DerPreprocessor_112)))))) .cse6 .cse7 .cse8)) (not (and .cse0 .cse6 (exists ((v_DerPreprocessor_125 (Array Int Int)) (v_DerPreprocessor_126 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse24 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse22 (+ .cse24 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse23 (+ .cse24 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse19 (select .cse4 .cse23)) (.cse20 (select .cse2 .cse22)) (.cse21 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_125) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_126) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_125) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse19 .cse20) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store .cse21 .cse22 .cse20) .cse2) (= .cse4 (store v_DerPreprocessor_125 .cse23 .cse19)) (= (+ .cse20 (select .cse21 .cse22)) 0)))))) .cse7 .cse8)) (not (<= c_~ARR_SIZE~0 0)) .cse6 .cse7 (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_107 (Array Int Int)) (v_DerPreprocessor_108 (Array Int Int))) (let ((.cse25 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse26 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse28 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_107) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_108) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_107) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_108) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse27 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse25 .cse26))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select v_DerPreprocessor_108 (+ .cse25 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse26)) 1) 0) (= (+ (select .cse2 .cse27) 1) 0) (= (select .cse28 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select v_DerPreprocessor_108 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)) (= (select .cse28 .cse27) 1))))) (= 0 (+ .cse9 (select .cse2 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) .cse8)))) is different from true [2022-11-16 08:24:23,258 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse11 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse18 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse19 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (= (select .cse0 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse1 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (= (+ (select .cse0 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse1)) 1) 0) (= (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse1)) 1))))) (not (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse3 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse4 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse3 .cse4)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse0 (+ .cse3 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse4)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)))))) (exists ((v_DerPreprocessor_112 (Array Int Int)) (v_DerPreprocessor_113 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse10 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse7 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_112) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_113) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_112) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse5 (+ .cse10 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse6 (select .cse7 .cse5)) (.cse9 (select .cse2 .cse5)) (.cse8 (+ .cse10 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (and (= (store .cse2 .cse5 .cse6) .cse7) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ (select .cse0 .cse8) .cse9) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (+ .cse6 .cse9) 0) (= (store .cse0 .cse8 (select v_DerPreprocessor_112 .cse8)) v_DerPreprocessor_112)))))) (not (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) .cse11 (exists ((v_DerPreprocessor_125 (Array Int Int)) (v_DerPreprocessor_126 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse17 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse15 (+ .cse17 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse16 (+ .cse17 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse12 (select .cse0 .cse16)) (.cse13 (select .cse2 .cse15)) (.cse14 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_125) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_126) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_125) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse12 .cse13) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store .cse14 .cse15 .cse13) .cse2) (= .cse0 (store v_DerPreprocessor_125 .cse16 .cse12)) (= (+ .cse13 (select .cse14 .cse15)) 0)))))) .cse18 .cse19)) (not (<= c_~ARR_SIZE~0 0)) .cse11 .cse18 (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_107 (Array Int Int)) (v_DerPreprocessor_108 (Array Int Int))) (let ((.cse20 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse21 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse23 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_107) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_108) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_107) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_108) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse22 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse20 .cse21))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select v_DerPreprocessor_108 (+ .cse20 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse21)) 1) 0) (= (+ (select .cse2 .cse22) 1) 0) (= (select .cse23 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select v_DerPreprocessor_108 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)) (= (select .cse23 .cse22) 1))))) .cse19)) is different from false [2022-11-16 08:24:23,273 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse11 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse18 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse19 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (= (select .cse0 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse1 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (= (+ (select .cse0 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse1)) 1) 0) (= (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse1)) 1))))) (not (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse3 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse4 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse3 .cse4)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select .cse0 (+ .cse3 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse4)) 1) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)))))) (exists ((v_DerPreprocessor_112 (Array Int Int)) (v_DerPreprocessor_113 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse10 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse7 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_112) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_113) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_112) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse5 (+ .cse10 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (let ((.cse6 (select .cse7 .cse5)) (.cse9 (select .cse2 .cse5)) (.cse8 (+ .cse10 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (and (= (store .cse2 .cse5 .cse6) .cse7) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ (select .cse0 .cse8) .cse9) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (+ .cse6 .cse9) 0) (= (store .cse0 .cse8 (select v_DerPreprocessor_112 .cse8)) v_DerPreprocessor_112)))))) (not (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) .cse11 (exists ((v_DerPreprocessor_125 (Array Int Int)) (v_DerPreprocessor_126 (Array Int Int)) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse17 (* 4 |ULTIMATE.start_main_~index~0#1|))) (let ((.cse15 (+ .cse17 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse16 (+ .cse17 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse12 (select .cse0 .cse16)) (.cse13 (select .cse2 .cse15)) (.cse14 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_125) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_126) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_125) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ .cse12 .cse13) 0) (<= |ULTIMATE.start_main_~index~0#1| 0) (= (store .cse14 .cse15 .cse13) .cse2) (= .cse0 (store v_DerPreprocessor_125 .cse16 .cse12)) (= (+ .cse13 (select .cse14 .cse15)) 0)))))) .cse18 .cse19)) (not (<= c_~ARR_SIZE~0 0)) .cse11 .cse18 (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (v_DerPreprocessor_107 (Array Int Int)) (v_DerPreprocessor_108 (Array Int Int))) (let ((.cse20 (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (.cse21 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) (let ((.cse23 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_107) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_108) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_107) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_108) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse22 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse20 .cse21))) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (= (+ (select v_DerPreprocessor_108 (+ .cse20 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse21)) 1) 0) (= (+ (select .cse2 .cse22) 1) 0) (= (select .cse23 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (= (select v_DerPreprocessor_108 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)) (= (select .cse23 .cse22) 1))))) .cse19))) is different from true [2022-11-16 08:24:50,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:24:50,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 63 states and 417 transitions. [2022-11-16 08:24:50,303 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 417 transitions. [2022-11-16 08:24:50,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:24:50,303 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:24:50,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:24:50,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:24:50,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:24:50,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:24:50,406 INFO L350 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 10 treesize of output 8 [2022-11-16 08:24:50,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:24:50,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:24:50,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:24:50,520 INFO L350 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 12 treesize of output 11 [2022-11-16 08:24:50,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:24:50,570 INFO L350 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 27 treesize of output 11 [2022-11-16 08:24:50,575 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:24:50,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:24:50,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 63 states and 417 transitions. [2022-11-16 08:24:50,628 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 417 transitions. [2022-11-16 08:24:50,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:24:50,628 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:24:50,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:24:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:24:50,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-16 08:24:50,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:24:50,723 INFO L350 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 10 treesize of output 8 [2022-11-16 08:24:50,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:24:50,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:24:50,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:24:50,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:24:50,836 INFO L350 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 14 treesize of output 13 [2022-11-16 08:24:50,839 INFO L350 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 22 treesize of output 21 [2022-11-16 08:24:50,905 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:24:50,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:24:50,911 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:24:50,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:24:50,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 63 states and 417 transitions. [2022-11-16 08:24:50,970 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 417 transitions. [2022-11-16 08:24:50,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:24:50,970 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:24:50,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:24:51,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:24:51,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-16 08:24:51,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:24:51,068 INFO L350 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 10 treesize of output 8 [2022-11-16 08:24:51,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:24:51,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:24:51,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:24:51,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:24:51,235 INFO L350 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 14 treesize of output 13 [2022-11-16 08:24:51,239 INFO L350 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 22 treesize of output 21 [2022-11-16 08:24:51,325 INFO L350 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 27 treesize of output 11 [2022-11-16 08:24:51,330 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:24:51,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:24:51,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 63 states and 417 transitions. [2022-11-16 08:24:51,382 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 417 transitions. [2022-11-16 08:24:51,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:24:51,383 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:24:51,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:24:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:24:51,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:24:51,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:24:51,482 INFO L350 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 10 treesize of output 8 [2022-11-16 08:24:51,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:24:51,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:24:51,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:24:51,595 INFO L350 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 14 treesize of output 13 [2022-11-16 08:24:51,599 INFO L350 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 22 treesize of output 21 [2022-11-16 08:24:51,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:24:51,643 INFO L350 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 27 treesize of output 11 [2022-11-16 08:24:51,648 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:24:51,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:24:51,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 63 states and 417 transitions. [2022-11-16 08:24:51,702 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 417 transitions. [2022-11-16 08:24:51,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:24:51,703 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:24:51,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:24:51,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:24:51,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-16 08:24:51,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:24:51,799 INFO L350 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 10 treesize of output 8 [2022-11-16 08:24:51,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:24:51,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:24:51,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:24:51,898 INFO L350 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 12 treesize of output 11 [2022-11-16 08:24:51,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:24:51,965 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:24:51,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:24:51,971 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:24:52,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:24:52,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:24:52,038 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:24:52,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:24:52,039 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:24:52,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:24:52,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:24:52,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:24:52,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:24:52,144 INFO L350 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 10 treesize of output 8 [2022-11-16 08:24:52,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:24:52,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:24:52,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:24:52,257 INFO L350 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 12 treesize of output 11 [2022-11-16 08:24:52,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:24:52,306 INFO L350 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 27 treesize of output 11 [2022-11-16 08:24:52,311 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:24:52,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:24:52,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:24:52,363 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:24:52,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:24:52,363 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:24:52,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:24:52,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:24:52,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 08:24:52,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:24:52,462 INFO L350 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 10 treesize of output 8 [2022-11-16 08:24:52,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:24:52,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:24:52,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:24:52,583 INFO L350 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 12 treesize of output 11 [2022-11-16 08:24:52,587 INFO L350 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 22 treesize of output 21 [2022-11-16 08:24:52,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:24:52,637 INFO L350 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 27 treesize of output 11 [2022-11-16 08:24:52,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:24:52,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:24:52,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:24:52,700 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:24:52,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:24:52,700 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:24:52,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:24:52,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:24:52,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:24:52,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:24:52,796 INFO L350 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 10 treesize of output 8 [2022-11-16 08:24:52,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:24:52,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:24:52,922 INFO L350 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 12 treesize of output 11 [2022-11-16 08:24:52,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:24:52,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:24:52,975 INFO L350 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 27 treesize of output 11 [2022-11-16 08:24:52,980 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:24:53,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:24:53,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:24:53,035 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:24:53,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:24:53,035 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:24:53,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:24:53,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:24:53,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 08:24:53,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:24:53,130 INFO L350 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 10 treesize of output 8 [2022-11-16 08:24:53,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:24:53,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:24:53,451 INFO L350 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 12 treesize of output 11 [2022-11-16 08:24:53,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:24:53,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:24:53,525 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:24:53,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:24:53,531 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:24:53,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:24:53,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:24:53,590 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:24:53,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:24:53,590 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:24:53,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:24:53,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:24:53,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:24:53,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:24:53,689 INFO L350 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 10 treesize of output 8 [2022-11-16 08:24:53,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:24:53,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:24:53,814 INFO L350 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 12 treesize of output 11 [2022-11-16 08:24:53,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:24:53,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:24:53,873 INFO L350 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 27 treesize of output 11 [2022-11-16 08:24:53,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:24:53,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:24:53,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:24:53,932 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:24:53,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:24:53,932 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:24:53,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:24:54,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:24:54,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-16 08:24:54,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:24:54,065 INFO L350 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 10 treesize of output 8 [2022-11-16 08:24:54,167 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:24:54,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:24:54,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:24:54,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:24:54,183 INFO L350 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 12 treesize of output 11 [2022-11-16 08:24:54,187 INFO L350 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 22 treesize of output 21 [2022-11-16 08:24:54,226 INFO L350 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 27 treesize of output 11 [2022-11-16 08:24:54,230 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:24:54,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:24:54,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:24:54,275 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:24:54,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:24:54,275 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:24:54,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:24:54,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:24:54,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:24:54,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:24:54,375 INFO L350 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 10 treesize of output 8 [2022-11-16 08:24:54,474 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:24:54,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:24:54,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:24:54,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:24:54,492 INFO L350 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 14 treesize of output 13 [2022-11-16 08:24:54,496 INFO L350 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 22 treesize of output 21 [2022-11-16 08:24:54,537 INFO L350 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 27 treesize of output 11 [2022-11-16 08:24:54,542 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:24:54,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:24:54,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:24:54,588 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:24:54,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:24:54,588 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:24:54,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:24:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:24:54,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 08:24:54,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:24:54,683 INFO L350 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 10 treesize of output 8 [2022-11-16 08:24:54,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:24:54,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:24:54,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:24:54,806 INFO L350 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 12 treesize of output 11 [2022-11-16 08:24:54,810 INFO L350 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 22 treesize of output 21 [2022-11-16 08:24:54,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:24:54,857 INFO L350 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 27 treesize of output 11 [2022-11-16 08:24:54,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:24:54,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:24:54,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:24:54,909 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:24:54,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:24:54,909 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:24:54,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:24:54,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:24:54,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-16 08:24:54,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:24:55,005 INFO L350 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 10 treesize of output 8 [2022-11-16 08:24:55,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:24:55,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:24:55,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:24:55,105 INFO L350 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 14 treesize of output 13 [2022-11-16 08:24:55,109 INFO L350 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 22 treesize of output 21 [2022-11-16 08:24:55,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:24:55,178 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:24:55,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:24:55,184 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:24:55,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:24:55,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:24:55,234 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:24:55,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:24:55,234 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:24:55,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:24:55,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:24:55,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-16 08:24:55,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:24:55,329 INFO L350 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 10 treesize of output 8 [2022-11-16 08:24:55,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:24:55,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:24:55,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:24:55,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:24:55,438 INFO L350 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 14 treesize of output 13 [2022-11-16 08:24:55,441 INFO L350 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 22 treesize of output 21 [2022-11-16 08:24:55,507 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:24:55,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:24:55,512 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:24:55,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:24:55,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:24:55,562 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:24:55,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:24:55,562 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:24:55,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:24:55,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:24:55,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:24:55,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:24:55,658 INFO L350 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 10 treesize of output 8 [2022-11-16 08:24:55,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:24:55,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:24:55,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:24:55,794 INFO L350 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 12 treesize of output 13 [2022-11-16 08:24:55,800 INFO L350 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 12 treesize of output 11 [2022-11-16 08:24:55,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:24:55,867 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:24:55,884 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:24:55,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:24:55,890 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:24:55,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:24:55,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:24:55,928 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:24:55,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:24:55,928 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:24:55,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:24:55,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:24:55,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-16 08:24:56,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:24:56,027 INFO L350 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 10 treesize of output 8 [2022-11-16 08:24:56,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:24:56,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:24:56,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:24:56,147 INFO L350 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 12 treesize of output 11 [2022-11-16 08:24:56,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:24:56,224 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:24:56,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:24:56,229 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:24:56,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:24:56,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:24:56,282 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:24:56,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:24:56,282 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:24:56,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:24:56,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:24:56,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-16 08:24:56,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:24:56,384 INFO L350 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 10 treesize of output 8 [2022-11-16 08:24:56,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:24:56,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:24:56,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:24:56,502 INFO L350 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 12 treesize of output 11 [2022-11-16 08:24:56,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:24:56,583 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:24:56,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:24:56,589 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:24:56,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:24:56,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:24:56,639 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:24:56,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:24:56,640 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:24:56,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:24:56,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:24:56,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 08:24:56,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:24:56,744 INFO L350 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 10 treesize of output 8 [2022-11-16 08:24:56,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:24:56,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:24:56,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:24:56,889 INFO L350 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 14 treesize of output 13 [2022-11-16 08:24:56,894 INFO L350 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 22 treesize of output 21 [2022-11-16 08:24:56,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:24:56,991 INFO L350 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 27 treesize of output 11 [2022-11-16 08:24:56,995 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:24:57,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:24:57,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:24:57,032 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:24:57,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:24:57,032 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:24:57,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:24:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:24:57,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:24:57,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:24:57,128 INFO L350 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 10 treesize of output 8 [2022-11-16 08:24:57,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:24:57,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:24:57,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:24:57,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:24:57,245 INFO L350 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 12 treesize of output 11 [2022-11-16 08:24:57,249 INFO L350 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 22 treesize of output 21 [2022-11-16 08:24:57,291 INFO L350 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 27 treesize of output 11 [2022-11-16 08:24:57,295 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:24:57,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:24:57,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:24:57,331 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:24:57,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:24:57,332 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:24:57,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:24:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:24:57,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-16 08:24:57,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:24:57,424 INFO L350 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 10 treesize of output 8 [2022-11-16 08:24:57,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:24:57,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:24:57,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:24:57,580 INFO L350 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 12 treesize of output 11 [2022-11-16 08:24:57,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:24:57,626 INFO L350 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 27 treesize of output 11 [2022-11-16 08:24:57,630 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:24:57,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:24:57,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:24:57,670 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:24:57,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:24:57,670 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:24:57,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:24:57,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:24:57,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:24:57,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:24:57,770 INFO L350 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 10 treesize of output 8 [2022-11-16 08:24:57,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:24:57,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:24:57,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:24:57,885 INFO L350 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 12 treesize of output 11 [2022-11-16 08:24:57,889 INFO L350 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 22 treesize of output 21 [2022-11-16 08:24:57,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:24:57,939 INFO L350 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 27 treesize of output 11 [2022-11-16 08:24:57,943 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:24:57,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:24:57,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:24:57,981 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:24:57,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:24:57,981 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:24:57,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:24:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:24:58,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:24:58,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:24:58,077 INFO L350 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 10 treesize of output 8 [2022-11-16 08:24:58,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:24:58,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:24:58,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:24:58,201 INFO L350 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 14 treesize of output 13 [2022-11-16 08:24:58,205 INFO L350 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 22 treesize of output 21 [2022-11-16 08:24:58,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:24:58,255 INFO L350 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 27 treesize of output 11 [2022-11-16 08:24:58,259 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:24:58,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:24:58,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:24:58,298 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:24:58,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:24:58,298 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:24:58,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:24:58,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:24:58,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-16 08:24:58,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:24:58,392 INFO L350 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 10 treesize of output 8 [2022-11-16 08:24:58,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:24:58,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:24:58,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:24:58,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:24:58,501 INFO L350 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 12 treesize of output 11 [2022-11-16 08:24:58,504 INFO L350 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 22 treesize of output 21 [2022-11-16 08:24:58,572 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:24:58,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:24:58,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:24:58,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:24:58,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:24:58,628 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:24:58,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:24:58,629 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:24:58,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:24:58,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:24:58,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-16 08:24:58,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:24:58,724 INFO L350 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 10 treesize of output 8 [2022-11-16 08:24:58,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:24:58,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:24:58,829 INFO L350 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 12 treesize of output 11 [2022-11-16 08:24:58,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:24:58,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:24:58,903 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:24:58,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:24:58,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:24:58,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:24:58,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:24:58,958 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:24:58,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:24:58,958 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:24:58,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:24:59,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:24:59,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:24:59,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:24:59,054 INFO L350 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 10 treesize of output 8 [2022-11-16 08:24:59,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:24:59,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:24:59,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:24:59,195 INFO L350 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 12 treesize of output 11 [2022-11-16 08:24:59,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:24:59,245 INFO L350 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 27 treesize of output 11 [2022-11-16 08:24:59,250 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:24:59,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:24:59,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:24:59,289 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:24:59,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:24:59,290 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:24:59,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:24:59,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:24:59,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-16 08:24:59,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:24:59,384 INFO L350 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 10 treesize of output 8 [2022-11-16 08:24:59,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:24:59,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:24:59,494 INFO L350 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 12 treesize of output 11 [2022-11-16 08:24:59,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:24:59,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:24:59,572 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:24:59,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:24:59,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:24:59,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:24:59,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:24:59,626 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:24:59,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:24:59,626 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:24:59,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:24:59,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:24:59,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-16 08:24:59,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:24:59,747 INFO L350 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 10 treesize of output 8 [2022-11-16 08:24:59,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:24:59,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:24:59,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:24:59,842 INFO L350 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 12 treesize of output 11 [2022-11-16 08:24:59,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:24:59,906 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:24:59,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:24:59,912 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:24:59,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:24:59,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:24:59,964 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:24:59,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:24:59,964 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:24:59,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:00,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:00,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-16 08:25:00,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:00,059 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:00,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:00,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:00,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:00,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:00,381 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:00,384 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:00,446 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:00,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:00,452 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:00,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:00,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:00,502 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:00,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:00,502 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:00,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:00,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:00,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 08:25:00,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:00,597 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:00,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:00,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:00,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:00,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:00,720 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:00,724 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:00,765 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:00,770 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:00,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:00,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:00,821 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:00,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:00,821 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:00,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:00,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:00,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:25:00,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:00,918 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:01,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:01,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:01,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:01,041 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:01,045 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:01,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:01,096 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:01,101 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:01,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:01,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:01,145 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:01,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:01,146 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:01,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:01,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:01,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 08:25:01,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:01,237 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:01,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:01,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:01,553 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:01,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:01,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:01,627 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:01,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:01,633 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:01,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:01,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:01,682 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:01,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:01,682 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:01,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:01,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:01,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-16 08:25:01,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:01,790 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:01,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:01,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:01,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:01,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:01,918 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:01,923 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:02,000 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:02,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:02,007 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:02,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:02,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:02,070 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:02,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:02,070 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:02,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:02,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 08:25:02,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:02,177 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:02,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:02,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:02,293 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:02,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:02,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:02,351 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:02,356 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:02,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:02,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:02,404 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:02,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:02,404 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:02,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:02,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:02,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-16 08:25:02,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:02,511 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:02,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:02,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:02,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:25:02,647 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:02,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:25:02,720 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:25:02,738 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:25:02,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:25:02,744 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:02,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:02,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:02,792 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:02,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:02,792 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:02,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:02,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:02,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:25:02,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:02,914 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:03,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:03,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:03,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:03,030 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:03,034 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:03,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:03,078 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:03,083 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:03,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:03,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:03,127 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:03,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:03,128 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:03,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:03,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:03,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:25:03,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:03,233 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:03,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:03,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:03,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:03,355 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:03,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:03,399 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:03,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:03,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:03,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:03,441 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:03,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:03,441 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:03,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:03,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:03,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-16 08:25:03,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:03,532 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:03,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:03,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:03,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:03,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:03,641 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:03,645 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:03,707 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:03,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:03,712 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:03,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:03,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:03,762 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:03,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:03,762 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:03,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:03,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:03,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:25:03,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:03,868 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:03,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:03,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:03,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:03,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:03,984 INFO L350 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 14 treesize of output 13 [2022-11-16 08:25:03,989 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:04,034 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:04,039 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:04,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:04,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:04,076 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:04,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:04,076 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:04,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:04,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:04,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-16 08:25:04,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:04,172 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:04,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:04,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:04,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:04,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:04,493 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:04,497 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:04,562 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:04,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:04,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:04,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:04,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:04,615 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:04,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:04,615 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:04,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:04,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:04,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-16 08:25:04,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:04,716 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:04,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:04,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:04,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:04,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:04,824 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:04,828 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:04,894 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:04,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:04,900 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:04,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:04,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:04,949 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:04,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:04,949 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:04,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:05,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:05,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:25:05,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:05,051 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:05,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:05,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:05,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:05,187 INFO L350 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 14 treesize of output 13 [2022-11-16 08:25:05,192 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:05,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:05,243 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:05,248 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:05,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:05,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:05,287 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:05,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:05,288 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:05,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:05,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:05,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-16 08:25:05,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:05,386 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:05,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:05,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:05,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:05,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:05,510 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:05,514 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:05,583 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:05,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:05,589 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:05,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:05,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:05,638 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:05,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:05,639 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:05,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:05,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:05,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-16 08:25:05,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:05,769 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:05,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:05,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:05,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:05,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:05,875 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:05,879 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:05,938 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:05,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:05,944 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:05,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:05,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:05,995 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:05,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:05,995 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:05,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:06,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:06,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-16 08:25:06,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:06,098 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:06,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:06,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:06,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:06,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:06,212 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:06,215 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:06,279 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:06,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:06,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:06,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:06,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:06,334 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:06,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:06,334 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:06,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:06,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-16 08:25:06,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:06,450 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:06,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:06,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:06,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:25:06,586 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:06,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:25:06,652 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:25:06,670 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:25:06,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:25:06,675 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:06,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:06,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:06,715 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:06,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:06,716 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:06,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:06,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 08:25:06,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:06,821 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:07,141 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:25:07,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:07,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:07,152 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:07,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:07,222 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:07,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:07,228 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:07,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:07,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:07,278 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:07,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:07,278 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:07,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:07,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:07,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:25:07,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:07,383 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:07,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:07,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:07,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:07,503 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:07,507 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:07,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:07,559 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:07,564 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:07,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:07,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:07,601 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:07,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:07,601 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:07,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:07,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:07,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-16 08:25:07,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:07,701 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:08,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:08,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:08,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:08,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:08,030 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:08,034 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:08,099 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:08,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:08,105 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:08,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:08,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:08,154 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:08,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:08,154 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:08,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:08,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:08,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:25:08,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:08,257 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:08,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:08,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:08,382 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:08,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:08,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:08,440 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:08,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:08,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:08,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:08,483 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:08,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:08,484 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:08,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:08,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:08,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-16 08:25:08,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:08,582 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:08,679 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:25:08,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:08,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:08,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:08,695 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:08,699 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:08,768 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:08,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:08,773 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:08,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:08,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:08,827 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:08,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:08,828 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:08,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:08,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:08,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-16 08:25:08,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:08,956 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:09,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:09,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:09,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:25:09,117 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:09,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:25:09,190 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:09,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 38 treesize of output 20 [2022-11-16 08:25:09,195 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:09,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:09,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:09,245 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:09,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:09,246 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:09,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:09,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:25:09,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:09,351 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:09,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:09,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:09,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:09,457 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:09,461 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:09,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:09,510 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:09,515 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:09,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:09,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:09,552 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:09,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:09,552 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:09,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:09,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:09,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 08:25:09,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:09,652 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:09,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:09,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:09,763 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:09,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:09,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:09,816 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:09,821 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:09,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:09,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:09,859 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:09,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:09,859 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:09,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:09,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:09,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-16 08:25:09,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:09,958 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:10,047 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:25:10,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:10,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:10,058 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:10,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:10,126 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:10,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:10,131 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:10,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:10,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:10,183 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:10,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:10,184 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:10,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:10,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:10,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:25:10,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:10,284 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:10,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:10,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:10,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:10,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:10,403 INFO L350 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 14 treesize of output 13 [2022-11-16 08:25:10,408 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:10,457 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:10,462 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:10,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:10,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:10,498 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:10,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:10,498 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:10,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:10,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:10,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:25:10,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:10,604 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:10,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:10,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:10,723 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:10,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:10,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:10,781 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:10,786 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:10,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:10,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:10,824 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:10,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:10,824 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:10,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:10,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:10,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-16 08:25:10,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:10,920 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:11,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:11,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:11,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:11,249 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:11,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:11,319 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:11,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:11,325 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:11,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:11,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:11,373 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:11,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:11,373 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:11,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:11,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:11,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:25:11,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:11,473 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:11,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:11,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:11,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:11,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:11,610 INFO L350 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 14 treesize of output 13 [2022-11-16 08:25:11,615 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:11,665 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:11,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:11,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:11,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:11,708 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:11,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:11,708 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:11,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:11,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 08:25:11,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:11,846 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:11,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:11,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:11,954 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:11,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:11,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:12,001 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:12,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:12,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:12,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:12,044 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:12,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:12,044 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:12,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:12,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-16 08:25:12,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:12,141 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:12,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:12,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:12,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:12,453 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:12,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:12,518 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:12,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:12,523 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:12,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:12,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:12,574 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:12,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:12,574 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:12,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:12,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:12,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-16 08:25:12,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:12,673 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:12,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:12,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:12,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:12,777 INFO L350 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 14 treesize of output 13 [2022-11-16 08:25:12,780 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:12,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:12,848 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:12,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:12,854 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:12,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:12,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:12,902 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:12,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:12,902 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:12,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:12,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:12,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-16 08:25:12,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:13,001 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:13,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:13,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:25:13,123 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:13,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:25:13,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:13,199 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:25:13,219 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:25:13,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:25:13,225 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:13,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:13,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:13,263 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:13,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:13,263 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:13,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:13,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:13,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-16 08:25:13,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:13,358 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:13,452 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:25:13,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:13,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:13,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:13,466 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:13,470 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:13,546 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:13,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:13,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:13,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:13,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:13,606 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:13,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:13,606 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:13,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:13,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:13,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-16 08:25:13,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:13,699 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:14,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:14,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:14,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:14,019 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:14,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:14,091 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:14,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:14,096 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:14,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:14,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:14,146 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:14,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:14,146 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:14,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:14,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:14,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-16 08:25:14,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:14,245 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:14,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:14,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:14,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:14,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:14,359 INFO L350 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 14 treesize of output 13 [2022-11-16 08:25:14,363 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:14,430 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:14,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:14,435 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:14,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:14,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:14,483 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:14,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:14,484 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:14,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:14,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:14,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-16 08:25:14,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:14,582 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:14,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:14,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:25:14,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:25:14,754 INFO L350 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 12 treesize of output 13 [2022-11-16 08:25:14,759 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:14,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:14,839 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:14,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 38 treesize of output 20 [2022-11-16 08:25:14,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:14,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:14,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:14,895 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:14,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:14,895 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:14,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:14,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:14,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-16 08:25:14,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:15,012 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:15,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:15,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:15,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:15,114 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:15,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:15,178 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:15,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:15,184 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:15,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:15,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:15,230 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:15,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:15,231 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:15,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:15,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:15,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 08:25:15,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:15,327 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:15,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:15,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:15,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:15,645 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:15,648 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:15,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:15,715 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:15,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:15,720 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:15,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:15,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:15,766 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:15,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:15,766 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:15,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:15,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:25:15,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:15,869 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:15,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:15,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:15,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:15,975 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:15,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:16,024 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:16,028 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:16,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:16,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:16,067 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:16,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:16,067 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:16,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:16,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:16,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:25:16,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:16,172 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:16,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:16,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:16,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:16,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:16,296 INFO L350 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 14 treesize of output 13 [2022-11-16 08:25:16,300 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:16,345 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:16,350 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:16,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:16,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:16,387 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:16,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:16,388 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:16,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:16,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:16,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-16 08:25:16,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:16,485 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:16,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:16,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:16,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:16,587 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:16,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:16,655 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:16,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:16,660 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:16,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:16,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:16,709 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:16,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:16,710 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:16,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:16,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:16,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:25:16,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:16,812 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:16,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:16,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:16,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:16,930 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:16,934 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:16,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:16,986 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:16,991 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:17,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:17,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:17,028 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:17,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:17,028 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:17,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:17,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:17,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 08:25:17,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:17,132 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:17,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:17,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:17,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:17,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:17,258 INFO L350 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 14 treesize of output 13 [2022-11-16 08:25:17,263 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:17,311 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:17,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:17,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:17,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:17,354 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:17,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:17,354 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:17,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:17,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:17,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:25:17,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:17,452 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:17,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:17,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:17,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:17,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:17,596 INFO L350 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 14 treesize of output 13 [2022-11-16 08:25:17,601 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:17,649 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:17,654 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:17,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:17,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:17,694 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:17,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:17,694 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:17,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:17,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:17,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:25:17,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:17,824 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:17,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:17,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:17,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:17,931 INFO L350 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 14 treesize of output 13 [2022-11-16 08:25:17,934 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:17,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:17,984 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:17,989 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:18,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:18,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:18,025 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:18,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:18,025 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:18,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:18,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:18,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 08:25:18,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:18,123 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:18,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:18,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:18,232 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:18,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:18,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:18,285 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:18,289 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:18,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:18,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:18,325 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:18,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:18,325 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:18,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:18,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:18,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-16 08:25:18,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:18,422 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:18,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:18,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:18,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:18,523 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:18,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:18,590 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:18,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:18,595 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:18,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:18,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:18,643 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:18,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:18,643 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:18,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:18,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:18,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:25:18,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:18,741 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:18,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:18,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:25:18,866 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:18,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:25:18,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:18,937 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:25:18,953 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:25:18,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:25:18,959 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:18,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:18,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:18,998 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:18,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:18,998 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:18,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:19,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:19,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 08:25:19,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:19,100 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:19,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:19,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:19,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:19,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:19,411 INFO L350 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 14 treesize of output 13 [2022-11-16 08:25:19,415 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:19,482 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:19,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:19,487 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:19,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:19,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:19,535 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:19,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:19,535 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:19,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:19,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:19,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:25:19,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:19,633 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:19,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:19,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:19,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:19,763 INFO L350 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 14 treesize of output 13 [2022-11-16 08:25:19,768 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:19,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:19,817 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:19,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:19,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:19,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:19,861 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:19,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:19,861 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:19,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:19,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:19,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:25:19,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:19,960 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:20,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:20,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:20,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:20,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:20,097 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:20,102 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:20,150 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:20,155 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:20,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:20,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:20,194 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:20,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:20,194 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:20,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:20,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-16 08:25:20,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:20,299 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:20,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:20,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:20,400 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:20,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:20,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:20,478 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:20,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:20,483 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:20,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:20,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:20,531 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:20,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:20,531 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:20,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:20,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:20,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-16 08:25:20,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:20,674 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:20,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:20,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:20,765 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:20,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:20,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:20,834 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:20,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:20,840 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:20,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:20,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:20,889 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:20,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:20,890 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:20,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:20,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:20,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 08:25:20,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:21,007 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:21,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:21,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:21,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:21,326 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:21,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:21,390 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:21,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:21,396 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:21,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:21,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:21,446 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:21,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:21,446 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:21,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:21,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:25:21,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:21,545 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:21,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:21,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:21,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:21,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:21,662 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:21,666 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:21,713 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:21,717 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:21,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:21,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:21,755 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:21,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:21,756 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:21,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:21,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:21,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-16 08:25:21,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:21,852 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:21,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:21,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:21,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:21,956 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:21,960 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:21,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:22,026 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:22,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:22,031 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:22,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:22,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:22,077 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:22,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:22,077 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:22,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:22,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:22,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:25:22,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:22,183 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:22,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:22,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:22,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:22,299 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:22,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:22,351 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:22,355 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:22,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:22,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:22,397 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:22,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:22,397 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:22,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:22,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:25:22,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:22,493 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:22,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:22,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:22,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:22,616 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:22,621 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:22,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:22,673 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:22,678 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:22,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:22,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:22,717 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:22,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:22,717 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:22,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:22,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:22,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:25:22,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:22,826 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:22,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:22,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:25:22,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:25:22,961 INFO L350 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 12 treesize of output 13 [2022-11-16 08:25:22,966 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:22,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:23,036 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:25:23,053 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:25:23,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:25:23,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:23,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:23,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:23,099 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:23,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:23,099 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:23,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:23,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:23,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-16 08:25:23,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:23,200 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:23,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:23,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:23,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:23,308 INFO L350 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 14 treesize of output 13 [2022-11-16 08:25:23,312 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:23,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:23,384 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:23,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:23,389 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:23,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:23,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:23,438 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:23,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:23,438 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:23,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:23,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 08:25:23,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:23,574 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:23,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:23,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:23,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:23,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:23,687 INFO L350 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 14 treesize of output 13 [2022-11-16 08:25:23,691 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:23,729 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:23,734 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:23,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:23,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:23,771 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:23,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:23,771 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:23,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:23,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-16 08:25:23,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:23,865 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:23,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:23,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:23,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:23,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:24,006 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:24,011 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:24,063 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:24,069 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:24,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:24,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:24,122 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:24,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:24,123 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:24,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:24,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:24,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-16 08:25:24,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:24,233 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:24,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:24,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:24,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:24,343 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:24,347 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:24,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:24,414 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:24,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:24,420 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:24,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:24,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:24,464 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:24,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:24,464 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:24,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:24,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-16 08:25:24,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:24,560 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:24,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:24,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:24,661 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:24,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:24,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:24,734 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:24,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:24,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:24,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:24,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:24,788 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:24,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:24,789 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:24,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:24,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:24,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-16 08:25:24,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:24,895 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:24,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:25,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:25,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:25,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:25,016 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:25,020 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:25,067 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:25,072 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:25,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:25,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:25,113 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:25,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:25,113 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:25,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:25,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:25,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-16 08:25:25,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:25,209 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:25,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:25,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:25,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:25,323 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:25,327 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:25,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:25,398 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:25,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:25,403 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:25,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:25,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:25,455 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:25,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:25,456 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:25,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:25,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:25:25,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:25,560 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:25,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:25,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:25,671 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:25,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:25,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:25,734 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:25,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:25,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:25,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:25,775 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:25,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:25,775 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:25,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:25,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:25,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-16 08:25:25,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:25,872 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:25,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:25,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:25,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:25,988 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:25,992 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:26,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:26,064 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:26,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:26,069 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:26,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:26,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:26,116 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:26,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:26,116 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:26,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:26,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 08:25:26,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:26,266 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:26,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:26,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:26,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:26,381 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:26,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:26,424 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:26,429 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:26,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:26,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:26,470 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:26,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:26,470 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:26,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:26,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-16 08:25:26,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:26,566 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:26,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:26,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:26,662 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:26,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:26,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:26,731 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:26,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:26,736 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:26,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:26,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:26,785 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:26,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:26,785 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:26,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:26,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:26,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:25:26,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:26,885 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:26,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:26,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:26,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:26,982 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:26,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:27,040 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:25:27,046 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-16 08:25:27,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 14 [2022-11-16 08:25:27,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:27,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:27,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:27,091 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:27,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:27,091 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:27,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:27,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 08:25:27,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:27,187 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:27,291 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:25:27,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:27,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:27,304 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:27,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:27,353 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:27,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:27,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:27,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:27,396 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:27,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:27,396 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:27,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:27,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:27,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-16 08:25:27,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:27,488 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:27,584 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:25:27,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:27,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:27,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:27,599 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:27,603 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:27,666 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:27,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:27,671 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:27,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:27,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:27,722 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:27,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:27,723 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:27,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:27,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:27,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-16 08:25:27,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:27,825 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:27,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:27,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:25:27,984 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:27,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:25:28,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:28,067 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:28,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 38 treesize of output 20 [2022-11-16 08:25:28,072 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:28,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:28,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:28,119 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:28,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:28,119 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:28,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:28,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:28,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:25:28,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:28,225 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:28,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:28,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:28,337 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:28,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:28,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:28,401 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:28,406 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:28,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:28,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:28,443 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:28,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:28,444 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:28,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:28,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:25:28,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:28,558 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:28,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:28,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:28,677 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:28,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:28,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:28,743 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:28,748 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:28,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:28,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:28,786 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:28,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:28,786 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:28,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:28,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:28,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:25:28,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:28,885 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:29,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:29,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:29,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:29,051 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:29,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:29,099 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:29,104 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:29,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:29,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:29,143 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:29,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:29,143 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:29,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:29,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:29,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-16 08:25:29,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:29,239 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:29,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:29,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:29,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:29,342 INFO L350 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 14 treesize of output 13 [2022-11-16 08:25:29,346 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:29,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:29,412 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:29,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:29,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:29,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:29,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:29,468 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:29,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:29,468 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:29,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:29,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:29,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 08:25:29,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:29,575 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:29,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:29,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:29,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:29,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:29,695 INFO L350 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 14 treesize of output 13 [2022-11-16 08:25:29,699 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:29,741 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:29,746 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:29,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:29,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:29,785 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:29,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:29,785 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:29,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:29,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:25:29,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:29,888 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:29,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:29,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:30,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:30,010 INFO L350 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 14 treesize of output 13 [2022-11-16 08:25:30,014 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:30,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:30,066 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:30,071 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:30,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:30,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:30,111 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:30,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:30,111 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:30,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:30,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 08:25:30,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:30,216 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:30,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:30,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:30,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:30,336 INFO L350 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 14 treesize of output 13 [2022-11-16 08:25:30,341 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:30,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:30,394 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:30,399 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:30,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:30,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:30,437 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:30,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:30,437 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:30,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:30,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:30,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:25:30,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:30,539 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:30,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:30,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:30,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:30,672 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:30,676 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:30,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:30,731 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:30,736 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:30,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:30,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:30,775 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:30,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:30,776 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:30,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:30,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-16 08:25:30,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:30,879 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:30,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:30,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:30,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:30,991 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:30,995 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:31,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:31,083 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:31,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:31,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:31,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:31,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:31,143 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:31,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:31,143 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:31,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:31,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:31,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-16 08:25:31,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:31,247 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:31,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:31,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:31,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:31,384 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:31,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:31,442 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:31,447 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:31,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:31,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:31,484 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:31,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:31,484 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:31,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:31,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:31,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-16 08:25:31,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:31,582 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:31,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:31,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:31,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:31,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:31,747 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:31,751 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:31,813 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:31,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:31,818 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:31,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:31,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:31,870 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:31,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:31,871 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:31,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:31,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:31,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-16 08:25:31,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:31,966 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:32,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:32,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:32,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:32,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:32,284 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:32,287 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:32,350 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:32,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:32,355 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:32,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:32,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:32,404 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:32,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:32,405 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:32,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:32,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:25:32,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:32,505 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:32,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:32,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:32,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:32,619 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:32,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:32,665 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:32,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:32,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:32,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:32,708 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:32,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:32,708 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:32,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:32,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:32,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-16 08:25:32,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:32,808 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:32,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:32,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:32,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:32,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:32,917 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:32,921 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:32,983 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:32,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:32,988 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:33,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:33,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:33,037 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:33,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:33,037 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:33,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:33,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-16 08:25:33,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:33,132 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:33,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:33,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:33,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:33,460 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:33,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:33,527 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:33,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:33,533 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:33,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:33,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:33,581 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:33,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:33,581 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:33,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:33,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:33,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-16 08:25:33,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:33,682 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:33,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:33,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:33,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:33,785 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:33,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:33,855 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:33,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:33,860 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:33,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:33,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:33,908 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:33,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:33,908 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:33,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:33,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:33,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-16 08:25:33,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:34,012 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:34,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:34,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:34,321 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:34,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:34,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:34,398 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:34,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:34,403 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:34,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:34,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:34,451 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:34,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:34,452 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:34,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:34,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:34,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-16 08:25:34,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:34,545 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:34,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:34,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:34,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:34,657 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:34,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:34,729 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:34,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:34,735 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:34,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:34,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:34,782 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:34,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:34,782 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:34,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:34,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:34,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:25:34,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:34,907 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:34,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:35,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:35,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:35,012 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:35,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:35,059 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:35,063 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:35,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:35,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:35,101 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:35,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:35,101 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:35,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:35,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:35,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-16 08:25:35,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:35,204 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:35,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:35,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:35,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:25:35,327 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:35,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:25:35,389 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:25:35,406 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:25:35,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:25:35,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:35,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:35,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:35,453 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:35,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:35,453 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:35,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:35,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-16 08:25:35,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:35,549 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:35,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:35,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:35,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:35,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:35,654 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:35,658 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:35,722 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:35,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:35,728 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:35,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:35,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:35,776 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:35,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:35,776 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:35,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:35,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:35,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-16 08:25:35,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:35,875 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:35,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:35,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:25:35,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:25:36,003 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:36,009 INFO L350 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 12 treesize of output 13 [2022-11-16 08:25:36,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:36,075 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:25:36,092 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:25:36,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:25:36,098 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:36,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:36,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:36,217 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:36,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:36,217 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:36,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:36,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:36,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-16 08:25:36,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:36,317 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:36,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:36,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:36,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:36,419 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:36,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:36,489 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:36,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:36,494 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:36,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:36,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:36,610 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:36,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:36,610 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:36,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:36,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-16 08:25:36,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:36,711 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:36,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:36,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:36,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:36,819 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:36,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:36,890 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:36,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:36,895 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:37,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:37,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:37,010 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:37,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:37,010 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:37,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:37,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:37,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-16 08:25:37,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:37,105 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:37,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:37,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:37,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:37,255 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:37,258 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:37,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:37,322 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:37,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:37,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:37,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:37,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:37,442 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:37,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:37,442 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:37,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:37,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:37,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-16 08:25:37,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:37,541 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:37,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:37,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:37,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:37,692 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:37,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:37,740 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:37,745 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:37,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:37,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:37,856 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:37,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:37,856 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:37,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:37,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 08:25:37,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:37,956 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:38,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:38,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:38,067 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:38,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:38,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:38,122 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:38,126 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:38,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:38,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:38,235 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:38,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:38,235 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:38,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:38,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:38,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:25:38,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:38,336 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:38,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:38,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:38,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:38,448 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:38,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:38,502 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:38,506 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:38,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:38,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:38,614 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:38,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:38,614 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:38,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:38,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:38,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-16 08:25:38,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:38,707 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:38,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:38,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:38,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:38,814 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:38,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:38,881 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:38,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:38,886 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:39,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:39,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:39,001 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:39,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:39,002 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:39,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:39,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:25:39,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:39,102 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:39,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:39,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:39,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:39,229 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:39,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:39,280 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:39,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:39,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:39,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:39,428 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:39,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:39,428 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:39,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:39,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:39,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-16 08:25:39,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:39,531 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:39,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:39,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:39,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:25:39,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:25:39,650 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:39,655 INFO L350 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 12 treesize of output 13 [2022-11-16 08:25:39,713 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:25:39,730 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:25:39,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:25:39,735 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:39,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:39,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:39,848 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:39,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:39,848 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:39,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:39,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:39,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-16 08:25:39,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:39,943 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:40,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:40,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:40,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:40,046 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:40,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:40,111 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:40,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:40,116 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:40,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:40,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:40,233 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:40,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:40,233 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:40,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:40,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-16 08:25:40,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:40,332 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:40,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:40,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:25:40,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:25:40,458 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:40,463 INFO L350 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 12 treesize of output 13 [2022-11-16 08:25:40,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:40,528 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:25:40,545 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:25:40,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:25:40,551 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:40,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:40,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:40,664 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:40,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:40,665 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:40,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:40,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:40,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:25:40,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:40,773 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:40,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:40,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:40,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:40,886 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:40,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:40,937 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:40,942 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:41,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:41,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:41,064 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:41,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:41,064 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:41,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:41,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:41,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:25:41,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:41,166 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:41,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:41,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:41,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:41,291 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:41,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:41,341 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:41,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:41,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:41,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:41,491 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:41,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:41,491 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:41,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:41,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:41,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-16 08:25:41,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:41,591 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:41,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:41,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:41,684 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:41,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:41,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:41,753 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:41,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:41,758 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:41,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:41,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:41,876 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:41,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:41,877 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:41,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:41,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:25:41,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:41,977 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:42,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:42,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:42,086 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:42,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:42,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:42,138 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:42,143 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:42,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:42,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:42,259 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:42,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:42,260 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:42,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:42,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:42,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:25:42,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:42,357 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:42,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:42,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:42,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:42,474 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:42,478 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:42,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:42,536 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:42,542 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:42,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:42,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:42,719 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:42,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:42,719 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:42,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:42,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 08:25:42,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:42,847 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:42,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:42,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:42,956 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:42,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:42,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:43,032 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:25:43,039 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-16 08:25:43,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 14 [2022-11-16 08:25:43,046 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:43,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:43,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:43,168 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:43,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:43,168 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:43,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:43,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:43,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-16 08:25:43,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:43,264 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:43,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:43,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:43,364 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:43,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:43,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:43,440 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:43,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:43,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:43,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:43,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:43,601 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:43,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:43,601 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:43,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:43,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:43,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:25:43,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:43,707 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:43,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:43,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:43,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:43,830 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:43,834 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:43,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:43,881 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:43,885 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:44,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:44,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:44,000 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:44,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:44,001 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:44,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:44,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:44,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-16 08:25:44,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:44,105 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:44,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:44,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:44,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:44,211 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:44,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:44,260 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:44,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:44,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:44,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:44,382 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:44,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:44,383 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:44,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:44,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:44,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:25:44,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:44,480 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:44,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:44,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:44,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:44,600 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:44,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:44,657 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:44,663 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:44,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:44,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:44,780 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:44,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:44,780 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:44,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:44,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-16 08:25:44,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:44,877 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:44,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:44,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:44,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:44,984 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:44,987 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:44,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:45,055 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:45,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:45,060 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:45,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:45,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:45,179 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:45,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:45,180 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:45,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:45,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:45,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-16 08:25:45,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:45,284 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:45,424 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:25:45,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:45,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:45,438 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:45,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:45,490 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:45,495 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:45,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:45,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:45,645 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:45,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:45,645 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:45,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:45,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-16 08:25:45,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:45,740 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:45,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:45,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:45,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:45,841 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:45,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:45,907 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:45,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:45,912 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:46,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:46,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:46,032 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:46,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:46,032 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:46,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:46,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:46,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:25:46,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:46,134 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:46,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:46,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:46,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:46,447 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:46,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:46,514 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:46,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:46,519 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:46,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:46,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:46,641 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:46,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:46,641 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:46,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:46,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:46,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-16 08:25:46,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:46,741 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:46,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:46,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:46,852 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:46,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:46,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:46,905 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:46,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:47,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:47,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:47,033 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:47,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:47,034 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:47,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:47,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:47,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:25:47,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:47,134 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:47,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:47,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:47,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:47,250 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:47,254 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:47,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:47,304 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:47,309 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:47,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:47,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:47,431 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:47,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:47,431 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:47,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:47,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-16 08:25:47,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:47,535 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:47,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:47,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:47,634 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:47,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:47,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:47,708 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:47,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:47,713 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:47,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:47,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:47,868 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:47,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:47,868 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:47,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:47,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:47,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:25:47,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:47,962 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:48,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:48,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:48,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:48,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:48,081 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:48,085 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:48,127 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:48,132 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:48,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:48,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:48,256 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:48,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:48,257 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:48,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:48,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:48,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:25:48,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:48,357 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:48,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:48,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:48,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:48,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:48,477 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:48,482 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:48,533 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:48,539 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:48,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:48,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:48,708 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:48,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:48,708 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:48,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:48,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:48,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 08:25:48,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:48,807 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:48,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:48,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:48,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:48,926 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:48,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:48,975 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:48,980 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:49,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:49,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:49,107 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:49,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:49,107 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:49,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:49,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:49,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-16 08:25:49,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:49,205 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:49,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:49,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:49,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:49,521 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:49,525 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:49,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:49,595 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:49,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:49,600 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:49,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:49,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:49,729 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:49,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:49,729 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:49,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:49,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:49,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:25:49,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:49,831 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:49,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:49,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:49,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:49,954 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:49,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:50,005 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:50,010 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:50,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:50,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:50,166 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:50,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:50,166 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:50,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:50,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:25:50,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:50,261 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:50,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:50,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:50,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:50,380 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:50,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:50,423 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:50,427 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:50,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:50,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:50,552 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:50,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:50,552 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:50,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:50,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:50,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 08:25:50,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:50,654 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:50,752 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:25:50,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:50,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:50,765 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:50,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:50,813 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:50,818 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:50,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:50,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:50,946 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:50,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:50,947 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:50,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:51,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:25:51,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:51,055 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:51,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:51,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:51,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:51,174 INFO L350 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 14 treesize of output 13 [2022-11-16 08:25:51,178 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:51,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:51,229 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:51,234 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:51,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:51,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:51,360 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:51,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:51,360 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:51,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:51,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:51,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-16 08:25:51,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:51,453 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:51,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:51,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:51,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:51,770 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:51,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:51,841 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:51,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:51,847 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:51,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:51,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:51,977 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:51,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:51,978 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:51,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:52,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:52,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-16 08:25:52,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:52,078 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:52,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:52,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:52,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:52,442 INFO L350 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 14 treesize of output 13 [2022-11-16 08:25:52,445 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:52,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:52,511 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:52,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:52,517 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:52,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:52,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:52,646 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:52,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:52,646 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:52,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:52,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:52,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:25:52,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:52,754 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:52,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:52,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:52,861 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:52,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:52,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:52,914 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:52,918 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:53,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:53,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:53,050 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:53,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:53,050 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:53,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:53,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:53,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-16 08:25:53,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:53,152 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:53,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:53,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:53,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:53,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:53,265 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:53,269 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:53,331 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:53,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:53,337 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:53,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:53,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:53,468 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:53,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:53,469 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:53,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:53,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-16 08:25:53,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:53,578 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:53,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:53,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:53,688 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:53,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:53,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:53,745 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:53,750 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:53,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:53,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:53,899 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:53,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:53,899 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:53,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:53,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:53,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-16 08:25:53,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:54,002 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:54,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:54,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:54,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:54,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:54,322 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:54,326 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:54,387 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:54,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:54,392 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:54,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:54,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:54,555 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:54,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:54,556 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:54,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:54,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:54,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-16 08:25:54,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:54,652 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:54,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:54,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:54,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:54,754 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:54,758 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:54,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:54,825 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:54,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:54,831 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:54,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:54,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:54,965 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:54,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:54,965 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:54,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:55,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 08:25:55,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:55,068 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:55,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:55,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:55,179 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:55,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:55,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:55,233 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:55,238 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:55,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:55,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:55,366 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:55,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:55,367 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:55,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:55,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:25:55,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:55,473 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:55,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:55,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:55,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:55,588 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:55,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:55,645 INFO L350 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 27 treesize of output 11 [2022-11-16 08:25:55,650 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:55,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:55,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:55,782 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:55,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:55,782 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:55,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:55,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:55,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:25:55,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:55,891 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:56,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:56,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:56,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:25:56,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-16 08:25:56,026 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:56,032 INFO L350 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 12 treesize of output 13 [2022-11-16 08:25:56,095 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:25:56,113 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:25:56,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:25:56,119 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:56,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:56,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:56,261 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:56,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:56,262 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:56,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:56,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:56,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-16 08:25:56,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:56,363 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:56,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:56,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:56,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:56,476 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:56,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:56,550 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:56,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:56,556 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:56,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:56,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:56,724 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:56,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:56,724 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:56,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:56,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:56,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-16 08:25:56,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:56,825 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:57,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:57,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:57,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:57,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:57,172 INFO L350 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 14 treesize of output 13 [2022-11-16 08:25:57,177 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:57,243 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:57,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:57,249 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:57,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:57,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:57,387 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:57,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:57,388 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:57,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:57,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:57,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-16 08:25:57,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:57,489 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:57,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:57,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:57,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:57,598 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:57,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:57,667 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:57,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:57,672 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:57,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:57,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:57,809 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:57,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:57,809 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:57,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:57,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:57,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 08:25:57,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:57,917 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:58,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:58,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:58,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:58,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:25:58,023 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:58,027 INFO L350 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 22 treesize of output 21 [2022-11-16 08:25:58,083 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:25:58,089 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-16 08:25:58,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 14 [2022-11-16 08:25:58,094 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:58,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:58,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:58,223 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:58,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:58,223 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:58,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:58,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:58,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-16 08:25:58,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:58,328 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:58,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:58,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:58,433 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:58,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:58,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:58,511 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:58,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:58,516 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:58,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:58,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:58,657 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:58,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:58,657 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:58,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:58,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:58,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 08:25:58,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:58,793 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:59,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:59,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:25:59,120 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:59,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:25:59,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:59,194 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:25:59,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:25:59,200 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:59,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:59,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:59,333 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:59,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:59,333 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:59,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:59,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:59,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-16 08:25:59,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:59,436 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:59,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:25:59,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:25:59,547 INFO L350 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 12 treesize of output 11 [2022-11-16 08:25:59,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:25:59,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:25:59,617 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:25:59,634 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:25:59,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:25:59,640 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:25:59,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:25:59,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:25:59,774 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:25:59,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:25:59,775 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:25:59,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:25:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:25:59,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 08:25:59,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:25:59,880 INFO L350 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 10 treesize of output 8 [2022-11-16 08:25:59,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:26:00,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:26:00,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:26:00,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:26:00,015 INFO L350 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 12 treesize of output 11 [2022-11-16 08:26:00,019 INFO L350 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 22 treesize of output 21 [2022-11-16 08:26:00,062 INFO L350 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 27 treesize of output 11 [2022-11-16 08:26:00,067 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:26:00,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:26:00,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:26:00,204 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:26:00,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:26:00,204 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:26:00,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:26:00,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:26:00,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 08:26:00,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:26:00,310 INFO L350 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 10 treesize of output 8 [2022-11-16 08:26:00,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:26:00,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:26:00,433 INFO L350 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 12 treesize of output 11 [2022-11-16 08:26:00,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:26:00,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:26:00,493 INFO L350 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 27 treesize of output 11 [2022-11-16 08:26:00,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:26:00,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:26:00,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:26:00,631 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:26:00,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:26:00,631 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:26:00,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:26:00,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:26:00,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-16 08:26:00,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:26:00,736 INFO L350 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 10 treesize of output 8 [2022-11-16 08:26:00,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:26:00,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:26:00,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:26:00,882 INFO L350 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 12 treesize of output 11 [2022-11-16 08:26:00,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:26:00,950 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:26:00,968 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 08:26:00,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2022-11-16 08:26:00,974 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:26:01,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:26:01,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:26:01,194 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:26:01,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:26:01,194 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:26:01,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:26:01,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:26:01,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:26:01,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:26:01,303 INFO L350 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 10 treesize of output 8 [2022-11-16 08:26:01,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:26:01,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:26:01,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:26:01,410 INFO L350 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 12 treesize of output 11 [2022-11-16 08:26:01,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:26:01,463 INFO L350 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 27 treesize of output 11 [2022-11-16 08:26:01,468 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:26:01,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:26:01,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:26:01,604 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:26:01,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:26:01,604 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:26:01,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:26:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:26:01,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-16 08:26:01,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:26:01,708 INFO L350 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 10 treesize of output 8 [2022-11-16 08:26:01,799 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:26:01,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:26:01,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:26:01,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:26:01,814 INFO L350 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 14 treesize of output 13 [2022-11-16 08:26:01,817 INFO L350 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 22 treesize of output 21 [2022-11-16 08:26:01,880 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:26:01,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:26:01,886 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:26:02,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:26:02,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:26:02,024 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:26:02,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:26:02,024 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:26:02,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:26:02,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:26:02,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-16 08:26:02,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:26:02,129 INFO L350 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 10 treesize of output 8 [2022-11-16 08:26:02,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:26:02,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:26:02,288 INFO L350 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 12 treesize of output 11 [2022-11-16 08:26:02,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:26:02,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:26:02,345 INFO L350 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 27 treesize of output 11 [2022-11-16 08:26:02,350 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:26:02,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:26:02,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:26:02,485 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:26:02,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:26:02,485 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:26:02,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:26:02,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:26:02,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:26:02,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:26:02,594 INFO L350 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 10 treesize of output 8 [2022-11-16 08:26:02,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:26:02,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:26:02,690 INFO L350 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 12 treesize of output 11 [2022-11-16 08:26:02,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:26:02,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:26:02,762 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:26:02,768 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-16 08:26:02,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 14 [2022-11-16 08:26:02,774 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:26:02,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:26:02,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:26:02,916 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:26:02,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:26:02,917 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:26:02,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:26:02,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:26:02,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-16 08:26:02,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:26:03,024 INFO L350 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 10 treesize of output 8 [2022-11-16 08:26:03,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:26:03,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 08:26:03,222 INFO L350 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 12 treesize of output 11 [2022-11-16 08:26:03,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 08:26:03,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:26:03,300 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:26:03,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 38 treesize of output 20 [2022-11-16 08:26:03,305 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:26:03,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:26:03,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:26:03,453 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:26:03,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:26:03,453 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:26:03,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:26:03,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:26:03,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-16 08:26:03,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:26:03,558 INFO L350 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 10 treesize of output 8 [2022-11-16 08:26:03,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:26:03,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:26:03,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:26:03,674 INFO L350 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 14 treesize of output 13 [2022-11-16 08:26:03,678 INFO L350 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 22 treesize of output 21 [2022-11-16 08:26:03,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:26:03,728 INFO L350 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 27 treesize of output 11 [2022-11-16 08:26:03,733 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:26:03,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:26:03,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:26:03,872 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:26:03,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:26:03,872 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:26:03,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:26:03,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:26:03,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-16 08:26:03,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:26:03,979 INFO L350 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 10 treesize of output 8 [2022-11-16 08:26:04,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:26:04,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:26:04,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:26:04,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:26:04,134 INFO L350 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 12 treesize of output 11 [2022-11-16 08:26:04,138 INFO L350 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 22 treesize of output 21 [2022-11-16 08:26:04,182 INFO L350 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 27 treesize of output 11 [2022-11-16 08:26:04,187 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:26:04,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:26:04,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:26:04,328 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:26:04,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:26:04,328 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:26:04,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:26:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:26:04,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:26:04,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:26:04,437 INFO L350 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 10 treesize of output 8 [2022-11-16 08:26:04,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:26:04,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:26:04,550 INFO L350 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 12 treesize of output 11 [2022-11-16 08:26:04,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:26:04,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:26:04,603 INFO L350 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 27 treesize of output 11 [2022-11-16 08:26:04,608 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:26:04,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:26:04,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:26:04,744 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:26:04,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:26:04,744 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:26:04,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:26:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:26:04,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-16 08:26:04,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:26:04,848 INFO L350 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 10 treesize of output 8 [2022-11-16 08:26:05,157 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 08:26:05,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:26:05,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:26:05,169 INFO L350 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 12 treesize of output 11 [2022-11-16 08:26:05,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:26:05,243 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:26:05,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:26:05,248 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:26:05,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:26:05,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:26:05,426 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:26:05,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:26:05,426 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:26:05,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:26:05,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:26:05,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 08:26:05,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:26:05,533 INFO L350 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 10 treesize of output 8 [2022-11-16 08:26:05,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:26:05,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:26:05,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:26:05,647 INFO L350 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 14 treesize of output 13 [2022-11-16 08:26:05,651 INFO L350 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 22 treesize of output 21 [2022-11-16 08:26:05,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:26:05,700 INFO L350 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 27 treesize of output 11 [2022-11-16 08:26:05,705 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:26:05,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:26:05,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:26:05,843 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:26:05,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:26:05,843 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:26:05,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:26:05,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:26:05,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:26:05,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:26:05,945 INFO L350 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 10 treesize of output 8 [2022-11-16 08:26:06,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:26:06,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:26:06,058 INFO L350 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 12 treesize of output 11 [2022-11-16 08:26:06,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:26:06,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:26:06,111 INFO L350 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 27 treesize of output 11 [2022-11-16 08:26:06,116 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:26:06,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:26:06,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:26:06,258 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:26:06,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:26:06,258 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:26:06,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:26:06,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:26:06,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-16 08:26:06,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:26:06,362 INFO L350 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 10 treesize of output 8 [2022-11-16 08:26:06,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:26:06,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:26:06,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:26:06,471 INFO L350 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 14 treesize of output 13 [2022-11-16 08:26:06,475 INFO L350 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 22 treesize of output 21 [2022-11-16 08:26:06,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:26:06,542 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:26:06,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:26:06,547 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:26:06,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:26:06,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:26:06,692 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:26:06,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:26:06,692 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:26:06,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:26:06,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:26:06,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-16 08:26:06,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:26:06,793 INFO L350 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 10 treesize of output 8 [2022-11-16 08:26:06,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:26:06,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:26:06,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:26:06,898 INFO L350 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 12 treesize of output 11 [2022-11-16 08:26:06,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 08:26:06,967 INFO L321 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-11-16 08:26:06,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 17 [2022-11-16 08:26:06,972 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:26:07,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:26:07,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:26:07,118 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:26:07,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:26:07,118 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:26:07,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:26:07,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:26:07,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 08:26:07,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:26:07,223 INFO L350 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 10 treesize of output 8 [2022-11-16 08:26:07,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:26:07,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 08:26:07,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 08:26:07,372 INFO L350 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 12 treesize of output 11 [2022-11-16 08:26:07,375 INFO L350 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 22 treesize of output 21 [2022-11-16 08:26:07,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 08:26:07,422 INFO L350 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 27 treesize of output 11 [2022-11-16 08:26:07,427 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:26:07,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:26:07,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 62 states and 403 transitions. [2022-11-16 08:26:07,564 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 403 transitions. [2022-11-16 08:26:07,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 08:26:07,565 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:26:07,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:26:07,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:26:07,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-16 08:26:07,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 08:26:07,669 INFO L350 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 10 treesize of output 8 [2022-11-16 08:26:07,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:26:07,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-16 08:26:07,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 20 [2022-11-16 08:26:07,697 INFO L350 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 [2022-11-16 08:26:07,704 INFO L350 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 [2022-11-16 08:26:07,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:26:07,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 99 [2022-11-16 08:26:07,986 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:26:07,987 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 88 [2022-11-16 08:26:07,992 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:26:07,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 121 [2022-11-16 08:26:07,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 08:26:08,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 119 [2022-11-16 08:26:08,008 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 08:26:08,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 58 [2022-11-16 08:26:08,022 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 08:26:08,022 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 96