./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.09_assume-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.09_assume-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 4cca1c0210c0a53cd372224714db019427e8e227743584713b4610995b14f457 --- 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-b5237d8 [2022-11-21 17:25:39,987 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 17:25:39,989 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 17:25:40,015 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 17:25:40,019 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 17:25:40,020 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 17:25:40,023 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 17:25:40,028 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 17:25:40,031 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 17:25:40,032 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 17:25:40,034 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 17:25:40,037 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 17:25:40,039 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 17:25:40,042 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 17:25:40,047 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 17:25:40,049 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 17:25:40,051 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 17:25:40,058 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 17:25:40,059 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 17:25:40,061 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 17:25:40,062 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 17:25:40,067 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 17:25:40,068 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 17:25:40,069 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 17:25:40,076 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 17:25:40,077 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 17:25:40,077 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 17:25:40,078 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 17:25:40,081 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 17:25:40,082 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 17:25:40,083 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 17:25:40,084 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 17:25:40,085 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 17:25:40,086 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 17:25:40,086 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 17:25:40,087 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 17:25:40,087 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 17:25:40,088 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 17:25:40,088 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 17:25:40,088 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 17:25:40,089 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 17:25:40,090 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-11-21 17:25:40,112 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 17:25:40,112 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 17:25:40,113 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 17:25:40,113 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 17:25:40,114 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 17:25:40,114 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 17:25:40,115 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 17:25:40,115 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 17:25:40,115 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 17:25:40,115 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 17:25:40,116 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 17:25:40,116 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 17:25:40,116 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 17:25:40,116 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 17:25:40,116 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 17:25:40,117 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 17:25:40,117 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-21 17:25:40,117 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 17:25:40,117 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 17:25:40,117 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 17:25:40,118 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 17:25:40,118 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 17:25:40,118 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 17:25:40,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 17:25:40,119 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 17:25:40,119 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 17:25:40,119 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 17:25:40,119 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 17:25:40,119 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 17:25:40,120 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 17:25:40,120 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 17:25:40,120 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 17:25:40,120 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_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/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_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a 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 ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4cca1c0210c0a53cd372224714db019427e8e227743584713b4610995b14f457 [2022-11-21 17:25:40,376 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 17:25:40,417 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 17:25:40,420 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 17:25:40,421 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 17:25:40,422 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 17:25:40,423 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/termination-memory-alloca/b.09_assume-alloca.i [2022-11-21 17:25:43,647 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 17:25:43,959 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 17:25:43,960 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/sv-benchmarks/c/termination-memory-alloca/b.09_assume-alloca.i [2022-11-21 17:25:43,979 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/data/721a7cb26/9f280a26273b4239a1527e0f64ec4d1a/FLAGd57294e58 [2022-11-21 17:25:43,998 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/data/721a7cb26/9f280a26273b4239a1527e0f64ec4d1a [2022-11-21 17:25:44,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 17:25:44,005 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 17:25:44,009 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 17:25:44,009 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 17:25:44,013 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 17:25:44,013 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:25:43" (1/1) ... [2022-11-21 17:25:44,015 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f00d6fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:25:44, skipping insertion in model container [2022-11-21 17:25:44,015 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:25:43" (1/1) ... [2022-11-21 17:25:44,023 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 17:25:44,062 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 17:25:44,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 17:25:44,366 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 17:25:44,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 17:25:44,426 INFO L208 MainTranslator]: Completed translation [2022-11-21 17:25:44,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:25:44 WrapperNode [2022-11-21 17:25:44,426 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 17:25:44,428 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 17:25:44,428 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 17:25:44,428 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 17:25:44,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:25:44" (1/1) ... [2022-11-21 17:25:44,448 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:25:44" (1/1) ... [2022-11-21 17:25:44,470 INFO L138 Inliner]: procedures = 111, calls = 35, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 102 [2022-11-21 17:25:44,470 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 17:25:44,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 17:25:44,471 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 17:25:44,472 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 17:25:44,481 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:25:44" (1/1) ... [2022-11-21 17:25:44,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:25:44" (1/1) ... [2022-11-21 17:25:44,484 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:25:44" (1/1) ... [2022-11-21 17:25:44,485 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:25:44" (1/1) ... [2022-11-21 17:25:44,489 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:25:44" (1/1) ... [2022-11-21 17:25:44,493 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:25:44" (1/1) ... [2022-11-21 17:25:44,494 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:25:44" (1/1) ... [2022-11-21 17:25:44,496 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:25:44" (1/1) ... [2022-11-21 17:25:44,498 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 17:25:44,499 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 17:25:44,499 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 17:25:44,499 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 17:25:44,500 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:25:44" (1/1) ... [2022-11-21 17:25:44,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 17:25:44,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:25:44,541 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 17:25:44,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 17:25:44,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 17:25:44,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 17:25:44,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 17:25:44,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 17:25:44,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 17:25:44,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 17:25:44,705 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 17:25:44,707 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 17:25:44,850 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 17:25:44,856 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 17:25:44,857 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-21 17:25:44,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:25:44 BoogieIcfgContainer [2022-11-21 17:25:44,859 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 17:25:44,862 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 17:25:44,862 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 17:25:44,866 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 17:25:44,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 05:25:43" (1/3) ... [2022-11-21 17:25:44,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e0a9869 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 05:25:44, skipping insertion in model container [2022-11-21 17:25:44,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:25:44" (2/3) ... [2022-11-21 17:25:44,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e0a9869 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 05:25:44, skipping insertion in model container [2022-11-21 17:25:44,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:25:44" (3/3) ... [2022-11-21 17:25:44,869 INFO L112 eAbstractionObserver]: Analyzing ICFG b.09_assume-alloca.i [2022-11-21 17:25:44,890 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 17:25:44,890 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-11-21 17:25:44,984 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 17:25:45,005 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@621ff9f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 17:25:45,005 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-21 17:25:45,010 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 17 states have (on average 1.588235294117647) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:45,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-21 17:25:45,016 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:25:45,017 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:25:45,018 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-21 17:25:45,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:25:45,035 INFO L85 PathProgramCache]: Analyzing trace with hash -473795253, now seen corresponding path program 1 times [2022-11-21 17:25:45,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:25:45,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001160047] [2022-11-21 17:25:45,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:25:45,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:25:45,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:45,424 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-21 17:25:45,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:25:45,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001160047] [2022-11-21 17:25:45,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001160047] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:25:45,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:25:45,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 17:25:45,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712895910] [2022-11-21 17:25:45,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:25:45,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:25:45,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:25:45,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:25:45,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:25:45,482 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.588235294117647) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:45,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:25:45,542 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-11-21 17:25:45,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:25:45,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-21 17:25:45,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:25:45,553 INFO L225 Difference]: With dead ends: 41 [2022-11-21 17:25:45,554 INFO L226 Difference]: Without dead ends: 17 [2022-11-21 17:25:45,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:25:45,560 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:25:45,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:25:45,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-11-21 17:25:45,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-11-21 17:25:45,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:45,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-11-21 17:25:45,594 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 9 [2022-11-21 17:25:45,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:25:45,595 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-11-21 17:25:45,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:45,596 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-11-21 17:25:45,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-21 17:25:45,596 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:25:45,596 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:25:45,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 17:25:45,597 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-21 17:25:45,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:25:45,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1301212109, now seen corresponding path program 1 times [2022-11-21 17:25:45,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:25:45,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438031419] [2022-11-21 17:25:45,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:25:45,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:25:45,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:46,192 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-21 17:25:46,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:25:46,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438031419] [2022-11-21 17:25:46,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438031419] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:25:46,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:25:46,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 17:25:46,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792617965] [2022-11-21 17:25:46,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:25:46,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 17:25:46,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:25:46,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 17:25:46,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:25:46,197 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:46,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:25:46,274 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-11-21 17:25:46,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 17:25:46,274 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-21 17:25:46,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:25:46,275 INFO L225 Difference]: With dead ends: 30 [2022-11-21 17:25:46,275 INFO L226 Difference]: Without dead ends: 28 [2022-11-21 17:25:46,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-21 17:25:46,277 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 33 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:25:46,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 27 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 17:25:46,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-21 17:25:46,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2022-11-21 17:25:46,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:46,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-11-21 17:25:46,284 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 9 [2022-11-21 17:25:46,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:25:46,284 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-11-21 17:25:46,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:46,285 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-11-21 17:25:46,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-21 17:25:46,285 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:25:46,286 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:25:46,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 17:25:46,289 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-21 17:25:46,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:25:46,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1301213839, now seen corresponding path program 1 times [2022-11-21 17:25:46,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:25:46,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620674882] [2022-11-21 17:25:46,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:25:46,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:25:46,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:46,691 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-21 17:25:46,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:25:46,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620674882] [2022-11-21 17:25:46,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620674882] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:25:46,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:25:46,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 17:25:46,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191907106] [2022-11-21 17:25:46,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:25:46,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 17:25:46,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:25:46,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 17:25:46,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:25:46,703 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:46,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:25:46,869 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-11-21 17:25:46,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 17:25:46,870 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-21 17:25:46,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:25:46,871 INFO L225 Difference]: With dead ends: 28 [2022-11-21 17:25:46,871 INFO L226 Difference]: Without dead ends: 27 [2022-11-21 17:25:46,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-21 17:25:46,894 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 18 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:25:46,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 32 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 17:25:46,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-21 17:25:46,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-11-21 17:25:46,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:46,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-11-21 17:25:46,902 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 9 [2022-11-21 17:25:46,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:25:46,903 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-11-21 17:25:46,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:46,915 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-11-21 17:25:46,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-21 17:25:46,916 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:25:46,917 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:25:46,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 17:25:46,917 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-21 17:25:46,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:25:46,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1682923412, now seen corresponding path program 1 times [2022-11-21 17:25:46,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:25:46,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425661386] [2022-11-21 17:25:46,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:25:46,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:25:46,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:47,063 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-21 17:25:47,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:25:47,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425661386] [2022-11-21 17:25:47,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425661386] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:25:47,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:25:47,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 17:25:47,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541352160] [2022-11-21 17:25:47,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:25:47,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 17:25:47,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:25:47,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 17:25:47,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:25:47,067 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:47,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:25:47,127 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-11-21 17:25:47,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 17:25:47,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-21 17:25:47,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:25:47,129 INFO L225 Difference]: With dead ends: 27 [2022-11-21 17:25:47,129 INFO L226 Difference]: Without dead ends: 26 [2022-11-21 17:25:47,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:25:47,139 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:25:47,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 31 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:25:47,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-21 17:25:47,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-11-21 17:25:47,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:47,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-11-21 17:25:47,144 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 10 [2022-11-21 17:25:47,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:25:47,144 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-11-21 17:25:47,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:47,145 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-11-21 17:25:47,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-21 17:25:47,145 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:25:47,145 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:25:47,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 17:25:47,146 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-21 17:25:47,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:25:47,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1625342439, now seen corresponding path program 1 times [2022-11-21 17:25:47,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:25:47,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940000916] [2022-11-21 17:25:47,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:25:47,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:25:47,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:47,771 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:25:47,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:25:47,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940000916] [2022-11-21 17:25:47,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940000916] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:25:47,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007237223] [2022-11-21 17:25:47,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:25:47,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:25:47,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:25:47,779 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:25:47,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 17:25:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:47,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-21 17:25:47,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:25:48,165 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-21 17:25:48,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2022-11-21 17:25:48,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-21 17:25:48,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-21 17:25:48,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-21 17:25:48,331 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:25:48,339 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:25:48,358 INFO L321 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-11-21 17:25:48,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 97 treesize of output 98 [2022-11-21 17:25:48,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 9 treesize of output 7 [2022-11-21 17:25:48,438 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:25:48,441 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:25:48,444 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:25:48,446 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 78 [2022-11-21 17:25:48,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-21 17:25:48,669 INFO L321 Elim1Store]: treesize reduction 24, result has 25.0 percent of original size [2022-11-21 17:25:48,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 60 [2022-11-21 17:25:48,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 15 treesize of output 11 [2022-11-21 17:25:48,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 14 treesize of output 12 [2022-11-21 17:25:48,775 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-21 17:25:48,853 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 28 treesize of output 16 [2022-11-21 17:25:48,907 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-21 17:25:48,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 17:25:48,946 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:25:48,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:25:48,989 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_167 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_167) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) is different from false [2022-11-21 17:25:49,031 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_165 Int) (v_ArrVal_167 (Array Int Int))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_165)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_167) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_165 (+ |c_ULTIMATE.start_test_fun_#t~mem15#1| 1))))) is different from false [2022-11-21 17:25:49,068 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_165 Int) (v_ArrVal_167 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_165) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_165)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_167) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)))) is different from false [2022-11-21 17:25:49,093 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_165 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_167 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_164))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_165)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_167) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_165))))) is different from false [2022-11-21 17:25:49,166 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-21 17:25:49,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007237223] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:25:49,166 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:25:49,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 19 [2022-11-21 17:25:49,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518071573] [2022-11-21 17:25:49,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:25:49,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-21 17:25:49,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:25:49,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-21 17:25:49,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=168, Unknown=4, NotChecked=116, Total=342 [2022-11-21 17:25:49,168 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:49,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:25:49,913 INFO L93 Difference]: Finished difference Result 103 states and 115 transitions. [2022-11-21 17:25:49,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-21 17:25:49,915 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-21 17:25:49,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:25:49,916 INFO L225 Difference]: With dead ends: 103 [2022-11-21 17:25:49,916 INFO L226 Difference]: Without dead ends: 90 [2022-11-21 17:25:49,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=355, Invalid=989, Unknown=4, NotChecked=292, Total=1640 [2022-11-21 17:25:49,917 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 306 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 164 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 17:25:49,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 70 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 144 Invalid, 0 Unknown, 164 Unchecked, 0.2s Time] [2022-11-21 17:25:49,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-21 17:25:49,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 63. [2022-11-21 17:25:49,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 59 states have (on average 1.271186440677966) internal successors, (75), 62 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:49,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2022-11-21 17:25:49,930 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 15 [2022-11-21 17:25:49,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:25:49,930 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2022-11-21 17:25:49,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:49,931 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2022-11-21 17:25:49,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-21 17:25:49,931 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:25:49,932 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:25:49,942 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-21 17:25:50,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:25:50,137 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-21 17:25:50,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:25:50,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1625340709, now seen corresponding path program 1 times [2022-11-21 17:25:50,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:25:50,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864153185] [2022-11-21 17:25:50,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:25:50,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:25:50,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:50,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:25:50,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:25:50,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864153185] [2022-11-21 17:25:50,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864153185] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:25:50,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310359484] [2022-11-21 17:25:50,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:25:50,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:25:50,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:25:50,488 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:25:50,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 17:25:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:50,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-21 17:25:50,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:25:50,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2022-11-21 17:25:50,667 INFO L321 Elim1Store]: treesize reduction 52, result has 32.5 percent of original size [2022-11-21 17:25:50,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 100 [2022-11-21 17:25:50,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-21 17:25:50,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-21 17:25:50,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:25:50,755 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-21 17:25:50,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 32 [2022-11-21 17:25:50,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 9 treesize of output 7 [2022-11-21 17:25:50,890 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-21 17:25:50,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 1 case distinctions, treesize of input 23 treesize of output 18 [2022-11-21 17:25:50,968 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-21 17:25:50,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 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 32 [2022-11-21 17:25:50,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 15 treesize of output 11 [2022-11-21 17:25:51,123 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:25:51,124 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 26 treesize of output 18 [2022-11-21 17:25:51,146 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:25:51,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:25:51,234 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_231 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_231))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or (< .cse0 2147483649) (< (select (select .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse0))))) is different from false [2022-11-21 17:25:51,265 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_231 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_231))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or (< .cse0 2147483649) (< (select (select .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse0))))) is different from false [2022-11-21 17:25:51,340 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-21 17:25:51,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310359484] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:25:51,341 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:25:51,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 17 [2022-11-21 17:25:51,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113532132] [2022-11-21 17:25:51,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:25:51,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-21 17:25:51,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:25:51,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-21 17:25:51,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=185, Unknown=2, NotChecked=58, Total=306 [2022-11-21 17:25:51,343 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:51,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:25:51,686 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2022-11-21 17:25:51,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 17:25:51,687 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-21 17:25:51,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:25:51,687 INFO L225 Difference]: With dead ends: 65 [2022-11-21 17:25:51,688 INFO L226 Difference]: Without dead ends: 64 [2022-11-21 17:25:51,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=332, Unknown=2, NotChecked=82, Total=552 [2022-11-21 17:25:51,689 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 78 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:25:51,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 45 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 66 Invalid, 0 Unknown, 35 Unchecked, 0.1s Time] [2022-11-21 17:25:51,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-21 17:25:51,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2022-11-21 17:25:51,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 61 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:51,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2022-11-21 17:25:51,697 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 15 [2022-11-21 17:25:51,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:25:51,697 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2022-11-21 17:25:51,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:51,698 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2022-11-21 17:25:51,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-21 17:25:51,699 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:25:51,700 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:25:51,710 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 17:25:51,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-21 17:25:51,900 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-21 17:25:51,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:25:51,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1154045640, now seen corresponding path program 1 times [2022-11-21 17:25:51,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:25:51,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758345663] [2022-11-21 17:25:51,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:25:51,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:25:51,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:51,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 17:25:51,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:25:51,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758345663] [2022-11-21 17:25:51,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758345663] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:25:51,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:25:51,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 17:25:51,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221887634] [2022-11-21 17:25:51,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:25:51,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 17:25:51,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:25:51,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 17:25:51,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:25:51,966 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:51,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:25:51,993 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2022-11-21 17:25:51,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 17:25:51,994 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-21 17:25:51,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:25:51,996 INFO L225 Difference]: With dead ends: 62 [2022-11-21 17:25:51,996 INFO L226 Difference]: Without dead ends: 61 [2022-11-21 17:25:51,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:25:51,997 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:25:51,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:25:51,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-21 17:25:52,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-11-21 17:25:52,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 60 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:52,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2022-11-21 17:25:52,004 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 16 [2022-11-21 17:25:52,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:25:52,004 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2022-11-21 17:25:52,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:52,005 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2022-11-21 17:25:52,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-21 17:25:52,005 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:25:52,005 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:25:52,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 17:25:52,006 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-21 17:25:52,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:25:52,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1039474657, now seen corresponding path program 1 times [2022-11-21 17:25:52,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:25:52,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716205242] [2022-11-21 17:25:52,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:25:52,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:25:52,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:52,302 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:25:52,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:25:52,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716205242] [2022-11-21 17:25:52,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716205242] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:25:52,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576981420] [2022-11-21 17:25:52,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:25:52,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:25:52,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:25:52,304 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:25:52,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 17:25:52,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:52,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-21 17:25:52,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:25:52,535 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-21 17:25:52,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2022-11-21 17:25:52,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-21 17:25:52,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-21 17:25: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-21 17:25:52,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:25:52,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:25:52,948 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:25:52,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 104 treesize of output 62 [2022-11-21 17:25:52,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 22 treesize of output 16 [2022-11-21 17:25:52,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 15 treesize of output 11 [2022-11-21 17:25:53,053 INFO L321 Elim1Store]: treesize reduction 56, result has 1.8 percent of original size [2022-11-21 17:25:53,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 170 treesize of output 43 [2022-11-21 17:25:53,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-21 17:25:53,886 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-11-21 17:25:53,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 568 treesize of output 542 [2022-11-21 17:25:53,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 7 treesize of output 5 [2022-11-21 17:25:54,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 13 treesize of output 9 [2022-11-21 17:25:54,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-21 17:25:54,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 11 treesize of output 7 [2022-11-21 17:25:54,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-21 17:25:54,154 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 16 treesize of output 12 [2022-11-21 17:25:54,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 17:25:54,307 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 16 treesize of output 18 [2022-11-21 17:25:54,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-21 17:25:54,366 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:25:54,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:25:54,440 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_325 (Array Int Int))) (< 0 (+ 2147483650 (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_325) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|)))) is different from false [2022-11-21 17:25:54,467 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:25:54,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-11-21 17:25:54,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2022-11-21 17:25:54,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-21 17:25:54,682 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-21 17:25:54,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576981420] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:25:54,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:25:54,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2022-11-21 17:25:54,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478372769] [2022-11-21 17:25:54,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:25:54,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-21 17:25:54,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:25:54,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-21 17:25:54,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=450, Unknown=2, NotChecked=44, Total=600 [2022-11-21 17:25:54,685 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand has 25 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 25 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:55,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:25:55,704 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2022-11-21 17:25:55,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-21 17:25:55,705 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 25 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-21 17:25:55,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:25:55,706 INFO L225 Difference]: With dead ends: 80 [2022-11-21 17:25:55,706 INFO L226 Difference]: Without dead ends: 79 [2022-11-21 17:25:55,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=335, Invalid=1067, Unknown=8, NotChecked=72, Total=1482 [2022-11-21 17:25:55,707 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 178 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 46 mSolverCounterUnsat, 23 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 23 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 17:25:55,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 23 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 159 Invalid, 23 Unknown, 19 Unchecked, 0.3s Time] [2022-11-21 17:25:55,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-21 17:25:55,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 60. [2022-11-21 17:25:55,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 59 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:55,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2022-11-21 17:25:55,715 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 19 [2022-11-21 17:25:55,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:25:55,715 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2022-11-21 17:25:55,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 25 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:55,716 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2022-11-21 17:25:55,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-21 17:25:55,716 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:25:55,717 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-11-21 17:25:55,728 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-21 17:25:55,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-21 17:25:55,923 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-21 17:25:55,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:25:55,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1365286559, now seen corresponding path program 1 times [2022-11-21 17:25:55,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:25:55,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836738722] [2022-11-21 17:25:55,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:25:55,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:25:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:56,513 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:25:56,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:25:56,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836738722] [2022-11-21 17:25:56,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836738722] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:25:56,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728936896] [2022-11-21 17:25:56,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:25:56,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:25:56,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:25:56,515 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:25:56,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 17:25:56,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:56,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-21 17:25:56,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:25:56,765 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-21 17:25:56,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 281 [2022-11-21 17:25:56,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-21 17:25:56,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-21 17:25:56,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-21 17:25:57,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:25:57,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:25:57,279 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:25:57,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 33 [2022-11-21 17:25:57,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-11-21 17:25:57,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-21 17:25:57,308 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:25:57,314 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:25:57,327 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-21 17:25:57,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 371 treesize of output 336 [2022-11-21 17:25:57,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-21 17:25:57,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 7 treesize of output 5 [2022-11-21 17:25:57,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 15 treesize of output 11 [2022-11-21 17:25:58,291 INFO L321 Elim1Store]: treesize reduction 62, result has 41.5 percent of original size [2022-11-21 17:25:58,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 468 treesize of output 470 [2022-11-21 17:25:58,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-21 17:25:58,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 9 treesize of output 7 [2022-11-21 17:25:58,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 7 treesize of output 5 [2022-11-21 17:25:58,511 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:25:58,511 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 49 treesize of output 51 [2022-11-21 17:25:58,619 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 28 treesize of output 16 [2022-11-21 17:25:58,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 14 treesize of output 16 [2022-11-21 17:25:58,781 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 28 treesize of output 16 [2022-11-21 17:25:58,834 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-21 17:25:58,904 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 28 treesize of output 16 [2022-11-21 17:25:58,977 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-21 17:25:59,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 17:25:59,023 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 32 refuted. 4 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:25:59,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:25:59,060 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_415 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_415) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) is different from false [2022-11-21 17:25:59,092 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_415 (Array Int Int)) (v_ArrVal_413 Int)) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_413)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_415) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_413 (+ |c_ULTIMATE.start_test_fun_#t~mem15#1| 1))))) is different from false [2022-11-21 17:25:59,110 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_415 (Array Int Int)) (v_ArrVal_413 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_413) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_413)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_415) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)))) is different from false [2022-11-21 17:25:59,122 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_415 (Array Int Int)) (v_ArrVal_412 (Array Int Int)) (v_ArrVal_413 Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_412))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_413) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_413)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_415) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))) is different from false [2022-11-21 17:25:59,165 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_411 Int) (v_ArrVal_415 (Array Int Int)) (v_ArrVal_412 (Array Int Int)) (v_ArrVal_413 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_411)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_412))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (not (<= v_ArrVal_411 (+ |c_ULTIMATE.start_test_fun_#t~mem15#1| 1))) (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_413)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_415) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_413))))) is different from false [2022-11-21 17:25:59,208 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_411 Int) (v_ArrVal_415 (Array Int Int)) (v_ArrVal_412 (Array Int Int)) (v_ArrVal_413 Int)) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_411)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_412))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_413)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_415) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_413) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_411)))))) is different from false [2022-11-21 17:25:59,226 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_411 Int) (v_ArrVal_415 (Array Int Int)) (v_ArrVal_409 (Array Int Int)) (v_ArrVal_412 (Array Int Int)) (v_ArrVal_413 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_409))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_411)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_412))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_413)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_415) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_411) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_413))))))) is different from false [2022-11-21 17:25:59,322 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_411 Int) (v_ArrVal_415 (Array Int Int)) (v_ArrVal_409 (Array Int Int)) (v_ArrVal_407 Int) (v_ArrVal_412 (Array Int Int)) (v_ArrVal_413 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_409))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_411)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_412))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_413) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_413)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_415) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_407 (+ |c_ULTIMATE.start_test_fun_#t~mem15#1| 1))) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_411))))))) is different from false [2022-11-21 17:25:59,366 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_411 Int) (v_ArrVal_415 (Array Int Int)) (v_ArrVal_409 (Array Int Int)) (v_ArrVal_407 Int) (v_ArrVal_412 (Array Int Int)) (v_ArrVal_413 Int)) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_409))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_411)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_412))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_413) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_407) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_413)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_415) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_411)))))))) is different from false [2022-11-21 17:25:59,398 WARN L837 $PredicateComparison]: unable to prove that (or (not (< |c_ULTIMATE.start_test_fun_#t~mem10#1| |c_ULTIMATE.start_test_fun_#t~mem9#1|)) (forall ((v_ArrVal_411 Int) (v_ArrVal_415 (Array Int Int)) (v_ArrVal_406 (Array Int Int)) (v_ArrVal_409 (Array Int Int)) (v_ArrVal_407 Int) (v_ArrVal_412 (Array Int Int)) (v_ArrVal_413 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_406))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_409))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_411)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_412))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_413) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_413)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_415) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_411) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_407)))))))))) is different from false [2022-11-21 17:25:59,651 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_411 Int) (v_ArrVal_415 (Array Int Int)) (v_ArrVal_406 (Array Int Int)) (v_ArrVal_409 (Array Int Int)) (v_ArrVal_407 Int) (v_ArrVal_412 (Array Int Int)) (v_ArrVal_413 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_406))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_409))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_411)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_412))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_413) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_413)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_415) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_411) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_407))))))))) (forall ((|ULTIMATE.start_test_fun_~y_ref~0#1.offset| Int)) (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (or (< .cse6 1) (< (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ .cse6 1)))))) is different from false [2022-11-21 17:25:59,692 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 36 not checked. [2022-11-21 17:25:59,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728936896] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:25:59,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:25:59,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 16] total 39 [2022-11-21 17:25:59,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901486816] [2022-11-21 17:25:59,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:25:59,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-21 17:25:59,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:25:59,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-21 17:25:59,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=603, Unknown=40, NotChecked=704, Total=1560 [2022-11-21 17:25:59,697 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand has 40 states, 39 states have (on average 2.4615384615384617) internal successors, (96), 40 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:59,722 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|))) (let ((.cse0 (<= .cse6 0)) (.cse8 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= |c_ULTIMATE.start_test_fun_~c~0#1.offset| 0) .cse0 (or (and .cse0 (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int))) (let ((.cse5 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_24) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_24)) (.cse7 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_30))) (let ((.cse2 (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (and (= .cse1 .cse2) (= .cse3 .cse2) (= .cse4 (select .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= (select v_DerPreprocessor_24 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) .cse6) (= (select v_DerPreprocessor_30 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) .cse6) (= v_DerPreprocessor_28 .cse2) (= (select .cse7 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) .cse4) (= v_DerPreprocessor_22 .cse3)))))) (and .cse0 (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (and .cse0 .cse8)) (not .cse8) (= .cse6 0) (or (forall ((v_ArrVal_411 Int) (v_ArrVal_415 (Array Int Int)) (v_ArrVal_406 (Array Int Int)) (v_ArrVal_409 (Array Int Int)) (v_ArrVal_407 Int) (v_ArrVal_412 (Array Int Int)) (v_ArrVal_413 Int)) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_406))) (let ((.cse12 (select .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse13 (store (store .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_409))) (let ((.cse11 (select .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse10 (store (store .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_411)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_412))) (let ((.cse9 (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_413) (< (select (select (store (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_413)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_415) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_411) (< (+ (select .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_407))))))))) (forall ((|ULTIMATE.start_test_fun_~y_ref~0#1.offset| Int)) (let ((.cse15 (select .cse4 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (or (< .cse15 1) (< (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ .cse15 1)))))) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)))) is different from false [2022-11-21 17:26:02,178 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_415 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_415) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) (forall ((v_ArrVal_411 Int) (v_ArrVal_415 (Array Int Int)) (v_ArrVal_409 (Array Int Int)) (v_ArrVal_412 (Array Int Int)) (v_ArrVal_413 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_409))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_411)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_412))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_413)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_415) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_411) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_413)))))))) is different from false [2022-11-21 17:26:02,208 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|))) (and (forall ((v_ArrVal_411 Int) (v_ArrVal_415 (Array Int Int)) (v_ArrVal_412 (Array Int Int)) (v_ArrVal_413 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_411)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_412))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_413)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_415) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_413) (< (+ .cse2 1) v_ArrVal_411))))) (< .cse2 2147483647)))) is different from false [2022-11-21 17:26:02,220 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_test_fun_#t~mem15#1| 2147483646) (forall ((v_ArrVal_411 Int) (v_ArrVal_415 (Array Int Int)) (v_ArrVal_412 (Array Int Int)) (v_ArrVal_413 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_411)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_412))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (not (<= v_ArrVal_411 (+ |c_ULTIMATE.start_test_fun_#t~mem15#1| 1))) (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_413)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_415) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_413)))))) is different from false [2022-11-21 17:26:02,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:26:02,581 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2022-11-21 17:26:02,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-21 17:26:02,581 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.4615384615384617) internal successors, (96), 40 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-21 17:26:02,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:26:02,582 INFO L225 Difference]: With dead ends: 105 [2022-11-21 17:26:02,582 INFO L226 Difference]: Without dead ends: 104 [2022-11-21 17:26:02,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 41 SyntacticMatches, 15 SemanticMatches, 59 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 914 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=502, Invalid=1532, Unknown=96, NotChecked=1530, Total=3660 [2022-11-21 17:26:02,584 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 130 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 50 mSolverCounterUnsat, 27 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 27 IncrementalHoareTripleChecker+Unknown, 532 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 17:26:02,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 82 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 185 Invalid, 27 Unknown, 532 Unchecked, 0.4s Time] [2022-11-21 17:26:02,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-21 17:26:02,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 88. [2022-11-21 17:26:02,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.0919540229885059) internal successors, (95), 87 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:26:02,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2022-11-21 17:26:02,594 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 33 [2022-11-21 17:26:02,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:26:02,594 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2022-11-21 17:26:02,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.4615384615384617) internal successors, (96), 40 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:26:02,594 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2022-11-21 17:26:02,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-21 17:26:02,595 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:26:02,595 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2022-11-21 17:26:02,604 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-21 17:26:02,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:26:02,801 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-21 17:26:02,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:26:02,802 INFO L85 PathProgramCache]: Analyzing trace with hash 466485450, now seen corresponding path program 2 times [2022-11-21 17:26:02,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:26:02,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364864557] [2022-11-21 17:26:02,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:26:02,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:26:02,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:26:03,327 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:26:03,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:26:03,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364864557] [2022-11-21 17:26:03,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364864557] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:26:03,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976568690] [2022-11-21 17:26:03,328 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 17:26:03,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:26:03,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:26:03,329 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:26:03,341 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-21 17:26:03,460 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 17:26:03,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 17:26:03,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-21 17:26:03,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:26:03,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 14 treesize of output 12 [2022-11-21 17:26:03,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:26:03,528 INFO L321 Elim1Store]: treesize reduction 46, result has 44.6 percent of original size [2022-11-21 17:26:03,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 102 [2022-11-21 17:26:03,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-21 17:26:03,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-21 17:26: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 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 20 [2022-11-21 17:26:03,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-21 17:26:03,674 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-21 17:26:03,713 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 28 treesize of output 16 [2022-11-21 17:26:03,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 14 treesize of output 16 [2022-11-21 17:26:03,778 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 28 treesize of output 16 [2022-11-21 17:26:03,807 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-21 17:26:03,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 28 treesize of output 16 [2022-11-21 17:26:03,873 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-21 17:26:03,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 17:26:03,882 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:26:03,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:26:03,912 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_508 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_508) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) is different from false [2022-11-21 17:26:03,935 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_508 (Array Int Int)) (v_ArrVal_506 Int)) (or (not (<= v_ArrVal_506 (+ |c_ULTIMATE.start_test_fun_#t~mem15#1| 1))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_506)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_508) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))) is different from false [2022-11-21 17:26:03,952 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_508 (Array Int Int)) (v_ArrVal_506 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_506) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_506)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_508) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)))) is different from false [2022-11-21 17:26:03,963 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_505 (Array Int Int)) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_506 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_505))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_506)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_508) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_506))))) is different from false [2022-11-21 17:26:04,016 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_505 (Array Int Int)) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_506 Int) (v_ArrVal_503 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_503)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_505))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_506)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_508) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_506) (not (<= v_ArrVal_503 (+ |c_ULTIMATE.start_test_fun_#t~mem15#1| 1))))))) is different from false [2022-11-21 17:26:04,044 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_505 (Array Int Int)) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_506 Int) (v_ArrVal_503 Int)) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_503)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_505))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_506)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_508) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_503) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_506)))))) is different from false [2022-11-21 17:26:04,076 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_505 (Array Int Int)) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_506 Int) (v_ArrVal_503 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_502))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_503)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_505))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_503) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_506) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_506)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_508) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))) is different from false [2022-11-21 17:26:04,163 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_500 Int) (v_ArrVal_502 (Array Int Int)) (v_ArrVal_505 (Array Int Int)) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_506 Int) (v_ArrVal_503 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_500)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_502))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_503)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_505))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_503) (not (<= v_ArrVal_500 (+ |c_ULTIMATE.start_test_fun_#t~mem15#1| 1))) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_506) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_506)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_508) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))) is different from false [2022-11-21 17:26:04,204 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_500 Int) (v_ArrVal_502 (Array Int Int)) (v_ArrVal_505 (Array Int Int)) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_506 Int) (v_ArrVal_503 Int)) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_500)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_502))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_503)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_505))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_503) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_506) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_506)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_508) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_500)))))))) is different from false [2022-11-21 17:26:04,229 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_500 Int) (v_ArrVal_502 (Array Int Int)) (v_ArrVal_505 (Array Int Int)) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_506 Int) (v_ArrVal_503 Int) (v_ArrVal_499 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_499))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_500)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_502))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_503)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_505))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_506) (< (+ 1 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_ArrVal_503) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_506)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_508) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_500))))))))) is different from false [2022-11-21 17:26:04,358 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 42 not checked. [2022-11-21 17:26:04,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976568690] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:26:04,358 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:26:04,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 13] total 28 [2022-11-21 17:26:04,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221186705] [2022-11-21 17:26:04,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:26:04,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-21 17:26:04,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:26:04,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-21 17:26:04,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=253, Unknown=10, NotChecked=430, Total=812 [2022-11-21 17:26:04,361 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 29 states, 28 states have (on average 3.0714285714285716) internal successors, (86), 29 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:26:04,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:26:04,599 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2022-11-21 17:26:04,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-21 17:26:04,604 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.0714285714285716) internal successors, (86), 29 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-21 17:26:04,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:26:04,605 INFO L225 Difference]: With dead ends: 125 [2022-11-21 17:26:04,605 INFO L226 Difference]: Without dead ends: 124 [2022-11-21 17:26:04,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 58 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=301, Unknown=10, NotChecked=470, Total=930 [2022-11-21 17:26:04,606 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 67 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 380 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:26:04,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 63 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 116 Invalid, 0 Unknown, 380 Unchecked, 0.1s Time] [2022-11-21 17:26:04,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-11-21 17:26:04,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 103. [2022-11-21 17:26:04,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 1.088235294117647) internal successors, (111), 102 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:26:04,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2022-11-21 17:26:04,637 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 36 [2022-11-21 17:26:04,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:26:04,638 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2022-11-21 17:26:04,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.0714285714285716) internal successors, (86), 29 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:26:04,638 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2022-11-21 17:26:04,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-21 17:26:04,641 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:26:04,641 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2022-11-21 17:26:04,652 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-21 17:26:04,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-21 17:26:04,847 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-21 17:26:04,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:26:04,848 INFO L85 PathProgramCache]: Analyzing trace with hash -739811754, now seen corresponding path program 3 times [2022-11-21 17:26:04,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:26:04,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815408169] [2022-11-21 17:26:04,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:26:04,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:26:04,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:26:05,484 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:26:05,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:26:05,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815408169] [2022-11-21 17:26:05,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815408169] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:26:05,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580594856] [2022-11-21 17:26:05,485 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 17:26:05,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:26:05,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:26:05,486 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:26:05,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-21 17:26:05,653 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-21 17:26:05,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 17:26:05,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-21 17:26:05,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:26:05,790 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-21 17:26:05,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 281 [2022-11-21 17:26:05,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-21 17:26:05,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-21 17:26:05,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 12 treesize of output 11 [2022-11-21 17:26:06,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:26:06,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:26:06,313 INFO L321 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2022-11-21 17:26:06,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 180 treesize of output 140 [2022-11-21 17:26:06,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-11-21 17:26:06,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-21 17:26:06,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:26:06,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:26:06,379 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:26:06,388 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:26:06,389 INFO L350 Elim1Store]: Elim1 eliminated variable 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 76 treesize of output 33 [2022-11-21 17:26:06,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-11-21 17:26:06,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 15 treesize of output 11 [2022-11-21 17:26:06,516 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 17:26:06,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 21 treesize of output 25 [2022-11-21 17:26:06,584 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 28 treesize of output 16 [2022-11-21 17:26:06,650 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-21 17:26:06,702 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 28 treesize of output 16 [2022-11-21 17:26:06,745 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-21 17:26:06,799 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 28 treesize of output 16 [2022-11-21 17:26:06,862 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-21 17:26:06,918 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 28 treesize of output 16 [2022-11-21 17:26:06,992 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-21 17:26:07,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 17:26:07,020 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:26:07,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:26:07,054 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_609 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_609) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) is different from false [2022-11-21 17:26:07,082 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_607 Int) (v_ArrVal_609 (Array Int Int))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_607)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_609) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_607 (+ |c_ULTIMATE.start_test_fun_#t~mem15#1| 1))))) is different from false [2022-11-21 17:26:07,098 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_607 Int) (v_ArrVal_609 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_607) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_607)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_609) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)))) is different from false [2022-11-21 17:26:07,122 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_606 (Array Int Int)) (v_ArrVal_607 Int) (v_ArrVal_609 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_606))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_607) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_607)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_609) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))) is different from false [2022-11-21 17:26:07,211 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_606 (Array Int Int)) (v_ArrVal_607 Int) (v_ArrVal_609 (Array Int Int)) (v_ArrVal_604 Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_604)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_606))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_607) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_607)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_609) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_604 (+ |c_ULTIMATE.start_test_fun_#t~mem15#1| 1))))))) is different from false [2022-11-21 17:26:07,267 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_606 (Array Int Int)) (v_ArrVal_607 Int) (v_ArrVal_609 (Array Int Int)) (v_ArrVal_604 Int)) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_604)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_606))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_607) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_607)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_609) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_604)))))) is different from false [2022-11-21 17:26:07,288 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_603 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_607 Int) (v_ArrVal_609 (Array Int Int)) (v_ArrVal_604 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_603))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_604)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_606))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_604) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_607)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_609) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_607))))))) is different from false [2022-11-21 17:26:07,334 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_603 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_607 Int) (v_ArrVal_609 (Array Int Int)) (v_ArrVal_604 Int) (v_ArrVal_602 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_602)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_603))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_604)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_606))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_607)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_609) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_604) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_607) (not (<= v_ArrVal_602 (+ |c_ULTIMATE.start_test_fun_#t~mem15#1| 1))))))))) is different from false [2022-11-21 17:26:07,373 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_603 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_607 Int) (v_ArrVal_609 (Array Int Int)) (v_ArrVal_604 Int) (v_ArrVal_602 Int)) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_602)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_603))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_604)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_606))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_607)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_609) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_602) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_604) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_607)))))))) is different from false [2022-11-21 17:26:07,397 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_600 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_607 Int) (v_ArrVal_609 (Array Int Int)) (v_ArrVal_604 Int) (v_ArrVal_602 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_600))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_602)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_603))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_604)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_606))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_604) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_602) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_607)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_609) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_607))))))))) is different from false [2022-11-21 17:26:07,556 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_598 Int) (v_ArrVal_600 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_607 Int) (v_ArrVal_609 (Array Int Int)) (v_ArrVal_604 Int) (v_ArrVal_602 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_598)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_600))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_602)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_603))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_604)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_606))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_607)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_609) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_607) (not (<= v_ArrVal_598 (+ |c_ULTIMATE.start_test_fun_#t~mem15#1| 1))) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_602) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_604))))))))) is different from false [2022-11-21 17:26:07,615 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_598 Int) (v_ArrVal_600 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_607 Int) (v_ArrVal_609 (Array Int Int)) (v_ArrVal_604 Int) (v_ArrVal_602 Int)) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_598)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_600))) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_602)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_603))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_604)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_606))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_607)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_609) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_607) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_602) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_598) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_604)))))))))) is different from false [2022-11-21 17:26:07,651 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_598 Int) (v_ArrVal_600 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_607 Int) (v_ArrVal_609 (Array Int Int)) (v_ArrVal_604 Int) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_602 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_597))) (let ((.cse2 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_598)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_600))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_602)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_603))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse3 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_604)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_606))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_607) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_604) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_598) (< (select (select (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_607)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_609) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_602))))))))))) is different from false [2022-11-21 17:26:07,773 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_598 Int) (v_ArrVal_600 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_607 Int) (v_ArrVal_609 (Array Int Int)) (v_ArrVal_604 Int) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_602 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_597))) (let ((.cse2 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_598)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_600))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_602)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_603))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse3 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_604)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_606))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_607) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_604) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_598) (< (select (select (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_607)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_609) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_602))))))))))) |c_ULTIMATE.start_test_fun_#t~short7#1|) is different from false [2022-11-21 17:26:07,824 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 65 not checked. [2022-11-21 17:26:07,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580594856] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:26:07,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:26:07,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 17] total 42 [2022-11-21 17:26:07,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444593027] [2022-11-21 17:26:07,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:26:07,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-21 17:26:07,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:26:07,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-21 17:26:07,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=612, Unknown=14, NotChecked=938, Total=1806 [2022-11-21 17:26:07,831 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand has 43 states, 42 states have (on average 2.9285714285714284) internal successors, (123), 43 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:26:08,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:26:08,428 INFO L93 Difference]: Finished difference Result 146 states and 158 transitions. [2022-11-21 17:26:08,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-21 17:26:08,428 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.9285714285714284) internal successors, (123), 43 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-11-21 17:26:08,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:26:08,429 INFO L225 Difference]: With dead ends: 146 [2022-11-21 17:26:08,429 INFO L226 Difference]: Without dead ends: 145 [2022-11-21 17:26:08,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 59 SyntacticMatches, 12 SemanticMatches, 46 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=341, Invalid=823, Unknown=14, NotChecked=1078, Total=2256 [2022-11-21 17:26:08,431 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 111 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 536 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 17:26:08,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 95 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 158 Invalid, 0 Unknown, 536 Unchecked, 0.2s Time] [2022-11-21 17:26:08,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-11-21 17:26:08,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 114. [2022-11-21 17:26:08,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 1.0884955752212389) internal successors, (123), 113 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:26:08,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2022-11-21 17:26:08,452 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 42 [2022-11-21 17:26:08,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:26:08,454 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2022-11-21 17:26:08,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.9285714285714284) internal successors, (123), 43 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:26:08,455 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2022-11-21 17:26:08,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-21 17:26:08,464 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:26:08,464 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2022-11-21 17:26:08,476 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-21 17:26:08,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:26:08,672 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-21 17:26:08,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:26:08,672 INFO L85 PathProgramCache]: Analyzing trace with hash -653269534, now seen corresponding path program 4 times [2022-11-21 17:26:08,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:26:08,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250462396] [2022-11-21 17:26:08,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:26:08,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:26:08,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:26:09,342 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 61 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-21 17:26:09,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:26:09,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250462396] [2022-11-21 17:26:09,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250462396] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:26:09,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059027834] [2022-11-21 17:26:09,343 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-21 17:26:09,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:26:09,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:26:09,348 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:26:09,371 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-21 17:26:09,491 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-21 17:26:09,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 17:26:09,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-21 17:26:09,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:26:09,627 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-21 17:26:09,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 281 [2022-11-21 17:26:09,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 8 treesize of output 7 [2022-11-21 17:26:09,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-21 17:26:09,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-21 17:26:09,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:26:09,942 INFO L321 Elim1Store]: treesize reduction 36, result has 18.2 percent of original size [2022-11-21 17:26:09,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 230 treesize of output 199 [2022-11-21 17:26:09,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-21 17:26:10,054 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-21 17:26:10,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 9 treesize of output 7 [2022-11-21 17:26:11,657 INFO L321 Elim1Store]: treesize reduction 62, result has 41.5 percent of original size [2022-11-21 17:26:11,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 514 treesize of output 506 [2022-11-21 17:26:11,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 15 treesize of output 11 [2022-11-21 17:26:11,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-11-21 17:26:11,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-11-21 17:26:11,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-21 17:26:11,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 9 [2022-11-21 17:26:11,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 9 [2022-11-21 17:26:12,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 28 treesize of output 16 [2022-11-21 17:26:12,206 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-21 17:26:12,277 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 28 treesize of output 16 [2022-11-21 17:26:12,335 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-21 17:26:12,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 28 treesize of output 16 [2022-11-21 17:26:12,486 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-21 17:26:12,557 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 28 treesize of output 16 [2022-11-21 17:26:12,645 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-21 17:26:12,721 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 28 treesize of output 16 [2022-11-21 17:26:12,796 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-21 17:26:12,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 17:26:12,881 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:26:12,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:26:13,049 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_719 Int)) (or (not (<= v_ArrVal_719 (+ |c_ULTIMATE.start_test_fun_#t~mem15#1| 1))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_719)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_721) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))) is different from false [2022-11-21 17:26:13,064 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_719 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_719) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_719)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_721) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)))) is different from false [2022-11-21 17:26:13,075 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_719 Int) (v_ArrVal_718 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_718))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_719)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_721) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_719))))) is different from false [2022-11-21 17:26:13,131 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_719 Int) (v_ArrVal_716 Int) (v_ArrVal_718 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_716)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_718))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_719) (not (<= v_ArrVal_716 (+ |c_ULTIMATE.start_test_fun_#t~mem15#1| 1))) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_719)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_721) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))) is different from false [2022-11-21 17:26:13,169 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_719 Int) (v_ArrVal_716 Int) (v_ArrVal_718 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_716)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_718))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_716) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_719) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_719)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_721) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)))))) is different from false [2022-11-21 17:26:13,186 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_715 (Array Int Int)) (v_ArrVal_719 Int) (v_ArrVal_716 Int) (v_ArrVal_718 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_715))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_716)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_718))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_719) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_719)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_721) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_716))))))) is different from false [2022-11-21 17:26:13,270 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_715 (Array Int Int)) (v_ArrVal_719 Int) (v_ArrVal_716 Int) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_714 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_714)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_715))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_716)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_718))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (not (<= v_ArrVal_714 (+ |c_ULTIMATE.start_test_fun_#t~mem15#1| 1))) (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_719) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_719)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_721) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_716))))))) is different from false [2022-11-21 17:26:13,310 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_715 (Array Int Int)) (v_ArrVal_719 Int) (v_ArrVal_716 Int) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_714 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_714)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_715))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_716)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_718))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_714) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_719) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_719)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_721) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_716)))))))) is different from false [2022-11-21 17:26:13,334 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_712 (Array Int Int)) (v_ArrVal_715 (Array Int Int)) (v_ArrVal_719 Int) (v_ArrVal_716 Int) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_714 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_712))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_714)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_715))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_716)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_718))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_719) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_716) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_719)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_721) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_714))))))))) is different from false [2022-11-21 17:26:13,410 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_712 (Array Int Int)) (v_ArrVal_715 (Array Int Int)) (v_ArrVal_719 Int) (v_ArrVal_716 Int) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_714 Int) (v_ArrVal_710 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_710)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_712))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_714)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_715))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_716)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_718))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_719)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_721) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_710 (+ |c_ULTIMATE.start_test_fun_#t~mem15#1| 1))) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_719) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_714) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_716))))))))) is different from false [2022-11-21 17:26:13,463 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_712 (Array Int Int)) (v_ArrVal_715 (Array Int Int)) (v_ArrVal_719 Int) (v_ArrVal_716 Int) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_714 Int) (v_ArrVal_710 Int)) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_710)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_712))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_714)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_715))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_716)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_718))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_719)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_721) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_719) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_710) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_714) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_716)))))))))) is different from false [2022-11-21 17:26:13,495 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_712 (Array Int Int)) (v_ArrVal_715 (Array Int Int)) (v_ArrVal_719 Int) (v_ArrVal_716 Int) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_709 (Array Int Int)) (v_ArrVal_714 Int) (v_ArrVal_710 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_709))) (let ((.cse0 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_710)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_712))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_714)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_715))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_716)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_718))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_710) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_719)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_721) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_719) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_716) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_714))))))))))) is different from false [2022-11-21 17:26:13,675 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_712 (Array Int Int)) (v_ArrVal_715 (Array Int Int)) (v_ArrVal_719 Int) (v_ArrVal_707 Int) (v_ArrVal_716 Int) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_709 (Array Int Int)) (v_ArrVal_714 Int) (v_ArrVal_710 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_707)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_709))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_710)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_712))) (let ((.cse0 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_714)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_715))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse3 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_716)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_718))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_714) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_719) (not (<= v_ArrVal_707 (+ |c_ULTIMATE.start_test_fun_#t~mem15#1| 1))) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_716) (< (select (select (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_719)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_721) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_710))))))))))) is different from false [2022-11-21 17:26:13,750 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_712 (Array Int Int)) (v_ArrVal_715 (Array Int Int)) (v_ArrVal_719 Int) (v_ArrVal_707 Int) (v_ArrVal_716 Int) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_709 (Array Int Int)) (v_ArrVal_714 Int) (v_ArrVal_710 Int)) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_707)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_709))) (let ((.cse5 (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_710)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_712))) (let ((.cse0 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_714)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_715))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_716)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_718))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_714) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_719) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_707) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_716) (< (select (select (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_719)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_721) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_710)))))))))))) is different from false [2022-11-21 17:26:13,797 WARN L837 $PredicateComparison]: unable to prove that (or (not (< |c_ULTIMATE.start_test_fun_#t~mem10#1| |c_ULTIMATE.start_test_fun_#t~mem9#1|)) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_712 (Array Int Int)) (v_ArrVal_715 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_719 Int) (v_ArrVal_707 Int) (v_ArrVal_716 Int) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_709 (Array Int Int)) (v_ArrVal_714 Int) (v_ArrVal_710 Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_706))) (let ((.cse3 (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse8 (store (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_707)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_709))) (let ((.cse4 (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_710)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_712))) (let ((.cse0 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_714)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_715))) (let ((.cse5 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_716)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_718))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_714) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_719)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_721) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_719) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_707) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_710) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_716)))))))))))))) is different from false [2022-11-21 17:26:14,219 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_712 (Array Int Int)) (v_ArrVal_715 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_719 Int) (v_ArrVal_707 Int) (v_ArrVal_716 Int) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_709 (Array Int Int)) (v_ArrVal_714 Int) (v_ArrVal_710 Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_706))) (let ((.cse3 (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse8 (store (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_707)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_709))) (let ((.cse4 (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_710)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_712))) (let ((.cse0 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_714)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_715))) (let ((.cse5 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_716)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_718))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_714) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_719)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_721) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_719) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_707) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_710) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_716))))))))))))) (forall ((|ULTIMATE.start_test_fun_~y_ref~0#1.offset| Int)) (let ((.cse10 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (or (< .cse10 1) (< (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ .cse10 1)))))) is different from false [2022-11-21 17:26:14,254 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 92 not checked. [2022-11-21 17:26:14,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059027834] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:26:14,254 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:26:14,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18, 22] total 49 [2022-11-21 17:26:14,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315526580] [2022-11-21 17:26:14,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:26:14,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-21 17:26:14,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:26:14,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-21 17:26:14,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=853, Unknown=23, NotChecked=1232, Total=2352 [2022-11-21 17:26:14,257 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand has 49 states, 49 states have (on average 2.5918367346938775) internal successors, (127), 49 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:26:17,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:26:17,884 INFO L93 Difference]: Finished difference Result 169 states and 185 transitions. [2022-11-21 17:26:17,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-21 17:26:17,885 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.5918367346938775) internal successors, (127), 49 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-11-21 17:26:17,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:26:17,885 INFO L225 Difference]: With dead ends: 169 [2022-11-21 17:26:17,885 INFO L226 Difference]: Without dead ends: 86 [2022-11-21 17:26:17,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 1292 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1132, Invalid=4160, Unknown=28, NotChecked=2512, Total=7832 [2022-11-21 17:26:17,888 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 300 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 70 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 739 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 17:26:17,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 43 Invalid, 1105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 289 Invalid, 7 Unknown, 739 Unchecked, 0.5s Time] [2022-11-21 17:26:17,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-21 17:26:17,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2022-11-21 17:26:17,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.0266666666666666) internal successors, (77), 75 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:26:17,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2022-11-21 17:26:17,896 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 48 [2022-11-21 17:26:17,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:26:17,897 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2022-11-21 17:26:17,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.5918367346938775) internal successors, (127), 49 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:26:17,897 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2022-11-21 17:26:17,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-21 17:26:17,898 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:26:17,898 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2022-11-21 17:26:17,904 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-21 17:26:18,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:26:18,104 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-21 17:26:18,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:26:18,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1912856694, now seen corresponding path program 5 times [2022-11-21 17:26:18,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:26:18,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592312228] [2022-11-21 17:26:18,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:26:18,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:26:18,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:26:19,434 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:26:19,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:26:19,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592312228] [2022-11-21 17:26:19,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592312228] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:26:19,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427379033] [2022-11-21 17:26:19,435 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-21 17:26:19,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:26:19,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:26:19,437 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:26:19,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d4ec570-c2f5-4a94-bdd4-83182008ff6e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-21 17:26:19,681 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-11-21 17:26:19,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 17:26:19,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-21 17:26:19,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:26:19,824 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-21 17:26:19,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2022-11-21 17:26:19,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 8 treesize of output 7 [2022-11-21 17:26:19,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-21 17:26:19,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-21 17:26:20,395 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-21 17:26:20,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 111 treesize of output 68 [2022-11-21 17:26:20,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-11-21 17:26:20,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:26:20,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:26:20,437 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:26:20,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 35 [2022-11-21 17:26:20,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-11-21 17:26:20,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-21 17:26:20,971 INFO L321 Elim1Store]: treesize reduction 28, result has 55.6 percent of original size [2022-11-21 17:26:20,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 297 treesize of output 292 [2022-11-21 17:26:21,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 5 treesize of output 3 [2022-11-21 17:26:21,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 [2022-11-21 17:26:21,214 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 17:26:21,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 18 treesize of output 24 [2022-11-21 17:26:21,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 [2022-11-21 17:26:21,375 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 17:26:21,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 18 treesize of output 24 [2022-11-21 17:26:21,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 [2022-11-21 17:26:21,640 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-21 17:26:21,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 39 treesize of output 42 [2022-11-21 17:26:21,807 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-21 17:26:21,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 40 treesize of output 43 [2022-11-21 17:26:22,042 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-21 17:26:22,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 40 treesize of output 43 [2022-11-21 17:26:22,242 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-21 17:26:22,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 40 treesize of output 43 [2022-11-21 17:26:22,483 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-21 17:26:22,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 40 treesize of output 43 [2022-11-21 17:26:22,711 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-21 17:26:22,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 40 treesize of output 43 [2022-11-21 17:26:22,961 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-21 17:26:22,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 40 treesize of output 43 [2022-11-21 17:26:23,128 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-21 17:26:23,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 40 treesize of output 43 [2022-11-21 17:26:23,340 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-21 17:26:23,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 40 treesize of output 43 [2022-11-21 17:26:23,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 17:26:23,442 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:26:23,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:32:29,820 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 Int) (v_ArrVal_851 Int) (v_ArrVal_860 Int) (v_ArrVal_849 Int) (v_ArrVal_848 Int) (v_ArrVal_858 Int) (v_ArrVal_846 Int) (v_ArrVal_856 Int) (v_ArrVal_844 Int) (v_ArrVal_854 Int) (v_ArrVal_840 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_840))) (let ((.cse6 (select .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse18 (store .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_841)))) (let ((.cse3 (select .cse18 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_844)))) (let ((.cse4 (select .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse16 (store .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_846)))) (let ((.cse10 (select .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_848)))) (let ((.cse9 (select .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse14 (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_849)))) (let ((.cse1 (select .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse13 (store .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_851)))) (let ((.cse5 (select .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse12 (store .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_854)))) (let ((.cse2 (select .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse11 (store .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_856)))) (let ((.cse7 (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse8 (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_858)))) (let ((.cse0 (select .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_860 1)) (< (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_851 1)) (< (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_856 1)) (< (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_844 1)) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_846) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_854) (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_841) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_858) (< 2147483647 v_ArrVal_841) (< (select (select (store .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_860)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_849) (< (select .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_848 1)))))))))))))))))))))))) is different from false [2022-11-21 17:33:19,059 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 172 refuted. 13 times theorem prover too weak. 0 trivial. 39 not checked. [2022-11-21 17:33:19,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427379033] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:33:19,059 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:33:19,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 29, 31] total 77 [2022-11-21 17:33:19,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826528455] [2022-11-21 17:33:19,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:33:19,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-11-21 17:33:19,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:33:19,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-11-21 17:33:19,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=958, Invalid=4712, Unknown=186, NotChecked=150, Total=6006 [2022-11-21 17:33:19,062 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand has 78 states, 77 states have (on average 2.7662337662337664) internal successors, (213), 78 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:33:25,464 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|))) (let ((.cse0 (<= .cse2 1)) (.cse1 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (and (= |c_ULTIMATE.start_test_fun_~c~0#1.offset| 0) (or .cse0 .cse1) .cse0 (or (and .cse1 (<= (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483646)) (<= .cse2 3)) (not .cse1) (forall ((v_ArrVal_841 Int) (v_ArrVal_851 Int) (v_ArrVal_860 Int) (v_ArrVal_849 Int) (v_ArrVal_848 Int) (v_ArrVal_858 Int) (v_ArrVal_846 Int) (v_ArrVal_856 Int) (v_ArrVal_844 Int) (v_ArrVal_854 Int) (v_ArrVal_840 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_840))) (let ((.cse9 (select .cse22 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse21 (store .cse22 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_841)))) (let ((.cse6 (select .cse21 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse20 (store .cse21 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_844)))) (let ((.cse7 (select .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_846)))) (let ((.cse13 (select .cse19 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse18 (store .cse19 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_848)))) (let ((.cse12 (select .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_849)))) (let ((.cse4 (select .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse16 (store .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_851)))) (let ((.cse8 (select .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_854)))) (let ((.cse5 (select .cse15 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse14 (store .cse15 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_856)))) (let ((.cse10 (select .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse11 (store .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_858)))) (let ((.cse3 (select .cse11 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_860 1)) (< (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_851 1)) (< (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_856 1)) (< (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_844 1)) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_846) (< (+ (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_854) (< (+ (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_841) (< (+ (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_858) (< 2147483647 v_ArrVal_841) (< (select (select (store .cse11 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_860)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_849) (< (select .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_848 1)))))))))))))))))))))))) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)))) is different from false [2022-11-21 17:33:29,338 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse22 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|))) (let ((.cse0 (<= .cse22 1)) (.cse1 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (and (= |c_ULTIMATE.start_test_fun_~c~0#1.offset| 0) (or .cse0 .cse1) .cse0 (not .cse1) (forall ((v_ArrVal_841 Int) (v_ArrVal_851 Int) (v_ArrVal_860 Int) (v_ArrVal_849 Int) (v_ArrVal_848 Int) (v_ArrVal_858 Int) (v_ArrVal_846 Int) (v_ArrVal_856 Int) (v_ArrVal_844 Int) (v_ArrVal_854 Int) (v_ArrVal_840 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_840))) (let ((.cse8 (select .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse20 (store .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_841)))) (let ((.cse5 (select .cse20 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_844)))) (let ((.cse6 (select .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse18 (store .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_846)))) (let ((.cse12 (select .cse18 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_848)))) (let ((.cse11 (select .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse16 (store .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_849)))) (let ((.cse3 (select .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_851)))) (let ((.cse7 (select .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse14 (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_854)))) (let ((.cse4 (select .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse13 (store .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_856)))) (let ((.cse9 (select .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse10 (store .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_858)))) (let ((.cse2 (select .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_860 1)) (< (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_851 1)) (< (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_856 1)) (< (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_844 1)) (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_846) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_854) (< (+ (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_841) (< (+ (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_858) (< 2147483647 v_ArrVal_841) (< (select (select (store .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_860)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_849) (< (select .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_848 1)))))))))))))))))))))))) (or .cse1 (<= .cse22 3)) (<= .cse22 2147483647) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)))) is different from false [2022-11-21 17:33:33,118 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse22 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|))) (let ((.cse0 (<= .cse22 1)) (.cse1 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (and (= |c_ULTIMATE.start_test_fun_~c~0#1.offset| 0) (or .cse0 .cse1) .cse0 (<= |c_ULTIMATE.start_test_fun_#t~mem14#1| (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (not .cse1) (forall ((v_ArrVal_841 Int) (v_ArrVal_851 Int) (v_ArrVal_860 Int) (v_ArrVal_849 Int) (v_ArrVal_848 Int) (v_ArrVal_858 Int) (v_ArrVal_846 Int) (v_ArrVal_856 Int) (v_ArrVal_844 Int) (v_ArrVal_854 Int) (v_ArrVal_840 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_840))) (let ((.cse8 (select .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse20 (store .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_841)))) (let ((.cse5 (select .cse20 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_844)))) (let ((.cse6 (select .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse18 (store .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_846)))) (let ((.cse12 (select .cse18 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_848)))) (let ((.cse11 (select .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse16 (store .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_849)))) (let ((.cse3 (select .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_851)))) (let ((.cse7 (select .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse14 (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_854)))) (let ((.cse4 (select .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse13 (store .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_856)))) (let ((.cse9 (select .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse10 (store .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_858)))) (let ((.cse2 (select .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_860 1)) (< (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_851 1)) (< (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_856 1)) (< (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_844 1)) (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_846) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_854) (< (+ (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_841) (< (+ (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_858) (< 2147483647 v_ArrVal_841) (< (select (select (store .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_860)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_849) (< (select .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_848 1)))))))))))))))))))))))) (or .cse1 (<= .cse22 3)) (<= .cse22 2147483647) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)))) is different from false [2022-11-21 17:33:36,873 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|))) (let ((.cse0 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse2 (<= .cse1 2))) (and (= |c_ULTIMATE.start_test_fun_~c~0#1.offset| 0) (or (and .cse0 (<= (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483646)) (<= .cse1 3)) (not .cse0) .cse2 (forall ((v_ArrVal_841 Int) (v_ArrVal_851 Int) (v_ArrVal_860 Int) (v_ArrVal_849 Int) (v_ArrVal_848 Int) (v_ArrVal_858 Int) (v_ArrVal_846 Int) (v_ArrVal_856 Int) (v_ArrVal_844 Int) (v_ArrVal_854 Int) (v_ArrVal_840 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_840))) (let ((.cse9 (select .cse22 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse21 (store .cse22 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_841)))) (let ((.cse6 (select .cse21 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse20 (store .cse21 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_844)))) (let ((.cse7 (select .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_846)))) (let ((.cse13 (select .cse19 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse18 (store .cse19 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_848)))) (let ((.cse12 (select .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_849)))) (let ((.cse4 (select .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse16 (store .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_851)))) (let ((.cse8 (select .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_854)))) (let ((.cse5 (select .cse15 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse14 (store .cse15 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_856)))) (let ((.cse10 (select .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse11 (store .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_858)))) (let ((.cse3 (select .cse11 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_860 1)) (< (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_851 1)) (< (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_856 1)) (< (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_844 1)) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_846) (< (+ (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_854) (< (+ (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_841) (< (+ (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_858) (< 2147483647 v_ArrVal_841) (< (select (select (store .cse11 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_860)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_849) (< (select .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_848 1)))))))))))))))))))))))) (or .cse0 .cse2) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)))) is different from false [2022-11-21 17:33:40,451 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse22 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|))) (let ((.cse1 (<= .cse22 2)) (.cse0 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (and (= |c_ULTIMATE.start_test_fun_~c~0#1.offset| 0) (not .cse0) .cse1 (forall ((v_ArrVal_841 Int) (v_ArrVal_851 Int) (v_ArrVal_860 Int) (v_ArrVal_849 Int) (v_ArrVal_848 Int) (v_ArrVal_858 Int) (v_ArrVal_846 Int) (v_ArrVal_856 Int) (v_ArrVal_844 Int) (v_ArrVal_854 Int) (v_ArrVal_840 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_840))) (let ((.cse8 (select .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse20 (store .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_841)))) (let ((.cse5 (select .cse20 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_844)))) (let ((.cse6 (select .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse18 (store .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_846)))) (let ((.cse12 (select .cse18 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_848)))) (let ((.cse11 (select .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse16 (store .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_849)))) (let ((.cse3 (select .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_851)))) (let ((.cse7 (select .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse14 (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_854)))) (let ((.cse4 (select .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse13 (store .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_856)))) (let ((.cse9 (select .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse10 (store .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_858)))) (let ((.cse2 (select .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_860 1)) (< (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_851 1)) (< (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_856 1)) (< (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_844 1)) (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_846) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_854) (< (+ (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_841) (< (+ (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_858) (< 2147483647 v_ArrVal_841) (< (select (select (store .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_860)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_849) (< (select .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_848 1)))))))))))))))))))))))) (or .cse0 .cse1) (or .cse0 (<= .cse22 3)) (<= .cse22 2147483647) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)))) is different from false [2022-11-21 17:33:43,683 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse22 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|))) (let ((.cse1 (<= .cse22 2)) (.cse0 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (and (= |c_ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= |c_ULTIMATE.start_test_fun_#t~mem14#1| (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (not .cse0) .cse1 (forall ((v_ArrVal_841 Int) (v_ArrVal_851 Int) (v_ArrVal_860 Int) (v_ArrVal_849 Int) (v_ArrVal_848 Int) (v_ArrVal_858 Int) (v_ArrVal_846 Int) (v_ArrVal_856 Int) (v_ArrVal_844 Int) (v_ArrVal_854 Int) (v_ArrVal_840 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_840))) (let ((.cse8 (select .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse20 (store .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_841)))) (let ((.cse5 (select .cse20 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_844)))) (let ((.cse6 (select .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse18 (store .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_846)))) (let ((.cse12 (select .cse18 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_848)))) (let ((.cse11 (select .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse16 (store .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_849)))) (let ((.cse3 (select .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_851)))) (let ((.cse7 (select .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse14 (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_854)))) (let ((.cse4 (select .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse13 (store .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_856)))) (let ((.cse9 (select .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse10 (store .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_858)))) (let ((.cse2 (select .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_860 1)) (< (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_851 1)) (< (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_856 1)) (< (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_844 1)) (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_846) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_854) (< (+ (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_841) (< (+ (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_858) (< 2147483647 v_ArrVal_841) (< (select (select (store .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_860)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_849) (< (select .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_848 1)))))))))))))))))))))))) (or .cse0 .cse1) (or .cse0 (<= .cse22 3)) (<= .cse22 2147483647) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)))) is different from false [2022-11-21 17:33:46,906 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse1 (<= (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 3))) (and (= |c_ULTIMATE.start_test_fun_~c~0#1.offset| 0) (or (and .cse0 (<= (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483646)) .cse1) (not .cse0) .cse1 (forall ((v_ArrVal_841 Int) (v_ArrVal_851 Int) (v_ArrVal_860 Int) (v_ArrVal_849 Int) (v_ArrVal_848 Int) (v_ArrVal_858 Int) (v_ArrVal_846 Int) (v_ArrVal_856 Int) (v_ArrVal_844 Int) (v_ArrVal_854 Int) (v_ArrVal_840 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_840))) (let ((.cse8 (select .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse20 (store .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_841)))) (let ((.cse5 (select .cse20 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_844)))) (let ((.cse6 (select .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse18 (store .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_846)))) (let ((.cse12 (select .cse18 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_848)))) (let ((.cse11 (select .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse16 (store .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_849)))) (let ((.cse3 (select .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_851)))) (let ((.cse7 (select .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse14 (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_854)))) (let ((.cse4 (select .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse13 (store .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_856)))) (let ((.cse9 (select .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse10 (store .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_858)))) (let ((.cse2 (select .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_860 1)) (< (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_851 1)) (< (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_856 1)) (< (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_844 1)) (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_846) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_854) (< (+ (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_841) (< (+ (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_858) (< 2147483647 v_ArrVal_841) (< (select (select (store .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_860)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_849) (< (select .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_848 1)))))))))))))))))))))))) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0))) is different from false [2022-11-21 17:33:50,107 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse22 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|))) (let ((.cse0 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse1 (<= .cse22 3))) (and (= |c_ULTIMATE.start_test_fun_~c~0#1.offset| 0) (not .cse0) .cse1 (forall ((v_ArrVal_841 Int) (v_ArrVal_851 Int) (v_ArrVal_860 Int) (v_ArrVal_849 Int) (v_ArrVal_848 Int) (v_ArrVal_858 Int) (v_ArrVal_846 Int) (v_ArrVal_856 Int) (v_ArrVal_844 Int) (v_ArrVal_854 Int) (v_ArrVal_840 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_840))) (let ((.cse8 (select .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse20 (store .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_841)))) (let ((.cse5 (select .cse20 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_844)))) (let ((.cse6 (select .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse18 (store .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_846)))) (let ((.cse12 (select .cse18 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_848)))) (let ((.cse11 (select .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse16 (store .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_849)))) (let ((.cse3 (select .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_851)))) (let ((.cse7 (select .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse14 (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_854)))) (let ((.cse4 (select .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse13 (store .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_856)))) (let ((.cse9 (select .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse10 (store .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_858)))) (let ((.cse2 (select .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_860 1)) (< (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_851 1)) (< (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_856 1)) (< (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_844 1)) (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_846) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_854) (< (+ (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_841) (< (+ (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_858) (< 2147483647 v_ArrVal_841) (< (select (select (store .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_860)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_849) (< (select .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_848 1)))))))))))))))))))))))) (or .cse0 .cse1) (<= .cse22 2147483647) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)))) is different from false [2022-11-21 17:33:53,256 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse22 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|))) (let ((.cse0 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse1 (<= .cse22 3))) (and (= |c_ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= |c_ULTIMATE.start_test_fun_#t~mem14#1| (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (not .cse0) .cse1 (forall ((v_ArrVal_841 Int) (v_ArrVal_851 Int) (v_ArrVal_860 Int) (v_ArrVal_849 Int) (v_ArrVal_848 Int) (v_ArrVal_858 Int) (v_ArrVal_846 Int) (v_ArrVal_856 Int) (v_ArrVal_844 Int) (v_ArrVal_854 Int) (v_ArrVal_840 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_840))) (let ((.cse8 (select .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse20 (store .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_841)))) (let ((.cse5 (select .cse20 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_844)))) (let ((.cse6 (select .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse18 (store .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_846)))) (let ((.cse12 (select .cse18 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_848)))) (let ((.cse11 (select .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse16 (store .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_849)))) (let ((.cse3 (select .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_851)))) (let ((.cse7 (select .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse14 (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_854)))) (let ((.cse4 (select .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse13 (store .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_856)))) (let ((.cse9 (select .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse10 (store .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_858)))) (let ((.cse2 (select .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_860 1)) (< (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_851 1)) (< (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_856 1)) (< (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_844 1)) (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_846) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_854) (< (+ (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_841) (< (+ (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_858) (< 2147483647 v_ArrVal_841) (< (select (select (store .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_860)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_849) (< (select .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_848 1)))))))))))))))))))))))) (or .cse0 .cse1) (<= .cse22 2147483647) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)))) is different from false [2022-11-21 17:33:56,907 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse1 (<= (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 4))) (and (= |c_ULTIMATE.start_test_fun_~c~0#1.offset| 0) (or (and .cse0 (<= (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483646)) .cse1) (not .cse0) (forall ((v_ArrVal_841 Int) (v_ArrVal_851 Int) (v_ArrVal_860 Int) (v_ArrVal_849 Int) (v_ArrVal_848 Int) (v_ArrVal_858 Int) (v_ArrVal_846 Int) (v_ArrVal_856 Int) (v_ArrVal_844 Int) (v_ArrVal_854 Int) (v_ArrVal_840 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_840))) (let ((.cse8 (select .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse20 (store .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_841)))) (let ((.cse5 (select .cse20 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_844)))) (let ((.cse6 (select .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse18 (store .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_846)))) (let ((.cse12 (select .cse18 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_848)))) (let ((.cse11 (select .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse16 (store .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_849)))) (let ((.cse3 (select .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_851)))) (let ((.cse7 (select .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse14 (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_854)))) (let ((.cse4 (select .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse13 (store .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_856)))) (let ((.cse9 (select .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse10 (store .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_858)))) (let ((.cse2 (select .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_860 1)) (< (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_851 1)) (< (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_856 1)) (< (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_844 1)) (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_846) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_854) (< (+ (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_841) (< (+ (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_858) (< 2147483647 v_ArrVal_841) (< (select (select (store .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_860)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_849) (< (select .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_848 1)))))))))))))))))))))))) .cse1 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0))) is different from false [2022-11-21 17:34:00,057 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|))) (let ((.cse0 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse2 (<= .cse1 4))) (and (= |c_ULTIMATE.start_test_fun_~c~0#1.offset| 0) (or (and .cse0 (<= .cse1 2147483647)) .cse2) (not .cse0) (forall ((v_ArrVal_841 Int) (v_ArrVal_851 Int) (v_ArrVal_860 Int) (v_ArrVal_849 Int) (v_ArrVal_848 Int) (v_ArrVal_858 Int) (v_ArrVal_846 Int) (v_ArrVal_856 Int) (v_ArrVal_844 Int) (v_ArrVal_854 Int) (v_ArrVal_840 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_840))) (let ((.cse9 (select .cse22 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse21 (store .cse22 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_841)))) (let ((.cse6 (select .cse21 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse20 (store .cse21 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_844)))) (let ((.cse7 (select .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_846)))) (let ((.cse13 (select .cse19 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse18 (store .cse19 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_848)))) (let ((.cse12 (select .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_849)))) (let ((.cse4 (select .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse16 (store .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_851)))) (let ((.cse8 (select .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_854)))) (let ((.cse5 (select .cse15 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse14 (store .cse15 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_856)))) (let ((.cse10 (select .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse11 (store .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_858)))) (let ((.cse3 (select .cse11 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_860 1)) (< (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_851 1)) (< (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_856 1)) (< (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_844 1)) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_846) (< (+ (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_854) (< (+ (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_841) (< (+ (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_858) (< 2147483647 v_ArrVal_841) (< (select (select (store .cse11 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_860)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_849) (< (select .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_848 1)))))))))))))))))))))))) .cse2 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)))) is different from false [2022-11-21 17:34:03,362 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|))) (let ((.cse0 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse2 (<= .cse1 4))) (and (= |c_ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= |c_ULTIMATE.start_test_fun_#t~mem14#1| (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (or (and .cse0 (<= .cse1 2147483647)) .cse2) (not .cse0) (forall ((v_ArrVal_841 Int) (v_ArrVal_851 Int) (v_ArrVal_860 Int) (v_ArrVal_849 Int) (v_ArrVal_848 Int) (v_ArrVal_858 Int) (v_ArrVal_846 Int) (v_ArrVal_856 Int) (v_ArrVal_844 Int) (v_ArrVal_854 Int) (v_ArrVal_840 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_840))) (let ((.cse9 (select .cse22 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse21 (store .cse22 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_841)))) (let ((.cse6 (select .cse21 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse20 (store .cse21 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_844)))) (let ((.cse7 (select .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_846)))) (let ((.cse13 (select .cse19 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse18 (store .cse19 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_848)))) (let ((.cse12 (select .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_849)))) (let ((.cse4 (select .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse16 (store .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_851)))) (let ((.cse8 (select .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_854)))) (let ((.cse5 (select .cse15 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse14 (store .cse15 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_856)))) (let ((.cse10 (select .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse11 (store .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_858)))) (let ((.cse3 (select .cse11 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_860 1)) (< (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_851 1)) (< (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_856 1)) (< (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_844 1)) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_846) (< (+ (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_854) (< (+ (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_841) (< (+ (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_858) (< 2147483647 v_ArrVal_841) (< (select (select (store .cse11 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_860)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_849) (< (select .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_848 1)))))))))))))))))))))))) .cse2 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)))) is different from false [2022-11-21 17:34:06,833 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse0 (<= (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 5))) (and (= |c_ULTIMATE.start_test_fun_~c~0#1.offset| 0) (or .cse0 (and .cse1 (<= (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483646))) (not .cse1) .cse0 (forall ((v_ArrVal_841 Int) (v_ArrVal_851 Int) (v_ArrVal_860 Int) (v_ArrVal_849 Int) (v_ArrVal_848 Int) (v_ArrVal_858 Int) (v_ArrVal_846 Int) (v_ArrVal_856 Int) (v_ArrVal_844 Int) (v_ArrVal_854 Int) (v_ArrVal_840 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_840))) (let ((.cse8 (select .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse20 (store .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_841)))) (let ((.cse5 (select .cse20 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_844)))) (let ((.cse6 (select .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse18 (store .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_846)))) (let ((.cse12 (select .cse18 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_848)))) (let ((.cse11 (select .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse16 (store .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_849)))) (let ((.cse3 (select .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_851)))) (let ((.cse7 (select .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse14 (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_854)))) (let ((.cse4 (select .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse13 (store .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_856)))) (let ((.cse9 (select .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse10 (store .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_858)))) (let ((.cse2 (select .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_860 1)) (< (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_851 1)) (< (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_856 1)) (< (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_844 1)) (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_846) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_854) (< (+ (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_841) (< (+ (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_858) (< 2147483647 v_ArrVal_841) (< (select (select (store .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_860)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_849) (< (select .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_848 1)))))))))))))))))))))))) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0))) is different from false [2022-11-21 17:34:10,183 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse22 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|))) (let ((.cse0 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse1 (<= .cse22 5))) (and (= |c_ULTIMATE.start_test_fun_~c~0#1.offset| 0) (not .cse0) .cse1 (forall ((v_ArrVal_841 Int) (v_ArrVal_851 Int) (v_ArrVal_860 Int) (v_ArrVal_849 Int) (v_ArrVal_848 Int) (v_ArrVal_858 Int) (v_ArrVal_846 Int) (v_ArrVal_856 Int) (v_ArrVal_844 Int) (v_ArrVal_854 Int) (v_ArrVal_840 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_840))) (let ((.cse8 (select .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse20 (store .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_841)))) (let ((.cse5 (select .cse20 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_844)))) (let ((.cse6 (select .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse18 (store .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_846)))) (let ((.cse12 (select .cse18 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_848)))) (let ((.cse11 (select .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse16 (store .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_849)))) (let ((.cse3 (select .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_851)))) (let ((.cse7 (select .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse14 (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_854)))) (let ((.cse4 (select .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse13 (store .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_856)))) (let ((.cse9 (select .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse10 (store .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_858)))) (let ((.cse2 (select .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_860 1)) (< (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_851 1)) (< (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_856 1)) (< (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_844 1)) (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_846) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_854) (< (+ (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_841) (< (+ (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_858) (< 2147483647 v_ArrVal_841) (< (select (select (store .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_860)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_849) (< (select .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_848 1)))))))))))))))))))))))) (or (and .cse0 (<= .cse22 2147483647)) .cse1) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)))) is different from false [2022-11-21 17:34:13,543 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse22 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|))) (let ((.cse0 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse1 (<= .cse22 5))) (and (= |c_ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= |c_ULTIMATE.start_test_fun_#t~mem14#1| (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (not .cse0) .cse1 (forall ((v_ArrVal_841 Int) (v_ArrVal_851 Int) (v_ArrVal_860 Int) (v_ArrVal_849 Int) (v_ArrVal_848 Int) (v_ArrVal_858 Int) (v_ArrVal_846 Int) (v_ArrVal_856 Int) (v_ArrVal_844 Int) (v_ArrVal_854 Int) (v_ArrVal_840 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_840))) (let ((.cse8 (select .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse20 (store .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_841)))) (let ((.cse5 (select .cse20 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_844)))) (let ((.cse6 (select .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse18 (store .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_846)))) (let ((.cse12 (select .cse18 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_848)))) (let ((.cse11 (select .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse16 (store .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_849)))) (let ((.cse3 (select .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_851)))) (let ((.cse7 (select .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse14 (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_854)))) (let ((.cse4 (select .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse13 (store .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_856)))) (let ((.cse9 (select .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse10 (store .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_858)))) (let ((.cse2 (select .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_860 1)) (< (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_851 1)) (< (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_856 1)) (< (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_844 1)) (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_846) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_854) (< (+ (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_841) (< (+ (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_858) (< 2147483647 v_ArrVal_841) (< (select (select (store .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_860)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_849) (< (select .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_848 1)))))))))))))))))))))))) (or (and .cse0 (<= .cse22 2147483647)) .cse1) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)))) is different from false [2022-11-21 17:34:16,908 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse1 (<= (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 6))) (and (= |c_ULTIMATE.start_test_fun_~c~0#1.offset| 0) (or (and .cse0 (<= (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483646)) .cse1) (not .cse0) .cse1 (forall ((v_ArrVal_841 Int) (v_ArrVal_851 Int) (v_ArrVal_860 Int) (v_ArrVal_849 Int) (v_ArrVal_848 Int) (v_ArrVal_858 Int) (v_ArrVal_846 Int) (v_ArrVal_856 Int) (v_ArrVal_844 Int) (v_ArrVal_854 Int) (v_ArrVal_840 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_840))) (let ((.cse8 (select .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse20 (store .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_841)))) (let ((.cse5 (select .cse20 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_844)))) (let ((.cse6 (select .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse18 (store .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_846)))) (let ((.cse12 (select .cse18 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_848)))) (let ((.cse11 (select .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse16 (store .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_849)))) (let ((.cse3 (select .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_851)))) (let ((.cse7 (select .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse14 (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_854)))) (let ((.cse4 (select .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse13 (store .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_856)))) (let ((.cse9 (select .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse10 (store .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_858)))) (let ((.cse2 (select .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_860 1)) (< (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_851 1)) (< (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_856 1)) (< (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_844 1)) (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_846) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_854) (< (+ (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_841) (< (+ (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_858) (< 2147483647 v_ArrVal_841) (< (select (select (store .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_860)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_849) (< (select .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_848 1)))))))))))))))))))))))) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0))) is different from false [2022-11-21 17:34:20,311 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|))) (let ((.cse0 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse2 (<= .cse1 6))) (and (= |c_ULTIMATE.start_test_fun_~c~0#1.offset| 0) (or (and .cse0 (<= .cse1 2147483647)) .cse2) (not .cse0) .cse2 (forall ((v_ArrVal_841 Int) (v_ArrVal_851 Int) (v_ArrVal_860 Int) (v_ArrVal_849 Int) (v_ArrVal_848 Int) (v_ArrVal_858 Int) (v_ArrVal_846 Int) (v_ArrVal_856 Int) (v_ArrVal_844 Int) (v_ArrVal_854 Int) (v_ArrVal_840 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_840))) (let ((.cse9 (select .cse22 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse21 (store .cse22 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_841)))) (let ((.cse6 (select .cse21 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse20 (store .cse21 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_844)))) (let ((.cse7 (select .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_846)))) (let ((.cse13 (select .cse19 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse18 (store .cse19 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_848)))) (let ((.cse12 (select .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_849)))) (let ((.cse4 (select .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse16 (store .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_851)))) (let ((.cse8 (select .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_854)))) (let ((.cse5 (select .cse15 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse14 (store .cse15 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_856)))) (let ((.cse10 (select .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse11 (store .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_858)))) (let ((.cse3 (select .cse11 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_860 1)) (< (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_851 1)) (< (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_856 1)) (< (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_844 1)) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_846) (< (+ (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_854) (< (+ (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_841) (< (+ (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_858) (< 2147483647 v_ArrVal_841) (< (select (select (store .cse11 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_860)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_849) (< (select .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_848 1)))))))))))))))))))))))) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)))) is different from false [2022-11-21 17:34:24,158 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|))) (let ((.cse0 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse2 (<= .cse1 6))) (and (= |c_ULTIMATE.start_test_fun_~c~0#1.offset| 0) (or (and .cse0 (<= .cse1 2147483647)) .cse2) (<= |c_ULTIMATE.start_test_fun_#t~mem14#1| (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (not .cse0) .cse2 (forall ((v_ArrVal_841 Int) (v_ArrVal_851 Int) (v_ArrVal_860 Int) (v_ArrVal_849 Int) (v_ArrVal_848 Int) (v_ArrVal_858 Int) (v_ArrVal_846 Int) (v_ArrVal_856 Int) (v_ArrVal_844 Int) (v_ArrVal_854 Int) (v_ArrVal_840 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_840))) (let ((.cse9 (select .cse22 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse21 (store .cse22 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_841)))) (let ((.cse6 (select .cse21 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse20 (store .cse21 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_844)))) (let ((.cse7 (select .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_846)))) (let ((.cse13 (select .cse19 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse18 (store .cse19 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_848)))) (let ((.cse12 (select .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_849)))) (let ((.cse4 (select .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse16 (store .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_851)))) (let ((.cse8 (select .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_854)))) (let ((.cse5 (select .cse15 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse14 (store .cse15 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_856)))) (let ((.cse10 (select .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse11 (store .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_858)))) (let ((.cse3 (select .cse11 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_860 1)) (< (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_851 1)) (< (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_856 1)) (< (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_844 1)) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_846) (< (+ (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_854) (< (+ (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_841) (< (+ (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_858) (< 2147483647 v_ArrVal_841) (< (select (select (store .cse11 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_860)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_849) (< (select .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_848 1)))))))))))))))))))))))) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)))) is different from false [2022-11-21 17:34:27,908 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse23 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|))) (let ((.cse1 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse2 (<= .cse23 7))) (and (<= (select .cse0 0) 2147483646) (= |c_ULTIMATE.start_test_fun_~c~0#1.offset| 0) (not .cse1) .cse2 (forall ((v_ArrVal_841 Int) (v_ArrVal_851 Int) (v_ArrVal_860 Int) (v_ArrVal_849 Int) (v_ArrVal_848 Int) (v_ArrVal_858 Int) (v_ArrVal_846 Int) (v_ArrVal_856 Int) (v_ArrVal_844 Int) (v_ArrVal_854 Int) (v_ArrVal_840 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_840))) (let ((.cse9 (select .cse22 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse21 (store .cse22 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_841)))) (let ((.cse6 (select .cse21 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse20 (store .cse21 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_844)))) (let ((.cse7 (select .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_846)))) (let ((.cse13 (select .cse19 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse18 (store .cse19 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_848)))) (let ((.cse12 (select .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_849)))) (let ((.cse4 (select .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse16 (store .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_851)))) (let ((.cse8 (select .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_854)))) (let ((.cse5 (select .cse15 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse14 (store .cse15 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_856)))) (let ((.cse10 (select .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse11 (store .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_858)))) (let ((.cse3 (select .cse11 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_860 1)) (< (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_851 1)) (< (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_856 1)) (< (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_844 1)) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_846) (< (+ (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_854) (< (+ (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_841) (< (+ (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_858) (< 2147483647 v_ArrVal_841) (< (select (select (store .cse11 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_860)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_849) (< (select .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_848 1)))))))))))))))))))))))) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (or (and .cse1 (<= .cse23 2147483647)) .cse2))))) is different from false [2022-11-21 17:34:31,265 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse22 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|))) (let ((.cse0 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse1 (<= .cse22 7))) (and (= |c_ULTIMATE.start_test_fun_~c~0#1.offset| 0) (not .cse0) .cse1 (forall ((v_ArrVal_841 Int) (v_ArrVal_851 Int) (v_ArrVal_860 Int) (v_ArrVal_849 Int) (v_ArrVal_848 Int) (v_ArrVal_858 Int) (v_ArrVal_846 Int) (v_ArrVal_856 Int) (v_ArrVal_844 Int) (v_ArrVal_854 Int) (v_ArrVal_840 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_840))) (let ((.cse8 (select .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse20 (store .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_841)))) (let ((.cse5 (select .cse20 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_844)))) (let ((.cse6 (select .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse18 (store .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_846)))) (let ((.cse12 (select .cse18 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_848)))) (let ((.cse11 (select .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse16 (store .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_849)))) (let ((.cse3 (select .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_851)))) (let ((.cse7 (select .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse14 (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_854)))) (let ((.cse4 (select .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse13 (store .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_856)))) (let ((.cse9 (select .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse10 (store .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_858)))) (let ((.cse2 (select .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_860 1)) (< (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_851 1)) (< (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_856 1)) (< (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_844 1)) (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_846) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_854) (< (+ (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_841) (< (+ (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_858) (< 2147483647 v_ArrVal_841) (< (select (select (store .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_860)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_849) (< (select .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_848 1)))))))))))))))))))))))) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (or (and .cse0 (<= .cse22 2147483647)) .cse1)))) is different from false [2022-11-21 17:34:34,583 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse22 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|))) (let ((.cse0 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse1 (<= .cse22 7))) (and (= |c_ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= |c_ULTIMATE.start_test_fun_#t~mem14#1| (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (not .cse0) .cse1 (forall ((v_ArrVal_841 Int) (v_ArrVal_851 Int) (v_ArrVal_860 Int) (v_ArrVal_849 Int) (v_ArrVal_848 Int) (v_ArrVal_858 Int) (v_ArrVal_846 Int) (v_ArrVal_856 Int) (v_ArrVal_844 Int) (v_ArrVal_854 Int) (v_ArrVal_840 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_840))) (let ((.cse8 (select .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse20 (store .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_841)))) (let ((.cse5 (select .cse20 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_844)))) (let ((.cse6 (select .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse18 (store .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_846)))) (let ((.cse12 (select .cse18 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_848)))) (let ((.cse11 (select .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse16 (store .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_849)))) (let ((.cse3 (select .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_851)))) (let ((.cse7 (select .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse14 (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_854)))) (let ((.cse4 (select .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse13 (store .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_856)))) (let ((.cse9 (select .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse10 (store .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_858)))) (let ((.cse2 (select .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_860 1)) (< (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_851 1)) (< (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_856 1)) (< (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_844 1)) (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_846) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_854) (< (+ (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_841) (< (+ (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_858) (< 2147483647 v_ArrVal_841) (< (select (select (store .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_860)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_849) (< (select .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_848 1)))))))))))))))))))))))) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (or (and .cse0 (<= .cse22 2147483647)) .cse1)))) is different from false [2022-11-21 17:34:37,727 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse22 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|))) (and (<= (select .cse0 0) 2147483646) (= |c_ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= |c_ULTIMATE.start_test_fun_#t~mem15#1| 7) (forall ((v_ArrVal_839 Int) (v_ArrVal_849 Int) (v_ArrVal_848 Int) (v_ArrVal_858 Int) (v_ArrVal_846 Int) (v_ArrVal_856 Int) (v_ArrVal_844 Int) (v_ArrVal_854 Int) (v_ArrVal_840 (Array Int Int)) (v_ArrVal_841 Int) (v_ArrVal_851 Int) (v_ArrVal_860 Int)) (let ((.cse20 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_839)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_840))) (let ((.cse7 (select .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_841)))) (let ((.cse9 (select .cse19 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse18 (store .cse19 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_844)))) (let ((.cse2 (select .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_846)))) (let ((.cse4 (select .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse16 (store .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_848)))) (let ((.cse1 (select .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_849)))) (let ((.cse3 (select .cse15 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse14 (store .cse15 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_851)))) (let ((.cse11 (select .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse13 (store .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_854)))) (let ((.cse10 (select .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse12 (store .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_856)))) (let ((.cse8 (select .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (store .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_858)))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_849) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_846) (< (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_851 1)) (< (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_848 1)) (< (select (select (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_860)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_841) (< (+ (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_858) (< (select .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_844 1)) (< (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_860 1)) (not (<= v_ArrVal_839 (+ |c_ULTIMATE.start_test_fun_#t~mem15#1| 1))) (< (select .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_856 1)) (< 2147483647 v_ArrVal_841) (< (+ (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_854))))))))))))))))))))))) (forall ((v_ArrVal_839 Int) (v_ArrVal_849 Int) (v_ArrVal_848 Int) (v_ArrVal_858 Int) (v_ArrVal_846 Int) (v_ArrVal_856 Int) (v_ArrVal_844 Int) (v_ArrVal_854 Int) (v_ArrVal_840 (Array Int Int)) (v_ArrVal_841 Int) (v_ArrVal_851 Int) (v_ArrVal_860 Int)) (let ((.cse41 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_839)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_840))) (let ((.cse28 (select .cse41 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse40 (store .cse41 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse28 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_841)))) (let ((.cse30 (select .cse40 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse39 (store .cse40 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse30 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_844)))) (let ((.cse23 (select .cse39 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse38 (store .cse39 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse23 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_846)))) (let ((.cse25 (select .cse38 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse37 (store .cse38 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse25 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_848)))) (let ((.cse21 (select .cse37 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse36 (store .cse37 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_849)))) (let ((.cse24 (select .cse36 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse35 (store .cse36 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse24 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_851)))) (let ((.cse32 (select .cse35 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse34 (store .cse35 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse32 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_854)))) (let ((.cse31 (select .cse34 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse33 (store .cse34 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse31 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_856)))) (let ((.cse29 (select .cse33 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse26 (store .cse33 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse29 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_858)))) (let ((.cse27 (select .cse26 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ (select .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_849) (< (+ .cse22 1) v_ArrVal_839) (< (+ (select .cse23 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_846) (< (select .cse24 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_851 1)) (< (select .cse25 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_848 1)) (< (select (select (store .cse26 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse27 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_860)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse28 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_841) (< (+ (select .cse29 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_858) (< (select .cse30 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_844 1)) (< (select .cse27 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_860 1)) (< (select .cse31 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_856 1)) (< 2147483647 v_ArrVal_841) (< (+ (select .cse32 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_854))))))))))))))))))))))) (<= .cse22 7)))) is different from false [2022-11-21 17:36:17,099 WARN L233 SmtUtils]: Spent 16.35s on a formula simplification that was a NOOP. DAG size: 274 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 17:36:20,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.95s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:36:22,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:36:24,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:36:26,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:36:27,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:36:29,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:36:31,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:36:34,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:36:36,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:36:38,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:36:41,715 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse5 (select .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (forall ((v_ArrVal_851 Int) (v_ArrVal_860 Int) (v_ArrVal_849 Int) (v_ArrVal_848 Int) (v_ArrVal_858 Int) (v_ArrVal_856 Int) (v_ArrVal_854 Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_848)))) (let ((.cse7 (select .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse11 (store .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_849)))) (let ((.cse3 (select .cse11 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse10 (store .cse11 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_851)))) (let ((.cse1 (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse9 (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_854)))) (let ((.cse2 (select .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse8 (store .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_856)))) (let ((.cse6 (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_858)))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_860 1)) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_854) (< (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_856 1)) (< (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_851 1)) (< (select (select (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_860)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< .cse5 (+ v_ArrVal_848 1)) (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_858) (< (+ 1 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_ArrVal_849))))))))))))))) (forall ((v_ArrVal_860 Int)) (or (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_860)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< .cse5 (+ v_ArrVal_860 1)))) (forall ((v_ArrVal_841 Int) (v_ArrVal_851 Int) (v_ArrVal_860 Int) (v_ArrVal_849 Int) (v_ArrVal_848 Int) (v_ArrVal_858 Int) (v_ArrVal_846 Int) (v_ArrVal_856 Int) (v_ArrVal_844 Int) (v_ArrVal_854 Int) (v_ArrVal_840 (Array Int Int))) (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_840))) (let ((.cse20 (select .cse33 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse32 (store .cse33 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_841)))) (let ((.cse17 (select .cse32 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse31 (store .cse32 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_844)))) (let ((.cse18 (select .cse31 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse30 (store .cse31 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_846)))) (let ((.cse24 (select .cse30 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse29 (store .cse30 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse24 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_848)))) (let ((.cse23 (select .cse29 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse28 (store .cse29 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse23 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_849)))) (let ((.cse15 (select .cse28 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse27 (store .cse28 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse15 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_851)))) (let ((.cse19 (select .cse27 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse26 (store .cse27 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_854)))) (let ((.cse16 (select .cse26 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse25 (store .cse26 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_856)))) (let ((.cse21 (select .cse25 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse22 (store .cse25 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_858)))) (let ((.cse14 (select .cse22 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_860 1)) (< (select .cse15 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_851 1)) (< (select .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_856 1)) (< (select .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_844 1)) (< (+ (select .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_846) (< (+ (select .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_854) (< (+ (select .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_841) (< (+ (select .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_858) (< 2147483647 v_ArrVal_841) (< (select (select (store .cse22 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_860)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse23 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_849) (< (select .cse24 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_848 1)))))))))))))))))))))))) (forall ((v_ArrVal_851 Int) (v_ArrVal_860 Int) (v_ArrVal_849 Int) (v_ArrVal_848 Int) (v_ArrVal_858 Int) (v_ArrVal_846 Int) (v_ArrVal_856 Int) (v_ArrVal_844 Int) (v_ArrVal_854 Int)) (let ((.cse49 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_844)))) (let ((.cse40 (select .cse49 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse48 (store .cse49 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse40 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_846)))) (let ((.cse37 (select .cse48 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse47 (store .cse48 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse37 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_848)))) (let ((.cse36 (select .cse47 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse46 (store .cse47 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse36 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_849)))) (let ((.cse42 (select .cse46 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse45 (store .cse46 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse42 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_851)))) (let ((.cse38 (select .cse45 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse44 (store .cse45 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse38 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_854)))) (let ((.cse41 (select .cse44 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse43 (store .cse44 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse41 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_856)))) (let ((.cse35 (select .cse43 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse39 (store .cse43 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse35 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_858)))) (let ((.cse34 (select .cse39 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse34 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_860 1)) (< (+ (select .cse35 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_858) (< (+ (select .cse36 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_849) (< (select .cse37 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_848 1)) (< (+ (select .cse38 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_854) (< (select (select (store .cse39 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse34 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_860)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< .cse5 (+ v_ArrVal_844 1)) (< (+ (select .cse40 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_846) (< (select .cse41 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_856 1)) (< (select .cse42 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_851 1)))))))))))))))))))) (forall ((v_ArrVal_860 Int) (v_ArrVal_858 Int) (v_ArrVal_856 Int)) (let ((.cse53 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_856)))) (let ((.cse52 (select .cse53 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse51 (store .cse53 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse52 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_858)))) (let ((.cse50 (select .cse51 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< .cse5 (+ v_ArrVal_856 1)) (< (select .cse50 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_860 1)) (< (select (select (store .cse51 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse50 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_860)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse52 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_858))))))) (forall ((v_ArrVal_851 Int) (v_ArrVal_860 Int) (v_ArrVal_858 Int) (v_ArrVal_856 Int) (v_ArrVal_854 Int)) (let ((.cse61 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_851)))) (let ((.cse55 (select .cse61 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse60 (store .cse61 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse55 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_854)))) (let ((.cse58 (select .cse60 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse59 (store .cse60 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse58 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_856)))) (let ((.cse57 (select .cse59 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse56 (store .cse59 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse57 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_858)))) (let ((.cse54 (select .cse56 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse54 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_860 1)) (< (+ (select .cse55 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_854) (< (select (select (store .cse56 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse54 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_860)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse57 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_858) (< (select .cse58 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_856 1)) (< .cse5 (+ v_ArrVal_851 1))))))))))))))) is different from false [2022-11-21 17:36:46,757 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (and (forall ((v_ArrVal_860 Int)) (or (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_860)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= (+ v_ArrVal_860 1) |c_ULTIMATE.start_test_fun_#t~mem14#1|)))) (forall ((v_ArrVal_860 Int) (v_ArrVal_858 Int) (v_ArrVal_856 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_856)))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_858)))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (not (<= (+ v_ArrVal_856 1) |c_ULTIMATE.start_test_fun_#t~mem14#1|)) (< (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_860 1)) (< (select (select (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_860)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_858))))))) (forall ((v_ArrVal_851 Int) (v_ArrVal_860 Int) (v_ArrVal_849 Int) (v_ArrVal_848 Int) (v_ArrVal_858 Int) (v_ArrVal_856 Int) (v_ArrVal_854 Int)) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_848)))) (let ((.cse11 (select .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_849)))) (let ((.cse8 (select .cse15 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse14 (store .cse15 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_851)))) (let ((.cse6 (select .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse13 (store .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_854)))) (let ((.cse7 (select .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse12 (store .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_856)))) (let ((.cse10 (select .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse9 (store .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_858)))) (let ((.cse5 (select .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_860 1)) (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_854) (< (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_856 1)) (not (<= (+ v_ArrVal_848 1) |c_ULTIMATE.start_test_fun_#t~mem14#1|)) (< (select .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_851 1)) (< (select (select (store .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_860)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_858) (< (+ 1 (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_ArrVal_849))))))))))))))) (forall ((v_ArrVal_851 Int) (v_ArrVal_860 Int) (v_ArrVal_849 Int) (v_ArrVal_848 Int) (v_ArrVal_858 Int) (v_ArrVal_846 Int) (v_ArrVal_856 Int) (v_ArrVal_844 Int) (v_ArrVal_854 Int)) (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_844)))) (let ((.cse23 (select .cse32 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse31 (store .cse32 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse23 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_846)))) (let ((.cse20 (select .cse31 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse30 (store .cse31 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse20 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_848)))) (let ((.cse19 (select .cse30 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse29 (store .cse30 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_849)))) (let ((.cse25 (select .cse29 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse28 (store .cse29 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse25 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_851)))) (let ((.cse21 (select .cse28 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse27 (store .cse28 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_854)))) (let ((.cse24 (select .cse27 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse26 (store .cse27 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse24 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_856)))) (let ((.cse18 (select .cse26 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse22 (store .cse26 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_858)))) (let ((.cse17 (select .cse22 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_860 1)) (< (+ (select .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_858) (< (+ (select .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_849) (< (select .cse20 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_848 1)) (< (+ (select .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_854) (< (select (select (store .cse22 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_860)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse23 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_846) (not (<= (+ v_ArrVal_844 1) |c_ULTIMATE.start_test_fun_#t~mem14#1|)) (< (select .cse24 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_856 1)) (< (select .cse25 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_851 1)))))))))))))))))))) (forall ((v_ArrVal_841 Int) (v_ArrVal_851 Int) (v_ArrVal_860 Int) (v_ArrVal_849 Int) (v_ArrVal_848 Int) (v_ArrVal_858 Int) (v_ArrVal_846 Int) (v_ArrVal_856 Int) (v_ArrVal_844 Int) (v_ArrVal_854 Int) (v_ArrVal_840 (Array Int Int))) (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_840))) (let ((.cse39 (select .cse52 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse51 (store .cse52 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse39 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_841)))) (let ((.cse36 (select .cse51 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse50 (store .cse51 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse36 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_844)))) (let ((.cse37 (select .cse50 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse49 (store .cse50 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse37 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_846)))) (let ((.cse43 (select .cse49 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse48 (store .cse49 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse43 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_848)))) (let ((.cse42 (select .cse48 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse47 (store .cse48 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse42 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_849)))) (let ((.cse34 (select .cse47 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse46 (store .cse47 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse34 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_851)))) (let ((.cse38 (select .cse46 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse45 (store .cse46 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse38 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_854)))) (let ((.cse35 (select .cse45 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse44 (store .cse45 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse35 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_856)))) (let ((.cse40 (select .cse44 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse41 (store .cse44 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse40 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_858)))) (let ((.cse33 (select .cse41 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse33 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_860 1)) (< (select .cse34 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_851 1)) (< (select .cse35 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_856 1)) (< (select .cse36 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_844 1)) (< (+ (select .cse37 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_846) (< (+ (select .cse38 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_854) (< (+ (select .cse39 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_841) (< (+ (select .cse40 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_858) (< 2147483647 v_ArrVal_841) (< (select (select (store .cse41 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse33 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_860)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse42 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_849) (< (select .cse43 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_848 1)))))))))))))))))))))))) (forall ((v_ArrVal_851 Int) (v_ArrVal_860 Int) (v_ArrVal_858 Int) (v_ArrVal_856 Int) (v_ArrVal_854 Int)) (let ((.cse60 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_851)))) (let ((.cse54 (select .cse60 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse59 (store .cse60 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse54 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_854)))) (let ((.cse57 (select .cse59 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse58 (store .cse59 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse57 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_856)))) (let ((.cse56 (select .cse58 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse55 (store .cse58 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse56 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_858)))) (let ((.cse53 (select .cse55 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse53 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_860 1)) (< (+ (select .cse54 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_854) (< (select (select (store .cse55 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse53 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_860)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= (+ v_ArrVal_851 1) |c_ULTIMATE.start_test_fun_#t~mem14#1|)) (< (+ (select .cse56 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_858) (< (select .cse57 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_856 1)))))))))))))) is different from false [2022-11-21 17:38:13,144 WARN L233 SmtUtils]: Spent 18.35s on a formula simplification that was a NOOP. DAG size: 203 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 17:38:16,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:38:18,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:38:20,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:38:22,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:38:24,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:38:27,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:38:29,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:38:33,163 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse83 (select .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.offset|))) (let ((.cse18 (+ .cse83 1)) (.cse1 (+ |c_ULTIMATE.start_test_fun_#t~mem15#1| 1))) (and (forall ((v_ArrVal_851 Int) (v_ArrVal_860 Int) (v_ArrVal_849 Int) (v_ArrVal_848 Int) (v_ArrVal_858 Int) (v_ArrVal_846 Int) (v_ArrVal_856 Int) (v_ArrVal_854 Int)) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_846)))) (let ((.cse8 (select .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse13 (store .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_848)))) (let ((.cse5 (select .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse12 (store .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_849)))) (let ((.cse7 (select .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse11 (store .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_851)))) (let ((.cse6 (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse10 (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_854)))) (let ((.cse0 (select .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse9 (store .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_856)))) (let ((.cse2 (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse3 (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_858)))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_856 1)) (not (<= v_ArrVal_846 .cse1)) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_858) (< (select (select (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_860)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_860 1)) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_849) (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_854) (< (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_851 1)) (< (select .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_848 1)))))))))))))))))) (forall ((v_ArrVal_851 Int) (v_ArrVal_860 Int) (v_ArrVal_849 Int) (v_ArrVal_858 Int) (v_ArrVal_856 Int) (v_ArrVal_854 Int)) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_849)))) (let ((.cse21 (select .cse26 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse25 (store .cse26 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse21 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_851)))) (let ((.cse20 (select .cse25 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse24 (store .cse25 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_854)))) (let ((.cse19 (select .cse24 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse23 (store .cse24 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse19 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_856)))) (let ((.cse22 (select .cse23 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse16 (store .cse23 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse22 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_858)))) (let ((.cse17 (select .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select (select (store .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_860)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< .cse18 v_ArrVal_849) (< (select .cse19 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_856 1)) (< (+ (select .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_854) (< (select .cse21 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_851 1)) (< (+ (select .cse22 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_858) (< (select .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_860 1)))))))))))))) (forall ((v_ArrVal_860 Int) (v_ArrVal_858 Int)) (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_858)))) (let ((.cse28 (select .cse27 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select (select (store .cse27 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse28 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_860)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_858 .cse1)) (< (select .cse28 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_860 1)))))) (forall ((v_ArrVal_841 Int) (v_ArrVal_851 Int) (v_ArrVal_860 Int) (v_ArrVal_849 Int) (v_ArrVal_848 Int) (v_ArrVal_858 Int) (v_ArrVal_846 Int) (v_ArrVal_856 Int) (v_ArrVal_844 Int) (v_ArrVal_854 Int)) (let ((.cse46 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_841)))) (let ((.cse29 (select .cse46 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse45 (store .cse46 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse29 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_844)))) (let ((.cse30 (select .cse45 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse44 (store .cse45 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse30 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_846)))) (let ((.cse35 (select .cse44 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse43 (store .cse44 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse35 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_848)))) (let ((.cse31 (select .cse43 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse42 (store .cse43 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse31 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_849)))) (let ((.cse37 (select .cse42 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse41 (store .cse42 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse37 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_851)))) (let ((.cse36 (select .cse41 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse40 (store .cse41 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse36 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_854)))) (let ((.cse38 (select .cse40 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse39 (store .cse40 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse38 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_856)))) (let ((.cse34 (select .cse39 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse32 (store .cse39 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse34 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_858)))) (let ((.cse33 (select .cse32 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse29 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_844 1)) (< (+ (select .cse30 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_846) (< (+ (select .cse31 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_849) (< (select (select (store .cse32 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse33 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_860)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse34 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_858) (< (select .cse35 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_848 1)) (< (+ (select .cse36 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_854) (< (select .cse37 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_851 1)) (< (select .cse33 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_860 1)) (< .cse18 v_ArrVal_841) (< 2147483647 v_ArrVal_841) (< (select .cse38 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_856 1)))))))))))))))))))))) (forall ((v_ArrVal_841 Int) (v_ArrVal_851 Int) (v_ArrVal_860 Int) (v_ArrVal_849 Int) (v_ArrVal_848 Int) (v_ArrVal_858 Int) (v_ArrVal_846 Int) (v_ArrVal_856 Int) (v_ArrVal_844 Int) (v_ArrVal_854 Int)) (let ((.cse64 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_841)))) (let ((.cse47 (select .cse64 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse63 (store .cse64 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse47 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_844)))) (let ((.cse48 (select .cse63 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse62 (store .cse63 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse48 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_846)))) (let ((.cse53 (select .cse62 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse61 (store .cse62 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse53 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_848)))) (let ((.cse49 (select .cse61 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse60 (store .cse61 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse49 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_849)))) (let ((.cse55 (select .cse60 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse59 (store .cse60 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse55 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_851)))) (let ((.cse54 (select .cse59 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse58 (store .cse59 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse54 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_854)))) (let ((.cse56 (select .cse58 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse57 (store .cse58 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse56 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_856)))) (let ((.cse52 (select .cse57 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse50 (store .cse57 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse52 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_858)))) (let ((.cse51 (select .cse50 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse47 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_844 1)) (< (+ (select .cse48 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_846) (< (+ (select .cse49 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_849) (< (select (select (store .cse50 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse51 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_860)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse52 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_858) (not (<= v_ArrVal_841 .cse1)) (< (select .cse53 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_848 1)) (< (+ (select .cse54 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_854) (< (select .cse55 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_851 1)) (< (select .cse51 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_860 1)) (< (select .cse56 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_856 1)))))))))))))))))))))) (<= |c_ULTIMATE.start_test_fun_#t~mem15#1| 2147483646) (forall ((v_ArrVal_860 Int) (v_ArrVal_858 Int)) (let ((.cse65 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_858)))) (let ((.cse66 (select .cse65 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select (select (store .cse65 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse66 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_860)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< .cse18 v_ArrVal_858) (< (select .cse66 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_860 1)))))) (forall ((v_ArrVal_851 Int) (v_ArrVal_860 Int) (v_ArrVal_849 Int) (v_ArrVal_858 Int) (v_ArrVal_856 Int) (v_ArrVal_854 Int)) (let ((.cse76 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_849)))) (let ((.cse71 (select .cse76 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse75 (store .cse76 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse71 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_851)))) (let ((.cse70 (select .cse75 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse74 (store .cse75 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse70 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_854)))) (let ((.cse69 (select .cse74 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse73 (store .cse74 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse69 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_856)))) (let ((.cse72 (select .cse73 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse67 (store .cse73 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse72 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_858)))) (let ((.cse68 (select .cse67 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select (select (store .cse67 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse68 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_860)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_849 .cse1)) (< (select .cse69 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_856 1)) (< (+ (select .cse70 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_854) (< (select .cse71 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_851 1)) (< (+ (select .cse72 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_858) (< (select .cse68 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_860 1)))))))))))))) (forall ((v_ArrVal_860 Int) (v_ArrVal_858 Int) (v_ArrVal_856 Int) (v_ArrVal_854 Int)) (let ((.cse82 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_854)))) (let ((.cse78 (select .cse82 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse81 (store .cse82 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse78 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_856)))) (let ((.cse80 (select .cse81 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse79 (store .cse81 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse80 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_858)))) (let ((.cse77 (select .cse79 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse77 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_860 1)) (< (select .cse78 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_856 1)) (< .cse18 v_ArrVal_854) (< (select (select (store .cse79 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse77 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_860)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse80 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_858))))))))) (< .cse83 2147483647) (forall ((v_ArrVal_851 Int) (v_ArrVal_860 Int) (v_ArrVal_849 Int) (v_ArrVal_848 Int) (v_ArrVal_858 Int) (v_ArrVal_846 Int) (v_ArrVal_856 Int) (v_ArrVal_854 Int)) (let ((.cse97 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_846)))) (let ((.cse91 (select .cse97 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse96 (store .cse97 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse91 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_848)))) (let ((.cse88 (select .cse96 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse95 (store .cse96 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse88 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_849)))) (let ((.cse90 (select .cse95 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse94 (store .cse95 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse90 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_851)))) (let ((.cse89 (select .cse94 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse93 (store .cse94 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse89 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_854)))) (let ((.cse84 (select .cse93 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse92 (store .cse93 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse84 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_856)))) (let ((.cse85 (select .cse92 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse86 (store .cse92 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse85 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_858)))) (let ((.cse87 (select .cse86 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< .cse18 v_ArrVal_846) (< (select .cse84 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_856 1)) (< (+ (select .cse85 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_858) (< (select (select (store .cse86 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse87 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_860)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (select .cse87 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_860 1)) (< (+ (select .cse88 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_849) (< (+ (select .cse89 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_854) (< (select .cse90 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_851 1)) (< (select .cse91 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_848 1)))))))))))))))))) (forall ((v_ArrVal_860 Int) (v_ArrVal_858 Int) (v_ArrVal_856 Int) (v_ArrVal_854 Int)) (let ((.cse103 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_854)))) (let ((.cse99 (select .cse103 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse102 (store .cse103 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse99 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_856)))) (let ((.cse101 (select .cse102 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse100 (store .cse102 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse101 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_858)))) (let ((.cse98 (select .cse100 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse98 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_860 1)) (< (select .cse99 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_856 1)) (not (<= v_ArrVal_854 .cse1)) (< (select (select (store .cse100 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse98 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_860)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse101 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_858))))))))))))) is different from true [2022-11-21 17:40:02,931 WARN L233 SmtUtils]: Spent 15.55s on a formula simplification that was a NOOP. DAG size: 206 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 17:40:05,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.86s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:40:08,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:40:10,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:40:12,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:40:14,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:40:16,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:40:18,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:40:20,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:40:22,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:40:24,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:40:26,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:40:28,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:40:30,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:40:32,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:40:34,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:40:36,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]