./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.14-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8393723b 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_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.14-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro --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 3bd2edbf3e593c12fc0be33924c944159e0cb6d32e04e77d638ccd9d0e66fc4a --- 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-8393723 [2022-11-18 20:54:29,563 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:54:29,565 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:54:29,586 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:54:29,587 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:54:29,588 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:54:29,590 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:54:29,592 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:54:29,594 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:54:29,595 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:54:29,596 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:54:29,598 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:54:29,598 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:54:29,599 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:54:29,601 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:54:29,602 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:54:29,603 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:54:29,605 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:54:29,607 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:54:29,609 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:54:29,611 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:54:29,613 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:54:29,614 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:54:29,615 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:54:29,619 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:54:29,620 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:54:29,620 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:54:29,621 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:54:29,622 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:54:29,623 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:54:29,624 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:54:29,631 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:54:29,632 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:54:29,633 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:54:29,634 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:54:29,635 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:54:29,636 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:54:29,636 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:54:29,636 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:54:29,638 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:54:29,638 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:54:29,647 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-11-18 20:54:29,682 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:54:29,683 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:54:29,683 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:54:29,684 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:54:29,684 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:54:29,693 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:54:29,694 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:54:29,695 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:54:29,695 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:54:29,695 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:54:29,696 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 20:54:29,696 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:54:29,697 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:54:29,697 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:54:29,697 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:54:29,697 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:54:29,698 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-18 20:54:29,698 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:54:29,698 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:54:29,698 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:54:29,698 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:54:29,699 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:54:29,699 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:54:29,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:54:29,700 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:54:29,700 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:54:29,700 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:54:29,700 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:54:29,701 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:54:29,701 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:54:29,702 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:54:29,703 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:54:29,703 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_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/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_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro 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 -> 3bd2edbf3e593c12fc0be33924c944159e0cb6d32e04e77d638ccd9d0e66fc4a [2022-11-18 20:54:29,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:54:29,997 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:54:30,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:54:30,001 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:54:30,002 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:54:30,003 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/termination-memory-alloca/b.14-alloca.i [2022-11-18 20:54:30,093 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/data/d948823a9/f5ff2c49f36149aa9d373ab9d35b42aa/FLAG599ed9d97 [2022-11-18 20:54:30,706 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:54:30,713 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/sv-benchmarks/c/termination-memory-alloca/b.14-alloca.i [2022-11-18 20:54:30,732 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/data/d948823a9/f5ff2c49f36149aa9d373ab9d35b42aa/FLAG599ed9d97 [2022-11-18 20:54:30,980 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/data/d948823a9/f5ff2c49f36149aa9d373ab9d35b42aa [2022-11-18 20:54:30,983 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:54:30,984 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:54:30,988 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:54:30,988 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:54:30,992 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:54:30,993 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:54:30" (1/1) ... [2022-11-18 20:54:30,994 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4790859f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:54:30, skipping insertion in model container [2022-11-18 20:54:30,994 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:54:30" (1/1) ... [2022-11-18 20:54:31,002 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:54:31,034 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:54:31,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:54:31,382 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:54:31,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:54:31,482 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:54:31,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:54:31 WrapperNode [2022-11-18 20:54:31,483 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:54:31,484 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:54:31,485 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:54:31,485 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:54:31,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:54:31" (1/1) ... [2022-11-18 20:54:31,524 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:54:31" (1/1) ... [2022-11-18 20:54:31,556 INFO L138 Inliner]: procedures = 111, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2022-11-18 20:54:31,557 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:54:31,558 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:54:31,558 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:54:31,559 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:54:31,568 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:54:31" (1/1) ... [2022-11-18 20:54:31,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:54:31" (1/1) ... [2022-11-18 20:54:31,573 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:54:31" (1/1) ... [2022-11-18 20:54:31,573 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:54:31" (1/1) ... [2022-11-18 20:54:31,577 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:54:31" (1/1) ... [2022-11-18 20:54:31,590 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:54:31" (1/1) ... [2022-11-18 20:54:31,592 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:54:31" (1/1) ... [2022-11-18 20:54:31,593 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:54:31" (1/1) ... [2022-11-18 20:54:31,595 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:54:31,596 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:54:31,596 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:54:31,596 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:54:31,597 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:54:31" (1/1) ... [2022-11-18 20:54:31,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:54:31,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:54:31,637 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:54:31,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:54:31,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 20:54:31,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 20:54:31,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:54:31,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:54:31,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:54:31,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:54:31,859 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:54:31,861 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:54:32,068 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:54:32,076 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:54:32,077 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-18 20:54:32,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:54:32 BoogieIcfgContainer [2022-11-18 20:54:32,078 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:54:32,080 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:54:32,081 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:54:32,084 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:54:32,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:54:30" (1/3) ... [2022-11-18 20:54:32,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7af14c86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:54:32, skipping insertion in model container [2022-11-18 20:54:32,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:54:31" (2/3) ... [2022-11-18 20:54:32,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7af14c86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:54:32, skipping insertion in model container [2022-11-18 20:54:32,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:54:32" (3/3) ... [2022-11-18 20:54:32,087 INFO L112 eAbstractionObserver]: Analyzing ICFG b.14-alloca.i [2022-11-18 20:54:32,109 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:54:32,110 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-11-18 20:54:32,164 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:54:32,172 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;@7e49dfd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:54:32,172 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-18 20:54:32,186 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 23 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-18 20:54:32,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-18 20:54:32,196 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:54:32,197 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:54:32,197 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-18 20:54:32,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:54:32,207 INFO L85 PathProgramCache]: Analyzing trace with hash 177751404, now seen corresponding path program 1 times [2022-11-18 20:54:32,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:54:32,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830960095] [2022-11-18 20:54:32,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:54:32,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:54:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:54:33,296 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-18 20:54:33,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:54:33,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830960095] [2022-11-18 20:54:33,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830960095] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:54:33,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:54:33,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:54:33,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265434275] [2022-11-18 20:54:33,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:54:33,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:54:33,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:54:33,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:54:33,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:54:33,340 INFO L87 Difference]: Start difference. First operand has 24 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 23 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) Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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-18 20:54:33,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:54:33,560 INFO L93 Difference]: Finished difference Result 84 states and 108 transitions. [2022-11-18 20:54:33,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:54:33,563 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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 8 [2022-11-18 20:54:33,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:54:33,572 INFO L225 Difference]: With dead ends: 84 [2022-11-18 20:54:33,573 INFO L226 Difference]: Without dead ends: 47 [2022-11-18 20:54:33,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-18 20:54:33,579 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 71 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:54:33,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 73 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:54:33,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-18 20:54:33,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 25. [2022-11-18 20:54:33,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 24 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-18 20:54:33,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-11-18 20:54:33,617 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 8 [2022-11-18 20:54:33,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:54:33,618 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-11-18 20:54:33,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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-18 20:54:33,619 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-11-18 20:54:33,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-18 20:54:33,619 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:54:33,620 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:54:33,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:54:33,620 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-18 20:54:33,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:54:33,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1215326290, now seen corresponding path program 1 times [2022-11-18 20:54:33,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:54:33,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967777163] [2022-11-18 20:54:33,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:54:33,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:54:33,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:54:33,707 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-18 20:54:33,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:54:33,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967777163] [2022-11-18 20:54:33,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967777163] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:54:33,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:54:33,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:54:33,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016159003] [2022-11-18 20:54:33,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:54:33,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:54:33,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:54:33,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:54:33,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:54:33,712 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-18 20:54:33,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:54:33,767 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-11-18 20:54:33,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:54:33,768 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-18 20:54:33,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:54:33,769 INFO L225 Difference]: With dead ends: 37 [2022-11-18 20:54:33,769 INFO L226 Difference]: Without dead ends: 36 [2022-11-18 20:54:33,769 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-18 20:54:33,771 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 8 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:54:33,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 56 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:54:33,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-11-18 20:54:33,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2022-11-18 20:54:33,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 28 states have internal predecessors, (35), 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-18 20:54:33,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-11-18 20:54:33,778 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 9 [2022-11-18 20:54:33,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:54:33,779 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-11-18 20:54:33,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-18 20:54:33,779 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-11-18 20:54:33,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-18 20:54:33,780 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:54:33,780 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:54:33,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:54:33,781 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-18 20:54:33,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:54:33,782 INFO L85 PathProgramCache]: Analyzing trace with hash -979590610, now seen corresponding path program 1 times [2022-11-18 20:54:33,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:54:33,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336733620] [2022-11-18 20:54:33,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:54:33,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:54:33,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:54:34,047 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-18 20:54:34,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:54:34,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336733620] [2022-11-18 20:54:34,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336733620] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:54:34,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:54:34,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:54:34,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287239971] [2022-11-18 20:54:34,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:54:34,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:54:34,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:54:34,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:54:34,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:54:34,055 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 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-18 20:54:34,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:54:34,326 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2022-11-18 20:54:34,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 20:54:34,327 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 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-18 20:54:34,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:54:34,327 INFO L225 Difference]: With dead ends: 46 [2022-11-18 20:54:34,328 INFO L226 Difference]: Without dead ends: 45 [2022-11-18 20:54:34,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2022-11-18 20:54:34,329 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 69 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:54:34,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 47 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:54:34,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-18 20:54:34,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2022-11-18 20:54:34,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.5) internal successors, (36), 29 states have internal predecessors, (36), 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-18 20:54:34,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-11-18 20:54:34,336 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 10 [2022-11-18 20:54:34,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:54:34,337 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-11-18 20:54:34,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 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-18 20:54:34,337 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-11-18 20:54:34,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 20:54:34,338 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:54:34,338 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:54:34,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:54:34,338 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-18 20:54:34,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:54:34,339 INFO L85 PathProgramCache]: Analyzing trace with hash -302537772, now seen corresponding path program 1 times [2022-11-18 20:54:34,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:54:34,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088295068] [2022-11-18 20:54:34,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:54:34,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:54:34,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:54:34,595 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-18 20:54:34,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:54:34,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088295068] [2022-11-18 20:54:34,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088295068] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:54:34,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:54:34,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:54:34,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664384161] [2022-11-18 20:54:34,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:54:34,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:54:34,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:54:34,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:54:34,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:54:34,597 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 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-18 20:54:34,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:54:34,734 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-11-18 20:54:34,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:54:34,734 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 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 11 [2022-11-18 20:54:34,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:54:34,735 INFO L225 Difference]: With dead ends: 39 [2022-11-18 20:54:34,735 INFO L226 Difference]: Without dead ends: 38 [2022-11-18 20:54:34,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:54:34,737 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 32 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 56 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-18 20:54:34,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 56 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:54:34,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-18 20:54:34,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2022-11-18 20:54:34,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.48) internal successors, (37), 30 states have internal predecessors, (37), 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-18 20:54:34,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-11-18 20:54:34,744 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 11 [2022-11-18 20:54:34,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:54:34,744 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-11-18 20:54:34,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 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-18 20:54:34,744 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-11-18 20:54:34,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-18 20:54:34,745 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:54:34,745 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:54:34,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:54:34,746 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-18 20:54:34,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:54:34,746 INFO L85 PathProgramCache]: Analyzing trace with hash -788736272, now seen corresponding path program 1 times [2022-11-18 20:54:34,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:54:34,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045067105] [2022-11-18 20:54:34,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:54:34,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:54:34,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:54:35,163 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-18 20:54:35,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:54:35,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045067105] [2022-11-18 20:54:35,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045067105] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:54:35,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:54:35,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:54:35,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127742805] [2022-11-18 20:54:35,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:54:35,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:54:35,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:54:35,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:54:35,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:54:35,171 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 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-18 20:54:35,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:54:35,246 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-11-18 20:54:35,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:54:35,247 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 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 12 [2022-11-18 20:54:35,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:54:35,249 INFO L225 Difference]: With dead ends: 44 [2022-11-18 20:54:35,250 INFO L226 Difference]: Without dead ends: 42 [2022-11-18 20:54:35,250 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-18 20:54:35,253 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 19 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:54:35,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 60 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:54:35,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-18 20:54:35,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-11-18 20:54:35,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 41 states have internal predecessors, (50), 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-18 20:54:35,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-11-18 20:54:35,274 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 12 [2022-11-18 20:54:35,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:54:35,275 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-11-18 20:54:35,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 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-18 20:54:35,277 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-11-18 20:54:35,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 20:54:35,281 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:54:35,282 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:54:35,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:54:35,285 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-18 20:54:35,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:54:35,287 INFO L85 PathProgramCache]: Analyzing trace with hash -940015839, now seen corresponding path program 1 times [2022-11-18 20:54:35,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:54:35,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237691083] [2022-11-18 20:54:35,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:54:35,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:54:35,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:54:35,860 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-18 20:54:35,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:54:35,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237691083] [2022-11-18 20:54:35,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237691083] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:54:35,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779585425] [2022-11-18 20:54:35,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:54:35,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:54:35,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:54:35,869 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:54:35,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 20:54:35,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:54:35,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-18 20:54:35,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:54:36,758 INFO L321 Elim1Store]: treesize reduction 252, result has 37.8 percent of original size [2022-11-18 20:54:36,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 19 case distinctions, treesize of input 462 treesize of output 894 [2022-11-18 20:54:36,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2022-11-18 20:54:37,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2022-11-18 20:54:37,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2022-11-18 20:54:37,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2022-11-18 20:54:39,027 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:54:39,168 INFO L321 Elim1Store]: treesize reduction 117, result has 17.6 percent of original size [2022-11-18 20:54:39,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 15 case distinctions, treesize of input 1053 treesize of output 1123 [2022-11-18 20:54:40,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-18 20:54:40,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 83 [2022-11-18 20:54:40,575 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:54:40,580 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:54:40,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 73 [2022-11-18 20:54:41,070 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 20:54:42,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:54:42,475 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:54:42,483 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:54:42,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 100 [2022-11-18 20:54:42,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 20:54:42,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 20:54:42,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:54:42,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:54:42,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:54:42,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 101 [2022-11-18 20:54:42,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 20:54:42,720 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:54:42,747 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:54:42,773 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-18 20:54:42,774 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 1842 treesize of output 1671 [2022-11-18 20:54:43,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 20:54:43,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 20:54:43,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:54:43,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:54:43,345 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:54:43,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:54:43,359 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:54:43,362 INFO L350 Elim1Store]: Elim1 eliminated variable 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 141 treesize of output 94 [2022-11-18 20:54:55,768 INFO L321 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2022-11-18 20:54:55,770 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 1902 treesize of output 1729 [2022-11-18 20:54:56,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 20:54:56,199 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:54:56,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-11-18 20:54:56,405 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:54:56,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-11-18 20:54:56,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 20:54:56,626 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:54:56,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 75 [2022-11-18 20:54:56,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 20:54:56,710 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:54:56,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 66 [2022-11-18 20:54:56,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 20:54:56,814 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:54:56,818 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:54:56,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 178 [2022-11-18 20:54:56,877 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:54:56,878 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:54:56,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 7 [2022-11-18 20:54:56,893 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:54:56,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 154 [2022-11-18 20:54:57,525 INFO L321 Elim1Store]: treesize reduction 44, result has 41.3 percent of original size [2022-11-18 20:54:57,525 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 82 treesize of output 76 [2022-11-18 20:54:57,797 INFO L321 Elim1Store]: treesize reduction 31, result has 13.9 percent of original size [2022-11-18 20:54:57,797 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 3 case distinctions, treesize of input 67 treesize of output 62 [2022-11-18 20:54:57,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2022-11-18 20:54:58,045 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 24 treesize of output 12 [2022-11-18 20:54:58,118 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-18 20:54:58,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:54:58,268 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_194 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_194) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483649)) is different from false [2022-11-18 20:54:59,191 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-18 20:54:59,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779585425] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:54:59,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:54:59,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 11] total 30 [2022-11-18 20:54:59,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654571285] [2022-11-18 20:54:59,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:54:59,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-18 20:54:59,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:54:59,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-18 20:54:59,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=723, Unknown=13, NotChecked=56, Total=930 [2022-11-18 20:54:59,197 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 31 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 31 states have internal predecessors, (46), 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-18 20:55:03,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:55:03,753 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2022-11-18 20:55:03,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 20:55:03,761 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 31 states have internal predecessors, (46), 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-18 20:55:03,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:55:03,762 INFO L225 Difference]: With dead ends: 57 [2022-11-18 20:55:03,762 INFO L226 Difference]: Without dead ends: 56 [2022-11-18 20:55:03,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=268, Invalid=1265, Unknown=31, NotChecked=76, Total=1640 [2022-11-18 20:55:03,764 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 10 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:55:03,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 128 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 29 Invalid, 0 Unknown, 40 Unchecked, 0.1s Time] [2022-11-18 20:55:03,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-18 20:55:03,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-11-18 20:55:03,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 50 states have (on average 1.34) internal successors, (67), 55 states have internal predecessors, (67), 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-18 20:55:03,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2022-11-18 20:55:03,773 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 16 [2022-11-18 20:55:03,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:55:03,773 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2022-11-18 20:55:03,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 31 states have internal predecessors, (46), 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-18 20:55:03,774 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-11-18 20:55:03,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 20:55:03,774 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:55:03,774 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:55:03,782 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-18 20:55:03,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-18 20:55:03,981 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-18 20:55:03,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:55:03,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1526821853, now seen corresponding path program 1 times [2022-11-18 20:55:03,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:55:03,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492252311] [2022-11-18 20:55:03,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:55:03,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:55:03,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:04,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:55:04,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:55:04,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492252311] [2022-11-18 20:55:04,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492252311] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:55:04,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:55:04,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:55:04,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613180356] [2022-11-18 20:55:04,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:55:04,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:55:04,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:55:04,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:55:04,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:55:04,011 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-18 20:55:04,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:55:04,023 INFO L93 Difference]: Finished difference Result 92 states and 109 transitions. [2022-11-18 20:55:04,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:55:04,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-18 20:55:04,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:55:04,025 INFO L225 Difference]: With dead ends: 92 [2022-11-18 20:55:04,025 INFO L226 Difference]: Without dead ends: 50 [2022-11-18 20:55:04,025 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-18 20:55:04,026 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:55:04,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:55:04,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-18 20:55:04,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-11-18 20:55:04,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 49 states have internal predecessors, (56), 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-18 20:55:04,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2022-11-18 20:55:04,034 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 16 [2022-11-18 20:55:04,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:55:04,034 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2022-11-18 20:55:04,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-18 20:55:04,035 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2022-11-18 20:55:04,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-18 20:55:04,036 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:55:04,036 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:55:04,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 20:55:04,036 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-18 20:55:04,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:55:04,037 INFO L85 PathProgramCache]: Analyzing trace with hash 924280125, now seen corresponding path program 1 times [2022-11-18 20:55:04,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:55:04,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926798880] [2022-11-18 20:55:04,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:55:04,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:55:04,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:04,393 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:55:04,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:55:04,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926798880] [2022-11-18 20:55:04,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926798880] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:55:04,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272944065] [2022-11-18 20:55:04,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:55:04,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:55:04,394 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:55:04,395 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:55:04,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 20:55:04,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:04,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-18 20:55:04,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:55:05,183 INFO L321 Elim1Store]: treesize reduction 252, result has 37.8 percent of original size [2022-11-18 20:55:05,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 19 case distinctions, treesize of input 226 treesize of output 790 [2022-11-18 20:55:05,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2022-11-18 20:55:05,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2022-11-18 20:55:05,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2022-11-18 20:55:05,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2022-11-18 20:55:10,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2724 treesize of output 2467 [2022-11-18 20:55:12,920 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:55:12,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 5 [2022-11-18 20:55:13,040 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:55:13,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 5 [2022-11-18 20:55:13,059 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:55:13,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 5 [2022-11-18 20:55:13,102 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:55:13,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 5 [2022-11-18 20:55:13,207 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:55:13,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 5 [2022-11-18 20:55:13,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:55:13,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:55:13,635 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-18 20:55:13,638 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 755 treesize of output 648 [2022-11-18 20:55:15,018 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:55:15,026 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:55:15,048 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-18 20:55:15,049 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 663 treesize of output 602 [2022-11-18 20:55:15,870 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:55:15,871 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:55:15,875 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:55:15,875 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:55:15,876 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 74 treesize of output 33 [2022-11-18 20:55:15,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:55:15,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:55:15,994 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:55:15,999 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:55:16,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 100 [2022-11-18 20:55:16,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 20:55:16,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 20:55:16,032 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:55:16,033 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:55:16,037 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 55 [2022-11-18 20:55:16,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 20:55:16,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:55:16,059 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:55:16,064 INFO L350 Elim1Store]: Elim1 eliminated variable 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 179 treesize of output 126 [2022-11-18 20:55:16,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2022-11-18 20:55:16,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-18 20:55:16,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2022-11-18 20:55:16,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 20:55:16,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:55:16,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:55:16,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:55:16,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 56 [2022-11-18 20:55:16,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2022-11-18 20:55:16,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 20:55:16,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-18 20:55:16,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:55:16,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:55:16,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:55:16,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 59 [2022-11-18 20:55:16,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 20:55:16,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2022-11-18 20:55:16,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2022-11-18 20:55:17,487 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:55:17,488 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:55:17,494 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 31 [2022-11-18 20:55:17,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-18 20:55:17,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 20:55:18,571 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:55:18,571 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:55:18,575 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 20:55:19,705 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 20:55:20,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 20:55:47,209 WARN L233 SmtUtils]: Spent 25.87s on a formula simplification. DAG size of input: 1107 DAG size of output: 1039 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:56:08,257 WARN L233 SmtUtils]: Spent 17.95s on a formula simplification that was a NOOP. DAG size: 1045 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:56:31,141 WARN L233 SmtUtils]: Spent 19.55s on a formula simplification that was a NOOP. DAG size: 1039 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:57:02,523 WARN L233 SmtUtils]: Spent 24.41s on a formula simplification that was a NOOP. DAG size: 1041 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:57:05,125 INFO L321 Elim1Store]: treesize reduction 50, result has 35.1 percent of original size [2022-11-18 20:57:05,127 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 2463 treesize of output 2336 [2022-11-18 20:57:05,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 20:57:05,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-18 20:57:05,725 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:57:05,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 66 [2022-11-18 20:57:05,743 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 20:57:05,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 22 treesize of output 16 [2022-11-18 20:57:05,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-18 20:57:05,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-11-18 20:57:05,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-18 20:57:06,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 48 [2022-11-18 20:57:06,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2022-11-18 20:57:06,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2022-11-18 20:57:06,479 INFO L321 Elim1Store]: treesize reduction 36, result has 46.3 percent of original size [2022-11-18 20:57:06,479 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 60 treesize of output 62 [2022-11-18 20:57:06,880 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 20:57:06,881 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 1 case distinctions, treesize of input 49 treesize of output 48 [2022-11-18 20:57:06,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 20:57:07,459 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-18 20:57:07,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:57:07,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:57:11,202 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:57:11,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272944065] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:57:11,202 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:57:11,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 28 [2022-11-18 20:57:11,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405715163] [2022-11-18 20:57:11,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:57:11,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-18 20:57:11,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:57:11,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-18 20:57:11,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=638, Unknown=27, NotChecked=0, Total=812 [2022-11-18 20:57:11,205 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 29 states, 28 states have (on average 1.75) internal successors, (49), 29 states have internal predecessors, (49), 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-18 20:57:11,366 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (not (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.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_~y_ref~0#1.offset| 0) (or (and (= (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 0) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) (not .cse1)) (or .cse2 .cse1) (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse7 (select .cse10 0)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse52 (select .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse42 (<= .cse7 0)) (.cse41 (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (and (or (exists ((v_DerPreprocessor_85 (Array Int Int))) (let ((.cse4 (select v_DerPreprocessor_85 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= v_DerPreprocessor_85 (store (store .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse4) 0 (select v_DerPreprocessor_85 0))) (exists ((v_DerPreprocessor_84 (Array Int Int)) (v_DerPreprocessor_83 (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_83) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_84) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_85) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_83) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_84) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_85))) (and (= v_DerPreprocessor_84 (select .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (exists ((v_prenex_217 (Array Int Int)) (v_prenex_218 (Array Int Int)) (v_DerPreprocessor_56 (Array Int Int)) (v_DerPreprocessor_57 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (let ((.cse6 (store (store (store (store (store (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_56) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_57) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_58) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_56) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_57) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_58)) (.cse8 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_218) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_217) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_58) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_218) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_217) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_58))) (and (= .cse0 (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_DerPreprocessor_57) (= (select v_DerPreprocessor_58 0) .cse7) (= (select .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_217) (= .cse0 (select .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))))) (exists ((v_DerPreprocessor_53 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int))) (let ((.cse9 (store (store (store (store (store (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_53) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_54) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse10) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_53) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_54) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse10))) (and (= (select .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse0) (= (select .cse9 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_DerPreprocessor_54)))) (= .cse0 (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (exists ((v_prenex_352 (Array Int Int)) (v_prenex_353 (Array Int Int))) (let ((.cse11 (store (store (store (store (store (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_352) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_353) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_85) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_352) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_353) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_85))) (and (= (select .cse11 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse0) (= (select .cse11 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_353))))))) (= .cse4 .cse7)))) (exists ((v_DerPreprocessor_85 (Array Int Int))) (let ((.cse12 (select v_DerPreprocessor_85 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= v_DerPreprocessor_85 (store (store .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse12) 0 (select v_DerPreprocessor_85 0))) (= .cse12 .cse7) (exists ((v_DerPreprocessor_84 (Array Int Int)) (v_DerPreprocessor_83 (Array Int Int))) (let ((.cse13 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_83) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_84) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_85) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_83) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_84) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_85))) (and (= v_DerPreprocessor_84 (select .cse13 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (exists ((v_prenex_231 (Array Int Int)) (v_prenex_232 (Array Int Int))) (let ((.cse14 (store (store (store (store (store (store .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_231) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_232) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse10) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_231) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_232) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse10))) (and (= v_prenex_232 (select .cse14 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse0 (select .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))))) (exists ((v_prenex_233 (Array Int Int)) (v_prenex_333 (Array Int Int)) (v_prenex_234 (Array Int Int)) (v_prenex_334 (Array Int Int)) (v_prenex_335 (Array Int Int))) (let ((.cse15 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_234) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_233) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_335) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_234) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_233) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_335)) (.cse16 (store (store (store (store (store (store .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_333) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_334) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_335) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_333) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_334) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_335))) (and (= (select .cse15 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_233) (= .cse0 (select .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse15 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse0) (= v_prenex_334 (select .cse16 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= (select v_prenex_335 0) .cse7)))) (exists ((v_DerPreprocessor_65 (Array Int Int)) (v_DerPreprocessor_66 (Array Int Int))) (let ((.cse17 (store (store (store (store (store (store .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_65) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_66) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_85) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_65) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_66) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_85))) (and (= v_DerPreprocessor_66 (select .cse17 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse0 (select .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))))) (= .cse0 (select .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)))))))) (exists ((v_DerPreprocessor_85 (Array Int Int))) (let ((.cse25 (select v_DerPreprocessor_85 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (exists ((v_DerPreprocessor_84 (Array Int Int)) (v_DerPreprocessor_83 (Array Int Int)) (v_prenex_354 (Array Int Int)) (v_prenex_355 (Array Int Int)) (v_prenex_237 (Array Int Int)) (v_prenex_238 (Array Int Int))) (let ((.cse24 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_83) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_84) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_85) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_83) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_84) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_85))) (let ((.cse20 (store (store (store (store (store (store .cse24 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_237) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_238) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse10) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_237) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_238) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse10)) (.cse19 (select .cse24 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse18 (store (store (store (store (store (store .cse24 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_354) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_355) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_85) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_354) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_355) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_85))) (and (= (select .cse18 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_355) (= v_DerPreprocessor_84 .cse19) (= (select .cse20 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_238) (= .cse0 (select .cse20 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (exists ((v_prenex_239 (Array Int Int)) (v_prenex_339 (Array Int Int)) (v_prenex_240 (Array Int Int)) (v_prenex_340 (Array Int Int)) (v_prenex_341 (Array Int Int))) (let ((.cse23 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_240) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_239) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_341) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_240) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_239) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_341))) (let ((.cse22 (select .cse23 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse21 (store (store (store (store (store (store .cse24 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_339) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_340) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_341) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_339) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_340) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_341))) (and (= .cse0 (select .cse21 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse22 .cse19) (= .cse0 (select .cse23 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_prenex_239 .cse22) (= v_prenex_340 (select .cse21 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)))))) (= .cse0 (select .cse24 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse0 (select .cse18 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)))))) (= v_DerPreprocessor_85 (store (store .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse25) 0 (select v_DerPreprocessor_85 0))) (= .cse25 .cse7)))) (exists ((v_DerPreprocessor_85 (Array Int Int))) (let ((.cse26 (select v_DerPreprocessor_85 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= v_DerPreprocessor_85 (store (store .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse26) 0 (select v_DerPreprocessor_85 0))) (= .cse26 .cse7) (exists ((v_DerPreprocessor_84 (Array Int Int)) (v_DerPreprocessor_83 (Array Int Int)) (v_prenex_354 (Array Int Int)) (v_prenex_355 (Array Int Int)) (v_prenex_237 (Array Int Int)) (v_prenex_238 (Array Int Int))) (let ((.cse28 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_83) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_84) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_85) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_83) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_84) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_85))) (let ((.cse29 (store (store (store (store (store (store .cse28 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_237) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_238) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse10) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_237) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_238) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse10)) (.cse27 (store (store (store (store (store (store .cse28 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_354) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_355) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_85) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_354) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_355) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_85))) (and (= (select .cse27 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_355) (= v_DerPreprocessor_84 (select .cse28 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= (select .cse29 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_238) (= .cse0 (select .cse29 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse0 (select .cse28 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (exists ((v_prenex_328 (Array Int Int)) (v_prenex_329 (Array Int Int)) (v_prenex_330 (Array Int Int)) (v_prenex_331 (Array Int Int)) (v_prenex_332 (Array Int Int))) (let ((.cse31 (store (store (store (store (store (store .cse28 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_330) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_331) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_332) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_330) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_331) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_332))) (let ((.cse30 (select .cse31 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse32 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_329) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_328) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_332) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_329) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_328) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_332))) (and (= .cse3 .cse30) (= .cse0 (select .cse31 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse32 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_328) (= v_prenex_331 .cse30) (= (select .cse32 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse0))))) (= .cse0 (select .cse27 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))))))))) (exists ((v_DerPreprocessor_85 (Array Int Int))) (let ((.cse33 (select v_DerPreprocessor_85 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= v_DerPreprocessor_85 (store (store .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse33) 0 (select v_DerPreprocessor_85 0))) (exists ((v_DerPreprocessor_84 (Array Int Int)) (v_DerPreprocessor_83 (Array Int Int))) (let ((.cse36 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_83) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_84) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_85) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_83) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_84) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_85))) (let ((.cse34 (select .cse36 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= v_DerPreprocessor_84 .cse34) (exists ((v_prenex_350 (Array Int Int)) (v_prenex_351 (Array Int Int))) (let ((.cse35 (store (store (store (store (store (store .cse36 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_350) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_351) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_85) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_350) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_351) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_85))) (and (= (select .cse35 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse0) (= (select .cse35 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_351)))) (= .cse0 (select .cse36 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (exists ((v_prenex_327 (Array Int Int)) (v_prenex_325 (Array Int Int)) (v_prenex_215 (Array Int Int)) (v_prenex_326 (Array Int Int)) (v_prenex_216 (Array Int Int))) (let ((.cse39 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_216) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_215) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_327) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_216) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_215) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_327))) (let ((.cse37 (store (store (store (store (store (store .cse36 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_325) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_326) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_327) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_325) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_326) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_327)) (.cse38 (select .cse39 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= (select .cse37 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_326) (= v_prenex_215 .cse38) (= .cse0 (select .cse39 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse0 (select .cse37 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse38 .cse34))))) (exists ((v_prenex_235 (Array Int Int)) (v_prenex_236 (Array Int Int))) (let ((.cse40 (store (store (store (store (store (store .cse36 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_235) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_236) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse10) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_235) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_236) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse10))) (and (= v_prenex_236 (select .cse40 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= (select .cse40 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse0)))))))) (= .cse33 .cse7))))) .cse41 .cse42) (and (let ((.cse44 (select .cse10 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (or (exists ((v_arrayElimCell_51 (Array Int Int))) (let ((.cse43 (select v_arrayElimCell_51 0))) (and (<= .cse43 0) (= .cse43 .cse44) (exists ((v_prenex_362 (Array Int Int)) (v_prenex_363 (Array Int Int)) (v_prenex_356 (Array Int Int)) (v_prenex_313 (Array Int Int)) (v_prenex_357 (Array Int Int)) (v_prenex_314 (Array Int Int)) (v_prenex_315 (Array Int Int))) (let ((.cse46 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_356) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_357) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse10) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_356) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_357) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse10)) (.cse45 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_313) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_314) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_315) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_313) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_314) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_315)) (.cse47 (select (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_362) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_363) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimCell_51) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_362) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_363) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimCell_51) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (and (= v_prenex_313 (select .cse45 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse46 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) v_prenex_356) (= .cse47 (select .cse46 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= (select .cse45 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) .cse47) (= .cse43 (select v_prenex_315 0)) (= .cse0 .cse47) (= .cse47 v_prenex_362) (= (store (store .cse47 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse44) 0 .cse7) .cse10))))))) (and .cse2 .cse42) (exists ((v_prenex_241 (Array Int Int)) (v_prenex_242 (Array Int Int)) (v_arrayElimCell_51 (Array Int Int))) (let ((.cse48 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_241) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_242) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimCell_51) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_241) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_242) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimCell_51)) (.cse49 (select v_arrayElimCell_51 0))) (and (= v_prenex_241 (select .cse48 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= .cse49 0) (= .cse49 .cse44) (= .cse3 (select .cse48 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (exists ((v_prenex_319 (Array Int Int)) (v_prenex_320 (Array Int Int)) (v_prenex_321 (Array Int Int)) (v_prenex_356 (Array Int Int)) (v_prenex_357 (Array Int Int))) (let ((.cse53 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_319) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_320) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_321) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_319) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_320) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_321))) (let ((.cse50 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_356) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_357) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse10) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_356) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_357) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse10)) (.cse51 (select .cse53 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= (select .cse50 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) v_prenex_356) (= .cse51 (select .cse50 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= (store (store .cse51 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse44) 0 .cse7) .cse10) (= .cse49 (select v_prenex_321 0)) (= .cse52 (select .cse51 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (= (select .cse53 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) v_prenex_319)))))))) (exists ((v_prenex_241 (Array Int Int)) (v_prenex_242 (Array Int Int)) (v_arrayElimCell_51 (Array Int Int))) (let ((.cse54 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_241) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_242) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimCell_51) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_241) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_242) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimCell_51)) (.cse55 (select v_arrayElimCell_51 0))) (and (= v_prenex_241 (select .cse54 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= .cse55 0) (= .cse3 (select .cse54 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse55 .cse7) (exists ((v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_63 (Array Int Int)) (v_prenex_319 (Array Int Int)) (v_prenex_320 (Array Int Int)) (v_prenex_321 (Array Int Int)) (v_DerPreprocessor_73 Int) (v_DerPreprocessor_74 Int)) (let ((.cse59 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_319) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_320) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_321) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_319) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_320) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_321))) (let ((.cse57 (select .cse59 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse56 (select (store (store .cse57 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_DerPreprocessor_73) 0 v_DerPreprocessor_74) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse58 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_63) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse10) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_63) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse10))) (and (= .cse56 v_DerPreprocessor_73) (= .cse57 (select .cse58 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse56 .cse55) (= .cse55 (select v_prenex_321 0)) (= .cse52 (select .cse57 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (= v_DerPreprocessor_62 (select .cse58 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse59 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) v_prenex_319))))))))) (exists ((v_arrayElimCell_51 (Array Int Int))) (let ((.cse63 (select v_arrayElimCell_51 0))) (and (exists ((v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_63 (Array Int Int)) (v_prenex_362 (Array Int Int)) (v_prenex_363 (Array Int Int)) (v_prenex_313 (Array Int Int)) (v_prenex_314 (Array Int Int)) (v_DerPreprocessor_73 Int) (v_prenex_315 (Array Int Int)) (v_DerPreprocessor_74 Int)) (let ((.cse61 (select (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_362) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_363) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimCell_51) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_362) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_363) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimCell_51) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse60 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_313) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_314) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_315) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_313) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_314) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_315)) (.cse62 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_63) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse10) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_63) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse10)) (.cse64 (select (store (store .cse61 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_DerPreprocessor_73) 0 v_DerPreprocessor_74) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= v_prenex_313 (select .cse60 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse61 (select .cse62 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= (select .cse60 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) .cse61) (= .cse63 (select v_prenex_315 0)) (= .cse0 .cse61) (= .cse64 v_DerPreprocessor_73) (= .cse61 v_prenex_362) (= v_DerPreprocessor_62 (select .cse62 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse64 .cse63))))) (<= .cse63 0) (= .cse63 .cse7)))))) (not .cse41)) (and .cse41 (or (and (or (exists ((v_DerPreprocessor_94 (Array Int Int))) (let ((.cse65 (select v_DerPreprocessor_94 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= .cse65 .cse7) (exists ((v_DerPreprocessor_92 (Array Int Int)) (v_DerPreprocessor_93 (Array Int Int)) (v_prenex_354 (Array Int Int)) (v_prenex_355 (Array Int Int))) (let ((.cse66 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_92) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_93) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_94) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_92) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_93) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_94))) (let ((.cse72 (store (store (store (store (store (store .cse66 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_354) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_355) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_94) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_354) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_355) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_94))) (and (= (select .cse66 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_DerPreprocessor_93) (exists ((v_prenex_237 (Array Int Int)) (v_prenex_238 (Array Int Int))) (let ((.cse68 (store (store (store (store (store (store .cse66 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_237) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_238) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse10) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_237) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_238) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse10))) (let ((.cse67 (select .cse68 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= .cse67 v_prenex_238) (= .cse0 (select .cse68 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (exists ((v_prenex_239 (Array Int Int)) (v_prenex_339 (Array Int Int)) (v_prenex_240 (Array Int Int)) (v_prenex_340 (Array Int Int)) (v_prenex_341 (Array Int Int))) (let ((.cse70 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_240) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_239) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_341) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_240) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_239) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_341))) (let ((.cse71 (store (store (store (store (store (store .cse66 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_339) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_340) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_341) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_339) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_340) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_341)) (.cse69 (select .cse70 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= .cse67 .cse69) (= .cse0 (select .cse70 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_prenex_340 (select .cse71 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse0 (select .cse71 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_prenex_239 .cse69))))))))) (= .cse0 (select .cse66 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse0 (select .cse72 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_prenex_355 (select .cse72 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)))))) (= v_DerPreprocessor_94 (store (store .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse65) 0 (select v_DerPreprocessor_94 0)))))) (exists ((v_DerPreprocessor_94 (Array Int Int))) (let ((.cse73 (select v_DerPreprocessor_94 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= .cse73 .cse7) (= v_DerPreprocessor_94 (store (store .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse73) 0 (select v_DerPreprocessor_94 0))) (exists ((v_DerPreprocessor_92 (Array Int Int)) (v_DerPreprocessor_93 (Array Int Int)) (v_prenex_354 (Array Int Int)) (v_prenex_355 (Array Int Int))) (let ((.cse74 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_92) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_93) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_94) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_92) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_93) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_94))) (let ((.cse80 (store (store (store (store (store (store .cse74 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_354) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_355) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_94) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_354) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_355) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_94))) (and (= (select .cse74 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_DerPreprocessor_93) (exists ((v_prenex_237 (Array Int Int)) (v_prenex_238 (Array Int Int))) (let ((.cse76 (store (store (store (store (store (store .cse74 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_237) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_238) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse10) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_237) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_238) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse10))) (let ((.cse75 (select .cse76 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= .cse75 v_prenex_238) (= .cse0 (select .cse76 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (exists ((v_prenex_328 (Array Int Int)) (v_prenex_329 (Array Int Int)) (v_prenex_330 (Array Int Int)) (v_prenex_331 (Array Int Int)) (v_prenex_332 (Array Int Int))) (let ((.cse79 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_329) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_328) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_332) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_329) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_328) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_332))) (let ((.cse77 (store (store (store (store (store (store .cse74 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_330) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_331) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_332) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_330) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_331) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_332)) (.cse78 (select .cse79 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= .cse0 (select .cse77 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse77 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_331) (= .cse78 v_prenex_328) (= .cse75 .cse78) (= (select .cse79 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse0))))))))) (= .cse0 (select .cse74 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse0 (select .cse80 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_prenex_355 (select .cse80 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))))))))) (exists ((v_DerPreprocessor_94 (Array Int Int))) (let ((.cse81 (select v_DerPreprocessor_94 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= .cse81 .cse7) (= v_DerPreprocessor_94 (store (store .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse81) 0 (select v_DerPreprocessor_94 0))) (exists ((v_DerPreprocessor_92 (Array Int Int)) (v_DerPreprocessor_93 (Array Int Int))) (let ((.cse83 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_92) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_93) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_94) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_92) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_93) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_94))) (and (exists ((v_prenex_350 (Array Int Int)) (v_prenex_351 (Array Int Int))) (let ((.cse82 (store (store (store (store (store (store .cse83 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_350) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_351) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_94) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_350) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_351) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_94))) (and (= (select .cse82 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_351) (= .cse0 (select .cse82 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))))) (exists ((v_prenex_235 (Array Int Int)) (v_prenex_236 (Array Int Int))) (let ((.cse84 (store (store (store (store (store (store .cse83 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_235) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_236) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse10) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_235) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_236) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse10))) (and (= (select .cse84 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse0) (= (select .cse84 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_236)))) (exists ((v_prenex_327 (Array Int Int)) (v_prenex_325 (Array Int Int)) (v_prenex_215 (Array Int Int)) (v_prenex_326 (Array Int Int)) (v_prenex_216 (Array Int Int))) (let ((.cse87 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_216) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_215) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_327) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_216) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_215) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_327))) (let ((.cse85 (store (store (store (store (store (store .cse83 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_325) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_326) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_327) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_325) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_326) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_327)) (.cse86 (select .cse87 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= (select .cse85 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_326) (= v_prenex_215 .cse86) (= (select .cse85 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse0) (= .cse0 (select .cse87 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse86 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse52))))) (= (select .cse83 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_DerPreprocessor_93) (= .cse0 (select .cse83 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)))))))) (exists ((v_DerPreprocessor_94 (Array Int Int))) (let ((.cse88 (select v_DerPreprocessor_94 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= .cse88 .cse7) (= v_DerPreprocessor_94 (store (store .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse88) 0 (select v_DerPreprocessor_94 0))) (exists ((v_DerPreprocessor_92 (Array Int Int)) (v_DerPreprocessor_93 (Array Int Int))) (let ((.cse91 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_92) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_93) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_94) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_92) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_93) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_94))) (and (exists ((v_prenex_217 (Array Int Int)) (v_prenex_218 (Array Int Int)) (v_DerPreprocessor_56 (Array Int Int)) (v_DerPreprocessor_57 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (let ((.cse89 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_218) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_217) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_58) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_218) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_217) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_58)) (.cse90 (store (store (store (store (store (store .cse91 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_56) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_57) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_58) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_56) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_57) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_58))) (and (= (select v_DerPreprocessor_58 0) .cse7) (= (select .cse89 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_217) (= .cse0 (select .cse90 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse0 (select .cse89 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse90 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_DerPreprocessor_57)))) (= (select .cse91 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_DerPreprocessor_93) (exists ((v_DerPreprocessor_53 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int))) (let ((.cse92 (store (store (store (store (store (store .cse91 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_53) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_54) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse10) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_53) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_54) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse10))) (and (= .cse0 (select .cse92 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_DerPreprocessor_54 (select .cse92 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))))) (= .cse0 (select .cse91 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (exists ((v_prenex_352 (Array Int Int)) (v_prenex_353 (Array Int Int))) (let ((.cse93 (store (store (store (store (store (store .cse91 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_352) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_353) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_94) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_352) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_353) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_94))) (and (= .cse0 (select .cse93 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_prenex_353 (select .cse93 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))))))))))) (exists ((v_DerPreprocessor_94 (Array Int Int))) (let ((.cse99 (select v_DerPreprocessor_94 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (exists ((v_DerPreprocessor_92 (Array Int Int)) (v_DerPreprocessor_93 (Array Int Int))) (let ((.cse94 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_92) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_93) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_94) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_92) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_93) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_94))) (and (= (select .cse94 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_DerPreprocessor_93) (= .cse0 (select .cse94 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (exists ((v_prenex_233 (Array Int Int)) (v_prenex_333 (Array Int Int)) (v_prenex_234 (Array Int Int)) (v_prenex_334 (Array Int Int)) (v_prenex_335 (Array Int Int))) (let ((.cse96 (store (store (store (store (store (store .cse94 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_333) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_334) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_335) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_333) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_334) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_335)) (.cse95 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_234) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_233) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_335) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_234) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_233) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_335))) (and (= (select .cse95 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_233) (= (select .cse96 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse0) (= v_prenex_334 (select .cse96 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= (select .cse95 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse0) (= (select v_prenex_335 0) .cse7)))) (exists ((v_prenex_231 (Array Int Int)) (v_prenex_232 (Array Int Int))) (let ((.cse97 (store (store (store (store (store (store .cse94 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_231) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_232) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse10) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_231) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_232) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse10))) (and (= (select .cse97 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse0) (= v_prenex_232 (select .cse97 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))))) (exists ((v_DerPreprocessor_65 (Array Int Int)) (v_DerPreprocessor_66 (Array Int Int))) (let ((.cse98 (store (store (store (store (store (store .cse94 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_65) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_66) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_94) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_65) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_66) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_94))) (and (= (select .cse98 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse0) (= v_DerPreprocessor_66 (select .cse98 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)))))))) (= .cse99 .cse7) (= v_DerPreprocessor_94 (store (store .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse99) 0 (select v_DerPreprocessor_94 0))))))) .cse42) (and (or (exists ((v_DerPreprocessor_91 (Array Int Int))) (and (= (select v_DerPreprocessor_91 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse7) (exists ((v_DerPreprocessor_90 (Array Int Int)) (v_DerPreprocessor_89 (Array Int Int))) (let ((.cse100 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_90) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_91) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_90) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_91))) (and (= (select .cse100 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_DerPreprocessor_90) (exists ((v_prenex_352 (Array Int Int)) (v_prenex_353 (Array Int Int))) (let ((.cse101 (store (store (store (store (store (store .cse100 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_352) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_353) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_91) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_352) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_353) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_91))) (and (= .cse0 (select .cse101 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_prenex_353 (select .cse101 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))))) (exists ((v_prenex_217 (Array Int Int)) (v_prenex_218 (Array Int Int)) (v_DerPreprocessor_56 (Array Int Int)) (v_DerPreprocessor_57 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (let ((.cse102 (store (store (store (store (store (store .cse100 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_56) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_57) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_58) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_56) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_57) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_58)) (.cse103 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_218) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_217) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_58) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_218) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_217) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_58))) (and (= .cse0 (select .cse102 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select v_DerPreprocessor_58 0) .cse7) (= (select .cse103 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_217) (= v_DerPreprocessor_57 (select .cse102 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse0 (select .cse103 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))))) (exists ((v_DerPreprocessor_53 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int))) (let ((.cse104 (store (store (store (store (store (store .cse100 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_53) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_54) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse10) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_53) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_54) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse10))) (and (= v_DerPreprocessor_54 (select .cse104 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse0 (select .cse104 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))))) (= .cse0 (select .cse100 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))))))) (exists ((v_DerPreprocessor_91 (Array Int Int))) (and (= (select v_DerPreprocessor_91 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse7) (exists ((v_DerPreprocessor_90 (Array Int Int)) (v_DerPreprocessor_89 (Array Int Int))) (let ((.cse105 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_90) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_91) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_90) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_91))) (and (= (select .cse105 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_DerPreprocessor_90) (exists ((v_prenex_231 (Array Int Int)) (v_prenex_232 (Array Int Int))) (let ((.cse106 (store (store (store (store (store (store .cse105 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_231) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_232) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse10) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_231) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_232) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse10))) (and (= .cse0 (select .cse106 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse106 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_232)))) (= .cse0 (select .cse105 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (exists ((v_DerPreprocessor_65 (Array Int Int)) (v_DerPreprocessor_66 (Array Int Int))) (let ((.cse107 (store (store (store (store (store (store .cse105 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_65) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_66) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_91) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_65) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_66) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_91))) (and (= v_DerPreprocessor_66 (select .cse107 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse0 (select .cse107 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))))) (exists ((v_prenex_233 (Array Int Int)) (v_prenex_234 (Array Int Int)) (v_prenex_333 (Array Int Int)) (v_prenex_334 (Array Int Int)) (v_prenex_335 (Array Int Int))) (let ((.cse109 (store (store (store (store (store (store .cse105 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_333) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_334) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_335) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_333) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_334) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_335)) (.cse108 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_234) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_233) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_335) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_234) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_233) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_335))) (and (= (select .cse108 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_233) (= v_prenex_334 (select .cse109 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse0 (select .cse109 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse108 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse0) (= (select v_prenex_335 0) .cse7))))))))) (exists ((v_DerPreprocessor_91 (Array Int Int))) (and (= (select v_DerPreprocessor_91 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse7) (exists ((v_DerPreprocessor_90 (Array Int Int)) (v_DerPreprocessor_89 (Array Int Int))) (let ((.cse110 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_90) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_91) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_90) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_91))) (and (= (select .cse110 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_DerPreprocessor_90) (exists ((v_prenex_327 (Array Int Int)) (v_prenex_325 (Array Int Int)) (v_prenex_215 (Array Int Int)) (v_prenex_326 (Array Int Int)) (v_prenex_216 (Array Int Int))) (let ((.cse112 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_216) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_215) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_327) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_216) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_215) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_327)) (.cse111 (store (store (store (store (store (store .cse110 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_325) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_326) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_327) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_325) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_326) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_327))) (and (= .cse0 (select .cse111 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_prenex_215 (select .cse112 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse0 (select .cse112 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse111 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_326) (= (select v_prenex_327 0) .cse7)))) (= .cse0 (select .cse110 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (exists ((v_prenex_350 (Array Int Int)) (v_prenex_351 (Array Int Int))) (let ((.cse113 (store (store (store (store (store (store .cse110 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_350) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_351) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_91) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_350) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_351) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_91))) (and (= .cse0 (select .cse113 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse113 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_351)))) (exists ((v_prenex_235 (Array Int Int)) (v_prenex_236 (Array Int Int))) (let ((.cse114 (store (store (store (store (store (store .cse110 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_235) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_236) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse10) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_235) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_236) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse10))) (and (= v_prenex_236 (select .cse114 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= (select .cse114 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse0))))))))) (exists ((v_DerPreprocessor_91 (Array Int Int))) (let ((.cse115 (select v_DerPreprocessor_91 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= .cse115 .cse7) (exists ((v_prenex_354 (Array Int Int)) (v_DerPreprocessor_90 (Array Int Int)) (v_prenex_355 (Array Int Int)) (v_DerPreprocessor_89 (Array Int Int))) (let ((.cse121 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_90) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_91) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_90) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_91))) (let ((.cse123 (store (store (store (store (store (store .cse121 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_354) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_355) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_91) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_354) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_355) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_91))) (and (exists ((v_prenex_237 (Array Int Int)) (v_prenex_238 (Array Int Int))) (let ((.cse122 (store (store (store (store (store (store .cse121 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_237) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_238) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse10) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_237) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_238) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse10))) (let ((.cse118 (select .cse122 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (exists ((v_prenex_328 (Array Int Int)) (v_prenex_329 (Array Int Int)) (v_prenex_330 (Array Int Int)) (v_prenex_331 (Array Int Int)) (v_prenex_332 (Array Int Int))) (let ((.cse120 (store (store (store (store (store (store .cse121 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_330) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_331) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_332) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_330) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_331) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_332)) (.cse119 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_329) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_328) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_332) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_329) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_328) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_332))) (let ((.cse117 (select .cse119 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse116 (select .cse120 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= v_DerPreprocessor_91 (store (store .cse116 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse115) 0 (select v_DerPreprocessor_91 0))) (= .cse117 v_prenex_328) (= .cse117 .cse118) (= v_prenex_331 .cse116) (= (select .cse119 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse0) (= .cse0 (select .cse120 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)))))) (= v_prenex_238 .cse118) (= .cse0 (select .cse122 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)))))) (= .cse0 (select .cse123 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse121 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_DerPreprocessor_90) (= (select .cse123 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_355) (= .cse0 (select .cse121 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))))))))) (exists ((v_DerPreprocessor_91 (Array Int Int))) (and (= (select v_DerPreprocessor_91 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse7) (exists ((v_prenex_354 (Array Int Int)) (v_DerPreprocessor_90 (Array Int Int)) (v_prenex_355 (Array Int Int)) (v_DerPreprocessor_89 (Array Int Int))) (let ((.cse128 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_90) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_91) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_90) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_91))) (let ((.cse130 (store (store (store (store (store (store .cse128 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_354) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_355) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_91) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_354) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_355) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_91))) (and (exists ((v_prenex_237 (Array Int Int)) (v_prenex_238 (Array Int Int))) (let ((.cse129 (store (store (store (store (store (store .cse128 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_237) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_238) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse10) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_237) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_238) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse10))) (let ((.cse125 (select .cse129 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (exists ((v_prenex_239 (Array Int Int)) (v_prenex_339 (Array Int Int)) (v_prenex_240 (Array Int Int)) (v_prenex_340 (Array Int Int)) (v_prenex_341 (Array Int Int))) (let ((.cse127 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_240) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_239) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_341) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_240) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_239) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_341))) (let ((.cse124 (store (store (store (store (store (store .cse128 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_339) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_340) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_341) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_339) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_340) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_341)) (.cse126 (select .cse127 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= (select .cse124 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_340) (= .cse125 .cse126) (= .cse0 (select .cse124 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse0 (select .cse127 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_prenex_239 .cse126))))) (= v_prenex_238 .cse125) (= .cse0 (select .cse129 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)))))) (= .cse0 (select .cse130 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse128 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_DerPreprocessor_90) (= (select .cse130 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_355) (= .cse0 (select .cse128 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))))))))) .cse42))) (and (or (and (or (exists ((v_DerPreprocessor_88 (Array Int Int))) (and (exists ((v_DerPreprocessor_86 (Array Int Int)) (v_DerPreprocessor_87 (Array Int Int)) (v_prenex_354 (Array Int Int)) (v_prenex_355 (Array Int Int)) (v_prenex_237 (Array Int Int)) (v_prenex_238 (Array Int Int))) (let ((.cse138 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_86) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_87) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_88) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_86) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_87) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_88))) (let ((.cse134 (store (store (store (store (store (store .cse138 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_237) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_238) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse10) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_237) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_238) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse10))) (let ((.cse132 (select .cse134 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse131 (store (store (store (store (store (store .cse138 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_354) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_355) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_88) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_354) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_355) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_88)) (.cse133 (select .cse138 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= (select .cse131 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse0) (= .cse132 v_prenex_238) (= .cse132 .cse133) (= v_prenex_355 (select .cse131 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse0 (select .cse134 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_DerPreprocessor_87 .cse133) (exists ((v_prenex_239 (Array Int Int)) (v_prenex_339 (Array Int Int)) (v_prenex_240 (Array Int Int)) (v_prenex_340 (Array Int Int)) (v_prenex_341 (Array Int Int))) (let ((.cse137 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_240) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_239) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_341) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_240) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_239) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_341))) (let ((.cse135 (store (store (store (store (store (store .cse138 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_339) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_340) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_341) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_339) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_340) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_341)) (.cse136 (select .cse137 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= .cse0 (select .cse135 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse133 .cse136) (= .cse0 (select .cse137 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse135 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_340) (= v_prenex_239 .cse136))))) (= .cse0 (select .cse138 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))))))) (= (select v_DerPreprocessor_88 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse7))) (exists ((v_DerPreprocessor_88 (Array Int Int))) (and (exists ((v_DerPreprocessor_86 (Array Int Int)) (v_DerPreprocessor_87 (Array Int Int))) (let ((.cse143 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_86) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_87) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_88) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_86) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_87) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_88))) (let ((.cse141 (select .cse143 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (exists ((v_prenex_327 (Array Int Int)) (v_prenex_215 (Array Int Int)) (v_prenex_325 (Array Int Int)) (v_prenex_216 (Array Int Int)) (v_prenex_326 (Array Int Int))) (let ((.cse142 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_216) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_215) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_327) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_216) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_215) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_327))) (let ((.cse140 (store (store (store (store (store (store .cse143 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_325) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_326) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_327) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_325) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_326) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_327)) (.cse139 (select .cse142 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= v_prenex_215 .cse139) (= v_prenex_326 (select .cse140 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse0 (select .cse140 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse141 .cse139) (= .cse0 (select .cse142 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)))))) (exists ((v_prenex_350 (Array Int Int)) (v_prenex_351 (Array Int Int))) (let ((.cse144 (store (store (store (store (store (store .cse143 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_350) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_351) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_88) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_350) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_351) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_88))) (and (= .cse0 (select .cse144 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse144 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_351)))) (exists ((v_prenex_235 (Array Int Int)) (v_prenex_236 (Array Int Int))) (let ((.cse145 (store (store (store (store (store (store .cse143 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_235) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_236) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse10) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_235) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_236) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse10))) (and (= v_prenex_236 (select .cse145 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse0 (select .cse145 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))))) (= v_DerPreprocessor_87 .cse141) (= .cse0 (select .cse143 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)))))) (= (select v_DerPreprocessor_88 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse7))) (exists ((v_DerPreprocessor_88 (Array Int Int))) (and (exists ((v_DerPreprocessor_86 (Array Int Int)) (v_DerPreprocessor_87 (Array Int Int)) (v_prenex_354 (Array Int Int)) (v_prenex_355 (Array Int Int)) (v_prenex_237 (Array Int Int)) (v_prenex_238 (Array Int Int))) (let ((.cse152 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_86) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_87) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_88) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_86) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_87) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_88))) (let ((.cse153 (store (store (store (store (store (store .cse152 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_237) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_238) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse10) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_237) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_238) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse10))) (let ((.cse147 (select .cse153 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse146 (store (store (store (store (store (store .cse152 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_354) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_355) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_88) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_354) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_355) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_88)) (.cse148 (select .cse152 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= (select .cse146 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse0) (= .cse147 v_prenex_238) (= .cse147 .cse148) (exists ((v_prenex_328 (Array Int Int)) (v_prenex_329 (Array Int Int)) (v_prenex_330 (Array Int Int)) (v_prenex_331 (Array Int Int)) (v_prenex_332 (Array Int Int))) (let ((.cse151 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_329) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_328) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_332) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_329) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_328) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_332))) (let ((.cse150 (store (store (store (store (store (store .cse152 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_330) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_331) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_332) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_330) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_331) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_332)) (.cse149 (select .cse151 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= .cse149 .cse148) (= .cse0 (select .cse150 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse150 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_331) (= .cse149 v_prenex_328) (= (select .cse151 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse0))))) (= v_prenex_355 (select .cse146 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse0 (select .cse153 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_DerPreprocessor_87 .cse148) (= .cse0 (select .cse152 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))))))) (= (select v_DerPreprocessor_88 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse7))) (exists ((v_DerPreprocessor_88 (Array Int Int))) (and (= (select v_DerPreprocessor_88 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse7) (exists ((v_DerPreprocessor_86 (Array Int Int)) (v_DerPreprocessor_87 (Array Int Int))) (let ((.cse157 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_86) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_87) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_88) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_86) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_87) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_88))) (let ((.cse156 (select .cse157 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (exists ((v_DerPreprocessor_53 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int))) (let ((.cse154 (store (store (store (store (store (store .cse157 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_53) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_54) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse10) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_53) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_54) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse10))) (let ((.cse155 (select .cse154 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= .cse0 (select .cse154 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_DerPreprocessor_54 .cse155) (= .cse156 .cse155))))) (= v_DerPreprocessor_87 .cse156) (exists ((v_prenex_217 (Array Int Int)) (v_prenex_218 (Array Int Int)) (v_DerPreprocessor_56 (Array Int Int)) (v_DerPreprocessor_57 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (let ((.cse158 (store (store (store (store (store (store .cse157 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_56) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_57) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_58) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_56) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_57) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_58)) (.cse159 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_218) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_217) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_58) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_218) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_217) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_58))) (and (= (select v_DerPreprocessor_58 0) .cse7) (= v_DerPreprocessor_57 (select .cse158 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= (select .cse159 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_217) (= .cse0 (select .cse158 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse0 (select .cse159 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))))) (exists ((v_prenex_352 (Array Int Int)) (v_prenex_353 (Array Int Int))) (let ((.cse160 (store (store (store (store (store (store .cse157 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_352) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_353) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_88) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_352) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_353) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_88))) (and (= (select .cse160 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse0) (= (select .cse160 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_353)))) (= .cse0 (select .cse157 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)))))))) (exists ((v_DerPreprocessor_88 (Array Int Int))) (and (exists ((v_DerPreprocessor_86 (Array Int Int)) (v_DerPreprocessor_87 (Array Int Int))) (let ((.cse163 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_86) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_87) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_88) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_86) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_87) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_88))) (and (exists ((v_prenex_233 (Array Int Int)) (v_prenex_234 (Array Int Int)) (v_prenex_333 (Array Int Int)) (v_prenex_334 (Array Int Int)) (v_prenex_335 (Array Int Int))) (let ((.cse162 (store (store (store (store (store (store .cse163 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_333) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_334) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_335) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_333) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_334) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_335)) (.cse161 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_234) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_233) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_335) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_234) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_233) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_335))) (and (= (select .cse161 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_233) (= (select .cse162 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_334) (= .cse0 (select .cse162 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse161 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse0) (= (select v_prenex_335 0) .cse7)))) (exists ((v_DerPreprocessor_65 (Array Int Int)) (v_DerPreprocessor_66 (Array Int Int))) (let ((.cse164 (store (store (store (store (store (store .cse163 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_65) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_66) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_88) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_65) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_66) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_88))) (and (= v_DerPreprocessor_66 (select .cse164 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= (select .cse164 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse0)))) (exists ((v_prenex_231 (Array Int Int)) (v_prenex_232 (Array Int Int))) (let ((.cse165 (store (store (store (store (store (store .cse163 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_231) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_232) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse10) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_231) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_232) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse10))) (and (= .cse0 (select .cse165 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse165 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_232)))) (= v_DerPreprocessor_87 (select .cse163 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse0 (select .cse163 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))))) (= (select v_DerPreprocessor_88 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse7)))) .cse42) (and .cse1 .cse42)) .cse41))))) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0))) is different from true [2022-11-18 20:57:39,701 WARN L233 SmtUtils]: Spent 27.30s on a formula simplification. DAG size of input: 1052 DAG size of output: 927 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:58:06,136 WARN L233 SmtUtils]: Spent 25.78s on a formula simplification. DAG size of input: 1046 DAG size of output: 1045 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:58:08,388 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse10 (select .cse13 0))) (let ((.cse2 (not (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse45 (<= .cse10 0)) (.cse1 (select .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (select .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.cse3 (let ((.cse148 (select .cse13 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (or (exists ((v_arrayElimCell_51 (Array Int Int))) (let ((.cse147 (select v_arrayElimCell_51 0))) (and (<= .cse147 0) (= .cse147 .cse148) (exists ((v_prenex_362 (Array Int Int)) (v_prenex_363 (Array Int Int)) (v_prenex_356 (Array Int Int)) (v_prenex_313 (Array Int Int)) (v_prenex_357 (Array Int Int)) (v_prenex_314 (Array Int Int)) (v_prenex_315 (Array Int Int))) (let ((.cse150 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_356) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_357) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse13) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_356) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_357) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse13)) (.cse149 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_313) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_314) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_315) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_313) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_314) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_315)) (.cse151 (select (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_362) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_363) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimCell_51) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_362) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_363) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimCell_51) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (and (= v_prenex_313 (select .cse149 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse150 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) v_prenex_356) (= .cse151 (select .cse150 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= (select .cse149 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) .cse151) (= .cse147 (select v_prenex_315 0)) (= .cse8 .cse151) (= .cse151 v_prenex_362) (= (store (store .cse151 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse148) 0 .cse10) .cse13))))))) (and .cse2 .cse45) (exists ((v_prenex_241 (Array Int Int)) (v_prenex_242 (Array Int Int)) (v_arrayElimCell_51 (Array Int Int))) (let ((.cse152 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_241) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_242) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimCell_51) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_241) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_242) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimCell_51)) (.cse153 (select v_arrayElimCell_51 0))) (and (= v_prenex_241 (select .cse152 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= .cse153 0) (= .cse153 .cse148) (= .cse5 (select .cse152 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (exists ((v_prenex_319 (Array Int Int)) (v_prenex_320 (Array Int Int)) (v_prenex_321 (Array Int Int)) (v_prenex_356 (Array Int Int)) (v_prenex_357 (Array Int Int))) (let ((.cse156 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_319) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_320) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_321) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_319) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_320) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_321))) (let ((.cse154 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_356) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_357) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse13) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_356) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_357) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse13)) (.cse155 (select .cse156 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= (select .cse154 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) v_prenex_356) (= .cse155 (select .cse154 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= (store (store .cse155 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse148) 0 .cse10) .cse13) (= .cse153 (select v_prenex_321 0)) (= .cse1 (select .cse155 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (= (select .cse156 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) v_prenex_319)))))))) (exists ((v_prenex_241 (Array Int Int)) (v_prenex_242 (Array Int Int)) (v_arrayElimCell_51 (Array Int Int))) (let ((.cse157 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_241) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_242) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimCell_51) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_241) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_242) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimCell_51)) (.cse158 (select v_arrayElimCell_51 0))) (and (= v_prenex_241 (select .cse157 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= .cse158 0) (= .cse5 (select .cse157 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse158 .cse10) (exists ((v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_63 (Array Int Int)) (v_prenex_319 (Array Int Int)) (v_prenex_320 (Array Int Int)) (v_prenex_321 (Array Int Int)) (v_DerPreprocessor_73 Int) (v_DerPreprocessor_74 Int)) (let ((.cse162 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_319) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_320) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_321) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_319) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_320) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_321))) (let ((.cse160 (select .cse162 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse159 (select (store (store .cse160 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_DerPreprocessor_73) 0 v_DerPreprocessor_74) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse161 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_63) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse13) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_63) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse13))) (and (= .cse159 v_DerPreprocessor_73) (= .cse160 (select .cse161 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse159 .cse158) (= .cse158 (select v_prenex_321 0)) (= .cse1 (select .cse160 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (= v_DerPreprocessor_62 (select .cse161 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse162 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) v_prenex_319))))))))) (exists ((v_arrayElimCell_51 (Array Int Int))) (let ((.cse166 (select v_arrayElimCell_51 0))) (and (exists ((v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_63 (Array Int Int)) (v_prenex_362 (Array Int Int)) (v_prenex_363 (Array Int Int)) (v_prenex_313 (Array Int Int)) (v_prenex_314 (Array Int Int)) (v_DerPreprocessor_73 Int) (v_prenex_315 (Array Int Int)) (v_DerPreprocessor_74 Int)) (let ((.cse164 (select (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_362) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_363) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimCell_51) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_362) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_363) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimCell_51) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse163 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_313) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_314) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_315) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_313) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_314) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_315)) (.cse165 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_63) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse13) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_63) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse13)) (.cse167 (select (store (store .cse164 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_DerPreprocessor_73) 0 v_DerPreprocessor_74) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= v_prenex_313 (select .cse163 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse164 (select .cse165 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= (select .cse163 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) .cse164) (= .cse166 (select v_prenex_315 0)) (= .cse8 .cse164) (= .cse167 v_DerPreprocessor_73) (= .cse164 v_prenex_362) (= v_DerPreprocessor_62 (select .cse165 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse167 .cse166))))) (<= .cse166 0) (= .cse166 .cse10))))))) (.cse4 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (and (<= 1 .cse0) (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (= .cse0 .cse1) .cse2 .cse3 (not .cse4) (= .cse0 |c_ULTIMATE.start_test_fun_#t~mem10#1|) (let ((.cse44 (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (and (or (exists ((v_DerPreprocessor_85 (Array Int Int))) (let ((.cse6 (select v_DerPreprocessor_85 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= v_DerPreprocessor_85 (store (store .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse6) 0 (select v_DerPreprocessor_85 0))) (exists ((v_DerPreprocessor_84 (Array Int Int)) (v_DerPreprocessor_83 (Array Int Int))) (let ((.cse7 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_83) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_84) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_85) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_83) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_84) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_85))) (and (= v_DerPreprocessor_84 (select .cse7 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (exists ((v_prenex_217 (Array Int Int)) (v_prenex_218 (Array Int Int)) (v_DerPreprocessor_56 (Array Int Int)) (v_DerPreprocessor_57 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (let ((.cse9 (store (store (store (store (store (store .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_56) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_57) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_58) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_56) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_57) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_58)) (.cse11 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_218) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_217) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_58) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_218) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_217) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_58))) (and (= .cse8 (select .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse9 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_DerPreprocessor_57) (= (select v_DerPreprocessor_58 0) .cse10) (= (select .cse11 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_217) (= .cse8 (select .cse11 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))))) (exists ((v_DerPreprocessor_53 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int))) (let ((.cse12 (store (store (store (store (store (store .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_53) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_54) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse13) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_53) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_54) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse13))) (and (= (select .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse8) (= (select .cse12 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_DerPreprocessor_54)))) (= .cse8 (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (exists ((v_prenex_352 (Array Int Int)) (v_prenex_353 (Array Int Int))) (let ((.cse14 (store (store (store (store (store (store .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_352) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_353) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_85) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_352) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_353) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_85))) (and (= (select .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse8) (= (select .cse14 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_353))))))) (= .cse6 .cse10)))) (exists ((v_DerPreprocessor_85 (Array Int Int))) (let ((.cse15 (select v_DerPreprocessor_85 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= v_DerPreprocessor_85 (store (store .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse15) 0 (select v_DerPreprocessor_85 0))) (= .cse15 .cse10) (exists ((v_DerPreprocessor_84 (Array Int Int)) (v_DerPreprocessor_83 (Array Int Int))) (let ((.cse16 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_83) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_84) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_85) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_83) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_84) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_85))) (and (= v_DerPreprocessor_84 (select .cse16 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (exists ((v_prenex_231 (Array Int Int)) (v_prenex_232 (Array Int Int))) (let ((.cse17 (store (store (store (store (store (store .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_231) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_232) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse13) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_231) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_232) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse13))) (and (= v_prenex_232 (select .cse17 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse8 (select .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))))) (exists ((v_prenex_233 (Array Int Int)) (v_prenex_333 (Array Int Int)) (v_prenex_234 (Array Int Int)) (v_prenex_334 (Array Int Int)) (v_prenex_335 (Array Int Int))) (let ((.cse18 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_234) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_233) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_335) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_234) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_233) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_335)) (.cse19 (store (store (store (store (store (store .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_333) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_334) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_335) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_333) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_334) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_335))) (and (= (select .cse18 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_233) (= .cse8 (select .cse19 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse18 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse8) (= v_prenex_334 (select .cse19 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= (select v_prenex_335 0) .cse10)))) (exists ((v_DerPreprocessor_65 (Array Int Int)) (v_DerPreprocessor_66 (Array Int Int))) (let ((.cse20 (store (store (store (store (store (store .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_65) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_66) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_85) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_65) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_66) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_85))) (and (= v_DerPreprocessor_66 (select .cse20 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse8 (select .cse20 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))))) (= .cse8 (select .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)))))))) (exists ((v_DerPreprocessor_85 (Array Int Int))) (let ((.cse28 (select v_DerPreprocessor_85 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (exists ((v_DerPreprocessor_84 (Array Int Int)) (v_DerPreprocessor_83 (Array Int Int)) (v_prenex_354 (Array Int Int)) (v_prenex_355 (Array Int Int)) (v_prenex_237 (Array Int Int)) (v_prenex_238 (Array Int Int))) (let ((.cse27 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_83) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_84) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_85) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_83) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_84) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_85))) (let ((.cse23 (store (store (store (store (store (store .cse27 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_237) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_238) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse13) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_237) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_238) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse13)) (.cse22 (select .cse27 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse21 (store (store (store (store (store (store .cse27 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_354) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_355) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_85) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_354) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_355) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_85))) (and (= (select .cse21 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_355) (= v_DerPreprocessor_84 .cse22) (= (select .cse23 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_238) (= .cse8 (select .cse23 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (exists ((v_prenex_239 (Array Int Int)) (v_prenex_339 (Array Int Int)) (v_prenex_240 (Array Int Int)) (v_prenex_340 (Array Int Int)) (v_prenex_341 (Array Int Int))) (let ((.cse26 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_240) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_239) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_341) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_240) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_239) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_341))) (let ((.cse25 (select .cse26 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse24 (store (store (store (store (store (store .cse27 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_339) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_340) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_341) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_339) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_340) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_341))) (and (= .cse8 (select .cse24 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse25 .cse22) (= .cse8 (select .cse26 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_prenex_239 .cse25) (= v_prenex_340 (select .cse24 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)))))) (= .cse8 (select .cse27 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse8 (select .cse21 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)))))) (= v_DerPreprocessor_85 (store (store .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse28) 0 (select v_DerPreprocessor_85 0))) (= .cse28 .cse10)))) (exists ((v_DerPreprocessor_85 (Array Int Int))) (let ((.cse29 (select v_DerPreprocessor_85 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= v_DerPreprocessor_85 (store (store .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse29) 0 (select v_DerPreprocessor_85 0))) (= .cse29 .cse10) (exists ((v_DerPreprocessor_84 (Array Int Int)) (v_DerPreprocessor_83 (Array Int Int)) (v_prenex_354 (Array Int Int)) (v_prenex_355 (Array Int Int)) (v_prenex_237 (Array Int Int)) (v_prenex_238 (Array Int Int))) (let ((.cse31 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_83) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_84) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_85) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_83) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_84) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_85))) (let ((.cse32 (store (store (store (store (store (store .cse31 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_237) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_238) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse13) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_237) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_238) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse13)) (.cse30 (store (store (store (store (store (store .cse31 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_354) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_355) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_85) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_354) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_355) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_85))) (and (= (select .cse30 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_355) (= v_DerPreprocessor_84 (select .cse31 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= (select .cse32 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_238) (= .cse8 (select .cse32 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse8 (select .cse31 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (exists ((v_prenex_328 (Array Int Int)) (v_prenex_329 (Array Int Int)) (v_prenex_330 (Array Int Int)) (v_prenex_331 (Array Int Int)) (v_prenex_332 (Array Int Int))) (let ((.cse34 (store (store (store (store (store (store .cse31 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_330) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_331) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_332) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_330) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_331) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_332))) (let ((.cse33 (select .cse34 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse35 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_329) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_328) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_332) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_329) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_328) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_332))) (and (= .cse5 .cse33) (= .cse8 (select .cse34 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse35 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_328) (= v_prenex_331 .cse33) (= (select .cse35 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse8))))) (= .cse8 (select .cse30 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))))))))) (exists ((v_DerPreprocessor_85 (Array Int Int))) (let ((.cse36 (select v_DerPreprocessor_85 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= v_DerPreprocessor_85 (store (store .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse36) 0 (select v_DerPreprocessor_85 0))) (exists ((v_DerPreprocessor_84 (Array Int Int)) (v_DerPreprocessor_83 (Array Int Int))) (let ((.cse39 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_83) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_84) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_85) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_83) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_84) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_85))) (let ((.cse37 (select .cse39 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= v_DerPreprocessor_84 .cse37) (exists ((v_prenex_350 (Array Int Int)) (v_prenex_351 (Array Int Int))) (let ((.cse38 (store (store (store (store (store (store .cse39 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_350) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_351) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_85) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_350) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_351) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_85))) (and (= (select .cse38 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse8) (= (select .cse38 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_351)))) (= .cse8 (select .cse39 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (exists ((v_prenex_327 (Array Int Int)) (v_prenex_325 (Array Int Int)) (v_prenex_215 (Array Int Int)) (v_prenex_326 (Array Int Int)) (v_prenex_216 (Array Int Int))) (let ((.cse42 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_216) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_215) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_327) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_216) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_215) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_327))) (let ((.cse40 (store (store (store (store (store (store .cse39 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_325) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_326) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_327) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_325) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_326) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_327)) (.cse41 (select .cse42 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= (select .cse40 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_326) (= v_prenex_215 .cse41) (= .cse8 (select .cse42 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse8 (select .cse40 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse41 .cse37))))) (exists ((v_prenex_235 (Array Int Int)) (v_prenex_236 (Array Int Int))) (let ((.cse43 (store (store (store (store (store (store .cse39 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_235) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_236) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse13) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_235) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_236) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse13))) (and (= v_prenex_236 (select .cse43 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= (select .cse43 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse8)))))))) (= .cse36 .cse10))))) .cse44 .cse45) (and .cse3 (not .cse44)) (and .cse44 (or (and (or (exists ((v_DerPreprocessor_94 (Array Int Int))) (let ((.cse46 (select v_DerPreprocessor_94 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= .cse46 .cse10) (exists ((v_DerPreprocessor_92 (Array Int Int)) (v_DerPreprocessor_93 (Array Int Int)) (v_prenex_354 (Array Int Int)) (v_prenex_355 (Array Int Int))) (let ((.cse47 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_92) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_93) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_94) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_92) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_93) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_94))) (let ((.cse53 (store (store (store (store (store (store .cse47 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_354) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_355) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_94) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_354) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_355) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_94))) (and (= (select .cse47 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_DerPreprocessor_93) (exists ((v_prenex_237 (Array Int Int)) (v_prenex_238 (Array Int Int))) (let ((.cse49 (store (store (store (store (store (store .cse47 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_237) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_238) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse13) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_237) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_238) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse13))) (let ((.cse48 (select .cse49 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= .cse48 v_prenex_238) (= .cse8 (select .cse49 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (exists ((v_prenex_239 (Array Int Int)) (v_prenex_339 (Array Int Int)) (v_prenex_240 (Array Int Int)) (v_prenex_340 (Array Int Int)) (v_prenex_341 (Array Int Int))) (let ((.cse51 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_240) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_239) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_341) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_240) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_239) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_341))) (let ((.cse52 (store (store (store (store (store (store .cse47 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_339) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_340) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_341) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_339) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_340) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_341)) (.cse50 (select .cse51 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= .cse48 .cse50) (= .cse8 (select .cse51 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_prenex_340 (select .cse52 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse8 (select .cse52 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_prenex_239 .cse50))))))))) (= .cse8 (select .cse47 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse8 (select .cse53 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_prenex_355 (select .cse53 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)))))) (= v_DerPreprocessor_94 (store (store .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse46) 0 (select v_DerPreprocessor_94 0)))))) (exists ((v_DerPreprocessor_94 (Array Int Int))) (let ((.cse54 (select v_DerPreprocessor_94 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= .cse54 .cse10) (= v_DerPreprocessor_94 (store (store .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse54) 0 (select v_DerPreprocessor_94 0))) (exists ((v_DerPreprocessor_92 (Array Int Int)) (v_DerPreprocessor_93 (Array Int Int)) (v_prenex_354 (Array Int Int)) (v_prenex_355 (Array Int Int))) (let ((.cse55 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_92) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_93) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_94) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_92) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_93) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_94))) (let ((.cse61 (store (store (store (store (store (store .cse55 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_354) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_355) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_94) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_354) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_355) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_94))) (and (= (select .cse55 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_DerPreprocessor_93) (exists ((v_prenex_237 (Array Int Int)) (v_prenex_238 (Array Int Int))) (let ((.cse57 (store (store (store (store (store (store .cse55 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_237) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_238) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse13) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_237) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_238) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse13))) (let ((.cse56 (select .cse57 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= .cse56 v_prenex_238) (= .cse8 (select .cse57 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (exists ((v_prenex_328 (Array Int Int)) (v_prenex_329 (Array Int Int)) (v_prenex_330 (Array Int Int)) (v_prenex_331 (Array Int Int)) (v_prenex_332 (Array Int Int))) (let ((.cse60 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_329) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_328) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_332) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_329) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_328) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_332))) (let ((.cse58 (store (store (store (store (store (store .cse55 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_330) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_331) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_332) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_330) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_331) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_332)) (.cse59 (select .cse60 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= .cse8 (select .cse58 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse58 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_331) (= .cse59 v_prenex_328) (= .cse56 .cse59) (= (select .cse60 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse8))))))))) (= .cse8 (select .cse55 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse8 (select .cse61 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_prenex_355 (select .cse61 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))))))))) (exists ((v_DerPreprocessor_94 (Array Int Int))) (let ((.cse62 (select v_DerPreprocessor_94 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= .cse62 .cse10) (= v_DerPreprocessor_94 (store (store .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse62) 0 (select v_DerPreprocessor_94 0))) (exists ((v_DerPreprocessor_92 (Array Int Int)) (v_DerPreprocessor_93 (Array Int Int))) (let ((.cse64 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_92) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_93) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_94) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_92) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_93) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_94))) (and (exists ((v_prenex_350 (Array Int Int)) (v_prenex_351 (Array Int Int))) (let ((.cse63 (store (store (store (store (store (store .cse64 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_350) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_351) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_94) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_350) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_351) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_94))) (and (= (select .cse63 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_351) (= .cse8 (select .cse63 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))))) (exists ((v_prenex_235 (Array Int Int)) (v_prenex_236 (Array Int Int))) (let ((.cse65 (store (store (store (store (store (store .cse64 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_235) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_236) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse13) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_235) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_236) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse13))) (and (= (select .cse65 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse8) (= (select .cse65 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_236)))) (exists ((v_prenex_327 (Array Int Int)) (v_prenex_325 (Array Int Int)) (v_prenex_215 (Array Int Int)) (v_prenex_326 (Array Int Int)) (v_prenex_216 (Array Int Int))) (let ((.cse68 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_216) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_215) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_327) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_216) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_215) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_327))) (let ((.cse66 (store (store (store (store (store (store .cse64 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_325) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_326) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_327) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_325) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_326) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_327)) (.cse67 (select .cse68 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= (select .cse66 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_326) (= v_prenex_215 .cse67) (= (select .cse66 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse8) (= .cse8 (select .cse68 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse67 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse1))))) (= (select .cse64 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_DerPreprocessor_93) (= .cse8 (select .cse64 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)))))))) (exists ((v_DerPreprocessor_94 (Array Int Int))) (let ((.cse69 (select v_DerPreprocessor_94 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= .cse69 .cse10) (= v_DerPreprocessor_94 (store (store .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse69) 0 (select v_DerPreprocessor_94 0))) (exists ((v_DerPreprocessor_92 (Array Int Int)) (v_DerPreprocessor_93 (Array Int Int))) (let ((.cse72 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_92) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_93) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_94) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_92) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_93) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_94))) (and (exists ((v_prenex_217 (Array Int Int)) (v_prenex_218 (Array Int Int)) (v_DerPreprocessor_56 (Array Int Int)) (v_DerPreprocessor_57 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (let ((.cse70 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_218) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_217) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_58) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_218) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_217) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_58)) (.cse71 (store (store (store (store (store (store .cse72 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_56) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_57) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_58) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_56) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_57) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_58))) (and (= (select v_DerPreprocessor_58 0) .cse10) (= (select .cse70 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_217) (= .cse8 (select .cse71 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse8 (select .cse70 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse71 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_DerPreprocessor_57)))) (= (select .cse72 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_DerPreprocessor_93) (exists ((v_DerPreprocessor_53 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int))) (let ((.cse73 (store (store (store (store (store (store .cse72 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_53) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_54) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse13) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_53) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_54) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse13))) (and (= .cse8 (select .cse73 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_DerPreprocessor_54 (select .cse73 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))))) (= .cse8 (select .cse72 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (exists ((v_prenex_352 (Array Int Int)) (v_prenex_353 (Array Int Int))) (let ((.cse74 (store (store (store (store (store (store .cse72 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_352) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_353) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_94) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_352) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_353) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_94))) (and (= .cse8 (select .cse74 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_prenex_353 (select .cse74 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))))))))))) (exists ((v_DerPreprocessor_94 (Array Int Int))) (let ((.cse80 (select v_DerPreprocessor_94 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (exists ((v_DerPreprocessor_92 (Array Int Int)) (v_DerPreprocessor_93 (Array Int Int))) (let ((.cse75 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_92) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_93) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_94) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_92) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_93) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_94))) (and (= (select .cse75 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_DerPreprocessor_93) (= .cse8 (select .cse75 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (exists ((v_prenex_233 (Array Int Int)) (v_prenex_333 (Array Int Int)) (v_prenex_234 (Array Int Int)) (v_prenex_334 (Array Int Int)) (v_prenex_335 (Array Int Int))) (let ((.cse77 (store (store (store (store (store (store .cse75 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_333) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_334) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_335) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_333) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_334) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_335)) (.cse76 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_234) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_233) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_335) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_234) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_233) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_335))) (and (= (select .cse76 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_233) (= (select .cse77 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse8) (= v_prenex_334 (select .cse77 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= (select .cse76 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse8) (= (select v_prenex_335 0) .cse10)))) (exists ((v_prenex_231 (Array Int Int)) (v_prenex_232 (Array Int Int))) (let ((.cse78 (store (store (store (store (store (store .cse75 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_231) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_232) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse13) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_231) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_232) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse13))) (and (= (select .cse78 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse8) (= v_prenex_232 (select .cse78 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))))) (exists ((v_DerPreprocessor_65 (Array Int Int)) (v_DerPreprocessor_66 (Array Int Int))) (let ((.cse79 (store (store (store (store (store (store .cse75 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_65) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_66) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_94) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_65) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_66) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_94))) (and (= (select .cse79 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse8) (= v_DerPreprocessor_66 (select .cse79 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)))))))) (= .cse80 .cse10) (= v_DerPreprocessor_94 (store (store .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse80) 0 (select v_DerPreprocessor_94 0))))))) .cse45) (and (or (exists ((v_DerPreprocessor_91 (Array Int Int))) (and (= (select v_DerPreprocessor_91 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse10) (exists ((v_DerPreprocessor_90 (Array Int Int)) (v_DerPreprocessor_89 (Array Int Int))) (let ((.cse81 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_90) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_91) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_90) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_91))) (and (= (select .cse81 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_DerPreprocessor_90) (exists ((v_prenex_352 (Array Int Int)) (v_prenex_353 (Array Int Int))) (let ((.cse82 (store (store (store (store (store (store .cse81 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_352) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_353) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_91) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_352) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_353) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_91))) (and (= .cse8 (select .cse82 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_prenex_353 (select .cse82 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))))) (exists ((v_prenex_217 (Array Int Int)) (v_prenex_218 (Array Int Int)) (v_DerPreprocessor_56 (Array Int Int)) (v_DerPreprocessor_57 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (let ((.cse83 (store (store (store (store (store (store .cse81 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_56) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_57) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_58) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_56) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_57) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_58)) (.cse84 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_218) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_217) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_58) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_218) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_217) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_58))) (and (= .cse8 (select .cse83 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select v_DerPreprocessor_58 0) .cse10) (= (select .cse84 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_217) (= v_DerPreprocessor_57 (select .cse83 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse8 (select .cse84 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))))) (exists ((v_DerPreprocessor_53 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int))) (let ((.cse85 (store (store (store (store (store (store .cse81 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_53) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_54) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse13) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_53) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_54) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse13))) (and (= v_DerPreprocessor_54 (select .cse85 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse8 (select .cse85 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))))) (= .cse8 (select .cse81 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))))))) (exists ((v_DerPreprocessor_91 (Array Int Int))) (and (= (select v_DerPreprocessor_91 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse10) (exists ((v_DerPreprocessor_90 (Array Int Int)) (v_DerPreprocessor_89 (Array Int Int))) (let ((.cse86 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_90) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_91) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_90) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_91))) (and (= (select .cse86 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_DerPreprocessor_90) (exists ((v_prenex_231 (Array Int Int)) (v_prenex_232 (Array Int Int))) (let ((.cse87 (store (store (store (store (store (store .cse86 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_231) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_232) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse13) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_231) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_232) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse13))) (and (= .cse8 (select .cse87 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse87 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_232)))) (= .cse8 (select .cse86 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (exists ((v_DerPreprocessor_65 (Array Int Int)) (v_DerPreprocessor_66 (Array Int Int))) (let ((.cse88 (store (store (store (store (store (store .cse86 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_65) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_66) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_91) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_65) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_66) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_91))) (and (= v_DerPreprocessor_66 (select .cse88 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse8 (select .cse88 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))))) (exists ((v_prenex_233 (Array Int Int)) (v_prenex_234 (Array Int Int)) (v_prenex_333 (Array Int Int)) (v_prenex_334 (Array Int Int)) (v_prenex_335 (Array Int Int))) (let ((.cse90 (store (store (store (store (store (store .cse86 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_333) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_334) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_335) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_333) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_334) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_335)) (.cse89 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_234) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_233) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_335) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_234) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_233) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_335))) (and (= (select .cse89 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_233) (= v_prenex_334 (select .cse90 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse8 (select .cse90 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse89 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse8) (= (select v_prenex_335 0) .cse10))))))))) (exists ((v_DerPreprocessor_91 (Array Int Int))) (and (= (select v_DerPreprocessor_91 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse10) (exists ((v_DerPreprocessor_90 (Array Int Int)) (v_DerPreprocessor_89 (Array Int Int))) (let ((.cse91 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_90) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_91) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_90) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_91))) (and (= (select .cse91 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_DerPreprocessor_90) (exists ((v_prenex_327 (Array Int Int)) (v_prenex_325 (Array Int Int)) (v_prenex_215 (Array Int Int)) (v_prenex_326 (Array Int Int)) (v_prenex_216 (Array Int Int))) (let ((.cse93 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_216) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_215) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_327) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_216) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_215) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_327)) (.cse92 (store (store (store (store (store (store .cse91 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_325) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_326) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_327) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_325) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_326) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_327))) (and (= .cse8 (select .cse92 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_prenex_215 (select .cse93 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse8 (select .cse93 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse92 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_326) (= (select v_prenex_327 0) .cse10)))) (= .cse8 (select .cse91 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (exists ((v_prenex_350 (Array Int Int)) (v_prenex_351 (Array Int Int))) (let ((.cse94 (store (store (store (store (store (store .cse91 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_350) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_351) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_91) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_350) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_351) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_91))) (and (= .cse8 (select .cse94 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse94 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_351)))) (exists ((v_prenex_235 (Array Int Int)) (v_prenex_236 (Array Int Int))) (let ((.cse95 (store (store (store (store (store (store .cse91 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_235) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_236) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse13) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_235) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_236) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse13))) (and (= v_prenex_236 (select .cse95 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= (select .cse95 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse8))))))))) (exists ((v_DerPreprocessor_91 (Array Int Int))) (let ((.cse96 (select v_DerPreprocessor_91 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= .cse96 .cse10) (exists ((v_prenex_354 (Array Int Int)) (v_DerPreprocessor_90 (Array Int Int)) (v_prenex_355 (Array Int Int)) (v_DerPreprocessor_89 (Array Int Int))) (let ((.cse102 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_90) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_91) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_90) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_91))) (let ((.cse104 (store (store (store (store (store (store .cse102 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_354) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_355) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_91) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_354) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_355) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_91))) (and (exists ((v_prenex_237 (Array Int Int)) (v_prenex_238 (Array Int Int))) (let ((.cse103 (store (store (store (store (store (store .cse102 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_237) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_238) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse13) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_237) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_238) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse13))) (let ((.cse99 (select .cse103 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (exists ((v_prenex_328 (Array Int Int)) (v_prenex_329 (Array Int Int)) (v_prenex_330 (Array Int Int)) (v_prenex_331 (Array Int Int)) (v_prenex_332 (Array Int Int))) (let ((.cse101 (store (store (store (store (store (store .cse102 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_330) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_331) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_332) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_330) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_331) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_332)) (.cse100 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_329) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_328) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_332) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_329) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_328) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_332))) (let ((.cse98 (select .cse100 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse97 (select .cse101 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= v_DerPreprocessor_91 (store (store .cse97 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse96) 0 (select v_DerPreprocessor_91 0))) (= .cse98 v_prenex_328) (= .cse98 .cse99) (= v_prenex_331 .cse97) (= (select .cse100 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse8) (= .cse8 (select .cse101 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)))))) (= v_prenex_238 .cse99) (= .cse8 (select .cse103 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)))))) (= .cse8 (select .cse104 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse102 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_DerPreprocessor_90) (= (select .cse104 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_355) (= .cse8 (select .cse102 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))))))))) (exists ((v_DerPreprocessor_91 (Array Int Int))) (and (= (select v_DerPreprocessor_91 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse10) (exists ((v_prenex_354 (Array Int Int)) (v_DerPreprocessor_90 (Array Int Int)) (v_prenex_355 (Array Int Int)) (v_DerPreprocessor_89 (Array Int Int))) (let ((.cse109 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_90) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_91) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_90) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_91))) (let ((.cse111 (store (store (store (store (store (store .cse109 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_354) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_355) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_91) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_354) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_355) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_91))) (and (exists ((v_prenex_237 (Array Int Int)) (v_prenex_238 (Array Int Int))) (let ((.cse110 (store (store (store (store (store (store .cse109 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_237) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_238) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse13) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_237) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_238) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse13))) (let ((.cse106 (select .cse110 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (exists ((v_prenex_239 (Array Int Int)) (v_prenex_339 (Array Int Int)) (v_prenex_240 (Array Int Int)) (v_prenex_340 (Array Int Int)) (v_prenex_341 (Array Int Int))) (let ((.cse108 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_240) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_239) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_341) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_240) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_239) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_341))) (let ((.cse105 (store (store (store (store (store (store .cse109 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_339) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_340) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_341) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_339) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_340) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_341)) (.cse107 (select .cse108 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= (select .cse105 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_340) (= .cse106 .cse107) (= .cse8 (select .cse105 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse8 (select .cse108 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_prenex_239 .cse107))))) (= v_prenex_238 .cse106) (= .cse8 (select .cse110 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)))))) (= .cse8 (select .cse111 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse109 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_DerPreprocessor_90) (= (select .cse111 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_355) (= .cse8 (select .cse109 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))))))))) .cse45))) (and (or (and (or (exists ((v_DerPreprocessor_88 (Array Int Int))) (and (exists ((v_DerPreprocessor_86 (Array Int Int)) (v_DerPreprocessor_87 (Array Int Int)) (v_prenex_354 (Array Int Int)) (v_prenex_355 (Array Int Int)) (v_prenex_237 (Array Int Int)) (v_prenex_238 (Array Int Int))) (let ((.cse119 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_86) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_87) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_88) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_86) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_87) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_88))) (let ((.cse115 (store (store (store (store (store (store .cse119 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_237) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_238) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse13) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_237) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_238) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse13))) (let ((.cse113 (select .cse115 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse112 (store (store (store (store (store (store .cse119 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_354) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_355) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_88) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_354) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_355) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_88)) (.cse114 (select .cse119 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= (select .cse112 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse8) (= .cse113 v_prenex_238) (= .cse113 .cse114) (= v_prenex_355 (select .cse112 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse8 (select .cse115 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_DerPreprocessor_87 .cse114) (exists ((v_prenex_239 (Array Int Int)) (v_prenex_339 (Array Int Int)) (v_prenex_240 (Array Int Int)) (v_prenex_340 (Array Int Int)) (v_prenex_341 (Array Int Int))) (let ((.cse118 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_240) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_239) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_341) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_240) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_239) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_341))) (let ((.cse116 (store (store (store (store (store (store .cse119 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_339) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_340) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_341) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_339) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_340) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_341)) (.cse117 (select .cse118 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= .cse8 (select .cse116 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse114 .cse117) (= .cse8 (select .cse118 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse116 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_340) (= v_prenex_239 .cse117))))) (= .cse8 (select .cse119 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))))))) (= (select v_DerPreprocessor_88 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse10))) (exists ((v_DerPreprocessor_88 (Array Int Int))) (and (exists ((v_DerPreprocessor_86 (Array Int Int)) (v_DerPreprocessor_87 (Array Int Int))) (let ((.cse124 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_86) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_87) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_88) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_86) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_87) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_88))) (let ((.cse122 (select .cse124 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (exists ((v_prenex_327 (Array Int Int)) (v_prenex_215 (Array Int Int)) (v_prenex_325 (Array Int Int)) (v_prenex_216 (Array Int Int)) (v_prenex_326 (Array Int Int))) (let ((.cse123 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_216) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_215) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_327) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_216) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_215) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_327))) (let ((.cse121 (store (store (store (store (store (store .cse124 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_325) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_326) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_327) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_325) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_326) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_327)) (.cse120 (select .cse123 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= v_prenex_215 .cse120) (= v_prenex_326 (select .cse121 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse8 (select .cse121 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse122 .cse120) (= .cse8 (select .cse123 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)))))) (exists ((v_prenex_350 (Array Int Int)) (v_prenex_351 (Array Int Int))) (let ((.cse125 (store (store (store (store (store (store .cse124 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_350) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_351) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_88) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_350) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_351) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_88))) (and (= .cse8 (select .cse125 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse125 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_351)))) (exists ((v_prenex_235 (Array Int Int)) (v_prenex_236 (Array Int Int))) (let ((.cse126 (store (store (store (store (store (store .cse124 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_235) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_236) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse13) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_235) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_236) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse13))) (and (= v_prenex_236 (select .cse126 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse8 (select .cse126 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))))) (= v_DerPreprocessor_87 .cse122) (= .cse8 (select .cse124 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)))))) (= (select v_DerPreprocessor_88 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse10))) (exists ((v_DerPreprocessor_88 (Array Int Int))) (and (exists ((v_DerPreprocessor_86 (Array Int Int)) (v_DerPreprocessor_87 (Array Int Int)) (v_prenex_354 (Array Int Int)) (v_prenex_355 (Array Int Int)) (v_prenex_237 (Array Int Int)) (v_prenex_238 (Array Int Int))) (let ((.cse133 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_86) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_87) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_88) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_86) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_87) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_88))) (let ((.cse134 (store (store (store (store (store (store .cse133 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_237) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_238) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse13) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_237) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_238) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse13))) (let ((.cse128 (select .cse134 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse127 (store (store (store (store (store (store .cse133 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_354) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_355) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_88) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_354) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_355) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_88)) (.cse129 (select .cse133 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= (select .cse127 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse8) (= .cse128 v_prenex_238) (= .cse128 .cse129) (exists ((v_prenex_328 (Array Int Int)) (v_prenex_329 (Array Int Int)) (v_prenex_330 (Array Int Int)) (v_prenex_331 (Array Int Int)) (v_prenex_332 (Array Int Int))) (let ((.cse132 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_329) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_328) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_332) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_329) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_328) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_332))) (let ((.cse131 (store (store (store (store (store (store .cse133 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_330) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_331) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_332) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_330) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_331) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_332)) (.cse130 (select .cse132 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= .cse130 .cse129) (= .cse8 (select .cse131 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse131 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_331) (= .cse130 v_prenex_328) (= (select .cse132 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse8))))) (= v_prenex_355 (select .cse127 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse8 (select .cse134 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_DerPreprocessor_87 .cse129) (= .cse8 (select .cse133 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))))))) (= (select v_DerPreprocessor_88 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse10))) (exists ((v_DerPreprocessor_88 (Array Int Int))) (and (= (select v_DerPreprocessor_88 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse10) (exists ((v_DerPreprocessor_86 (Array Int Int)) (v_DerPreprocessor_87 (Array Int Int))) (let ((.cse138 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_86) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_87) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_88) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_86) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_87) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_88))) (let ((.cse137 (select .cse138 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (exists ((v_DerPreprocessor_53 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int))) (let ((.cse135 (store (store (store (store (store (store .cse138 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_53) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_54) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse13) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_53) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_54) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse13))) (let ((.cse136 (select .cse135 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= .cse8 (select .cse135 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_DerPreprocessor_54 .cse136) (= .cse137 .cse136))))) (= v_DerPreprocessor_87 .cse137) (exists ((v_prenex_217 (Array Int Int)) (v_prenex_218 (Array Int Int)) (v_DerPreprocessor_56 (Array Int Int)) (v_DerPreprocessor_57 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (let ((.cse139 (store (store (store (store (store (store .cse138 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_56) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_57) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_58) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_56) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_57) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_58)) (.cse140 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_218) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_217) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_58) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_218) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_217) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_58))) (and (= (select v_DerPreprocessor_58 0) .cse10) (= v_DerPreprocessor_57 (select .cse139 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= (select .cse140 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_217) (= .cse8 (select .cse139 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse8 (select .cse140 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))))) (exists ((v_prenex_352 (Array Int Int)) (v_prenex_353 (Array Int Int))) (let ((.cse141 (store (store (store (store (store (store .cse138 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_352) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_353) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_88) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_352) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_353) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_88))) (and (= (select .cse141 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse8) (= (select .cse141 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_353)))) (= .cse8 (select .cse138 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)))))))) (exists ((v_DerPreprocessor_88 (Array Int Int))) (and (exists ((v_DerPreprocessor_86 (Array Int Int)) (v_DerPreprocessor_87 (Array Int Int))) (let ((.cse144 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_86) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_87) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_88) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_86) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_87) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_88))) (and (exists ((v_prenex_233 (Array Int Int)) (v_prenex_234 (Array Int Int)) (v_prenex_333 (Array Int Int)) (v_prenex_334 (Array Int Int)) (v_prenex_335 (Array Int Int))) (let ((.cse143 (store (store (store (store (store (store .cse144 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_333) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_334) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_335) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_333) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_334) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_335)) (.cse142 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_234) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_233) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_335) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_234) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_233) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_335))) (and (= (select .cse142 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_233) (= (select .cse143 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_334) (= .cse8 (select .cse143 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse142 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse8) (= (select v_prenex_335 0) .cse10)))) (exists ((v_DerPreprocessor_65 (Array Int Int)) (v_DerPreprocessor_66 (Array Int Int))) (let ((.cse145 (store (store (store (store (store (store .cse144 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_65) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_66) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_88) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_65) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_66) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_88))) (and (= v_DerPreprocessor_66 (select .cse145 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= (select .cse145 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse8)))) (exists ((v_prenex_231 (Array Int Int)) (v_prenex_232 (Array Int Int))) (let ((.cse146 (store (store (store (store (store (store .cse144 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_231) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_232) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse13) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_231) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_232) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse13))) (and (= .cse8 (select .cse146 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse146 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_232)))) (= v_DerPreprocessor_87 (select .cse144 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse8 (select .cse144 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))))) (= (select v_DerPreprocessor_88 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse10)))) .cse45) (and .cse4 .cse45)) .cse44))) (<= 1 |c_ULTIMATE.start_test_fun_#t~mem10#1|) (< 0 .cse1) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)))))) is different from true [2022-11-18 20:58:11,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:58:11,337 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2022-11-18 20:58:11,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-18 20:58:11,338 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.75) internal successors, (49), 29 states have internal predecessors, (49), 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 17 [2022-11-18 20:58:11,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:58:11,338 INFO L225 Difference]: With dead ends: 92 [2022-11-18 20:58:11,338 INFO L226 Difference]: Without dead ends: 58 [2022-11-18 20:58:11,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 155.6s TimeCoverageRelationStatistics Valid=310, Invalid=1228, Unknown=30, NotChecked=154, Total=1722 [2022-11-18 20:58:11,341 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 48 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:58:11,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 117 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 85 Invalid, 0 Unknown, 97 Unchecked, 0.2s Time] [2022-11-18 20:58:11,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-18 20:58:11,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 40. [2022-11-18 20:58:11,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 39 states have internal predecessors, (44), 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-18 20:58:11,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-11-18 20:58:11,354 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 17 [2022-11-18 20:58:11,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:58:11,354 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-11-18 20:58:11,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.75) internal successors, (49), 29 states have internal predecessors, (49), 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-18 20:58:11,355 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-11-18 20:58:11,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-18 20:58:11,355 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:58:11,356 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:58:11,361 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 20:58:11,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:58:11,559 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-18 20:58:11,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:58:11,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1412087133, now seen corresponding path program 1 times [2022-11-18 20:58:11,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:58:11,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602824481] [2022-11-18 20:58:11,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:58:11,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:58:11,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:12,120 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-18 20:58:12,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:58:12,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602824481] [2022-11-18 20:58:12,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602824481] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:58:12,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763423410] [2022-11-18 20:58:12,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:58:12,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:58:12,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:58:12,125 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:58:12,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 20:58:12,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:12,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-18 20:58:12,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:58:12,439 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-18 20:58:12,439 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-18 20:58:12,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 20:58:12,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:58:12,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:58:13,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:58:13,366 INFO L321 Elim1Store]: treesize reduction 41, result has 29.3 percent of original size [2022-11-18 20:58:13,366 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 430 treesize of output 370 [2022-11-18 20:58:13,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-18 20:58:13,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-18 20:58:13,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 20:58:13,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2022-11-18 20:58:14,477 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:58:14,478 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 324 treesize of output 330 [2022-11-18 20:58:14,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 20:58:14,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 20:58:14,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 20:58:14,591 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-18 20:58:14,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-18 20:58:14,817 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-18 20:58:14,944 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 28 treesize of output 20 [2022-11-18 20:58:14,996 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-18 20:58:14,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:58:17,330 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:58:17,331 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 37 treesize of output 30 [2022-11-18 20:58:17,350 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:58:17,350 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 280 treesize of output 270 [2022-11-18 20:58:17,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 294 treesize of output 278 [2022-11-18 20:58:17,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 150 [2022-11-18 20:58:17,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 216 treesize of output 206 [2022-11-18 20:58:18,512 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-18 20:58:18,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763423410] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:58:18,512 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:58:18,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 9] total 24 [2022-11-18 20:58:18,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574133589] [2022-11-18 20:58:18,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:58:18,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-18 20:58:18,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:58:18,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-18 20:58:18,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=487, Unknown=6, NotChecked=0, Total=600 [2022-11-18 20:58:18,515 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 25 states have internal predecessors, (52), 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-18 20:58:19,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:58:19,435 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2022-11-18 20:58:19,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:58:19,435 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 25 states have internal predecessors, (52), 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 18 [2022-11-18 20:58:19,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:58:19,436 INFO L225 Difference]: With dead ends: 42 [2022-11-18 20:58:19,436 INFO L226 Difference]: Without dead ends: 41 [2022-11-18 20:58:19,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=268, Invalid=848, Unknown=6, NotChecked=0, Total=1122 [2022-11-18 20:58:19,438 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 122 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:58:19,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 87 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 140 Invalid, 0 Unknown, 37 Unchecked, 0.2s Time] [2022-11-18 20:58:19,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-11-18 20:58:19,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2022-11-18 20:58:19,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 38 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-18 20:58:19,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-11-18 20:58:19,453 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 18 [2022-11-18 20:58:19,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:58:19,454 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-11-18 20:58:19,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 25 states have internal predecessors, (52), 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-18 20:58:19,454 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-11-18 20:58:19,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-18 20:58:19,455 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:58:19,455 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:58:19,465 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-18 20:58:19,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:58:19,661 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-18 20:58:19,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:58:19,661 INFO L85 PathProgramCache]: Analyzing trace with hash -825028097, now seen corresponding path program 1 times [2022-11-18 20:58:19,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:58:19,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014920827] [2022-11-18 20:58:19,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:58:19,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:58:19,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:19,811 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:58:19,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:58:19,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014920827] [2022-11-18 20:58:19,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014920827] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:58:19,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034796725] [2022-11-18 20:58:19,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:58:19,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:58:19,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:58:19,813 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:58:19,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 20:58:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:19,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-18 20:58:19,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:58:20,104 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:58:20,104 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 37 treesize of output 33 [2022-11-18 20:58:20,141 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:58:20,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:58:20,282 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-11-18 20:58:20,282 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 48 treesize of output 1 [2022-11-18 20:58:20,285 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:58:20,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034796725] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-18 20:58:20,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:58:20,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 12 [2022-11-18 20:58:20,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896614271] [2022-11-18 20:58:20,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:58:20,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:58:20,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:58:20,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:58:20,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-11-18 20:58:20,288 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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-18 20:58:20,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:58:20,324 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-11-18 20:58:20,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:58:20,325 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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-18 20:58:20,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:58:20,325 INFO L225 Difference]: With dead ends: 39 [2022-11-18 20:58:20,326 INFO L226 Difference]: Without dead ends: 38 [2022-11-18 20:58:20,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-11-18 20:58:20,332 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:58:20,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 19 Unchecked, 0.0s Time] [2022-11-18 20:58:20,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-18 20:58:20,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-11-18 20:58:20,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 34 states have internal predecessors, (39), 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-18 20:58:20,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-11-18 20:58:20,351 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 19 [2022-11-18 20:58:20,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:58:20,353 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-11-18 20:58:20,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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-18 20:58:20,354 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-11-18 20:58:20,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-18 20:58:20,355 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:58:20,355 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:58:20,366 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-18 20:58:20,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-18 20:58:20,562 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-18 20:58:20,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:58:20,562 INFO L85 PathProgramCache]: Analyzing trace with hash 193932837, now seen corresponding path program 1 times [2022-11-18 20:58:20,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:58:20,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523621912] [2022-11-18 20:58:20,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:58:20,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:58:20,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:21,279 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:58:21,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:58:21,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523621912] [2022-11-18 20:58:21,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523621912] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:58:21,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205229426] [2022-11-18 20:58:21,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:58:21,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:58:21,280 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:58:21,281 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:58:21,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 20:58:21,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:21,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-18 20:58:21,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:58:21,419 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 20:58:21,419 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 90 treesize of output 84 [2022-11-18 20:58:21,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:58:21,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:58:21,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-11-18 20:58:21,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-18 20:58:21,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2022-11-18 20:58:21,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 20:58:21,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-18 20:58:21,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-18 20:58:22,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-18 20:58:22,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:58:22,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-18 20:58:22,255 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:58:22,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:58:22,777 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_510 Int) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_507 (Array Int Int)) (v_ArrVal_509 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_507))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse3 (store .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_509)))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_510)))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_513) |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_510) (< (select (select .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (select .cse2 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_509 1))))))))) is different from false [2022-11-18 20:58:23,284 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-18 20:58:23,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205229426] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:58:23,284 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:58:23,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 28 [2022-11-18 20:58:23,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98504200] [2022-11-18 20:58:23,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:58:23,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-18 20:58:23,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:58:23,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-18 20:58:23,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=571, Unknown=19, NotChecked=52, Total=812 [2022-11-18 20:58:23,287 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 29 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 29 states have internal predecessors, (57), 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-18 20:58:23,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:58:23,904 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-11-18 20:58:23,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-18 20:58:23,905 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 29 states have internal predecessors, (57), 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 20 [2022-11-18 20:58:23,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:58:23,906 INFO L225 Difference]: With dead ends: 41 [2022-11-18 20:58:23,906 INFO L226 Difference]: Without dead ends: 40 [2022-11-18 20:58:23,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=310, Invalid=865, Unknown=19, NotChecked=66, Total=1260 [2022-11-18 20:58:23,908 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 34 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:58:23,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 109 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 90 Unchecked, 0.1s Time] [2022-11-18 20:58:23,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-18 20:58:23,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-11-18 20:58:23,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 38 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-18 20:58:23,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-11-18 20:58:23,927 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 20 [2022-11-18 20:58:23,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:58:23,927 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-11-18 20:58:23,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 29 states have internal predecessors, (57), 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-18 20:58:23,928 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-11-18 20:58:23,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-18 20:58:23,928 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:58:23,929 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:58:23,937 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-18 20:58:24,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-18 20:58:24,133 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-18 20:58:24,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:58:24,133 INFO L85 PathProgramCache]: Analyzing trace with hash -737334045, now seen corresponding path program 1 times [2022-11-18 20:58:24,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:58:24,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513757206] [2022-11-18 20:58:24,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:58:24,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:58:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:24,217 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:58:24,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:58:24,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513757206] [2022-11-18 20:58:24,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513757206] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:58:24,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850470408] [2022-11-18 20:58:24,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:58:24,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:58:24,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:58:24,219 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:58:24,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-18 20:58:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:24,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 20:58:24,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:58:24,363 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-18 20:58:24,367 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:58:24,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:58:24,418 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:58:24,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850470408] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:58:24,419 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:58:24,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-11-18 20:58:24,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146226504] [2022-11-18 20:58:24,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:58:24,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:58:24,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:58:24,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:58:24,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:58:24,422 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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-18 20:58:24,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:58:24,513 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2022-11-18 20:58:24,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:58:24,515 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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 21 [2022-11-18 20:58:24,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:58:24,515 INFO L225 Difference]: With dead ends: 56 [2022-11-18 20:58:24,515 INFO L226 Difference]: Without dead ends: 32 [2022-11-18 20:58:24,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:58:24,516 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:58:24,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 42 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:58:24,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-18 20:58:24,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-11-18 20:58:24,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 31 states have internal predecessors, (32), 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-18 20:58:24,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2022-11-18 20:58:24,535 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 21 [2022-11-18 20:58:24,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:58:24,535 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2022-11-18 20:58:24,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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-18 20:58:24,536 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-11-18 20:58:24,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-18 20:58:24,540 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:58:24,541 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:58:24,552 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-18 20:58:24,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-18 20:58:24,747 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-18 20:58:24,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:58:24,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1716950721, now seen corresponding path program 1 times [2022-11-18 20:58:24,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:58:24,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391669466] [2022-11-18 20:58:24,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:58:24,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:58:24,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:25,240 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:58:25,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:58:25,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391669466] [2022-11-18 20:58:25,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391669466] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:58:25,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799632208] [2022-11-18 20:58:25,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:58:25,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:58:25,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:58:25,243 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:58:25,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-18 20:58:25,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:25,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-18 20:58:25,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:58:25,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-18 20:58:25,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:58:25,573 INFO L321 Elim1Store]: treesize reduction 78, result has 48.0 percent of original size [2022-11-18 20:58:25,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 112 treesize of output 237 [2022-11-18 20:58:25,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-18 20:58:25,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-18 20:58:25,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-18 20:58:25,688 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:58:25,729 INFO L321 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-11-18 20:58:25,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 93 treesize of output 92 [2022-11-18 20:58:25,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-18 20:58:25,810 WARN L193 Elim1Store]: Array PQE input equivalent to false [2022-11-18 20:58:25,842 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:58:25,843 INFO L350 Elim1Store]: Elim1 eliminated variable 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 53 treesize of output 16 [2022-11-18 20:58:25,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 20:58:25,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 17 [2022-11-18 20:58:25,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 20:58:25,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 183 [2022-11-18 20:58:26,029 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:58:26,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2022-11-18 20:58:26,059 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:58:26,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2022-11-18 20:58:26,119 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:58:26,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2022-11-18 20:58:26,162 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:58:26,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2022-11-18 20:58:26,626 INFO L321 Elim1Store]: treesize reduction 18, result has 50.0 percent of original size [2022-11-18 20:58:26,627 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 3 case distinctions, treesize of input 25 treesize of output 40 [2022-11-18 20:58:26,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 20:58:26,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-18 20:58:26,813 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-18 20:58:26,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 48 [2022-11-18 20:58:27,041 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-18 20:58:27,042 INFO L350 Elim1Store]: Elim1 eliminated variable 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 65 treesize of output 64 [2022-11-18 20:58:27,424 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 20:58:27,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 26 [2022-11-18 20:58:27,507 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:58:27,508 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 35 treesize of output 31 [2022-11-18 20:58:27,564 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:58:27,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:58:33,698 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:58:33,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799632208] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:58:33,699 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:58:33,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 28 [2022-11-18 20:58:33,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150182825] [2022-11-18 20:58:33,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:58:33,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-18 20:58:33,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:58:33,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-18 20:58:33,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=672, Unknown=11, NotChecked=0, Total=812 [2022-11-18 20:58:33,701 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 29 states have internal predecessors, (61), 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-18 20:58:34,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:58:34,570 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-11-18 20:58:34,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:58:34,570 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 29 states have internal predecessors, (61), 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 21 [2022-11-18 20:58:34,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:58:34,571 INFO L225 Difference]: With dead ends: 32 [2022-11-18 20:58:34,571 INFO L226 Difference]: Without dead ends: 31 [2022-11-18 20:58:34,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=275, Invalid=1120, Unknown=11, NotChecked=0, Total=1406 [2022-11-18 20:58:34,572 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 95 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:58:34,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 80 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 158 Invalid, 0 Unknown, 27 Unchecked, 0.2s Time] [2022-11-18 20:58:34,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-18 20:58:34,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-11-18 20:58:34,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 30 states have internal predecessors, (31), 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-18 20:58:34,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-11-18 20:58:34,588 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 21 [2022-11-18 20:58:34,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:58:34,588 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-11-18 20:58:34,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 29 states have internal predecessors, (61), 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-18 20:58:34,588 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-11-18 20:58:34,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-18 20:58:34,589 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:58:34,589 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-18 20:58:34,596 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-18 20:58:34,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-18 20:58:34,796 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-18 20:58:34,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:58:34,796 INFO L85 PathProgramCache]: Analyzing trace with hash 913454038, now seen corresponding path program 2 times [2022-11-18 20:58:34,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:58:34,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565842322] [2022-11-18 20:58:34,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:58:34,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:58:34,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:35,628 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:58:35,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:58:35,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565842322] [2022-11-18 20:58:35,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565842322] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:58:35,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136986398] [2022-11-18 20:58:35,629 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:58:35,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:58:35,629 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:58:35,631 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:58:35,661 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-18 20:58:35,777 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:58:35,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:58:35,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-18 20:58:35,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:58:35,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-18 20:58:35,972 INFO L321 Elim1Store]: treesize reduction 78, result has 41.4 percent of original size [2022-11-18 20:58:35,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 220 [2022-11-18 20:58:35,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 20:58:36,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:58:36,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:58:36,124 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:58:36,167 INFO L321 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-11-18 20:58:36,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 122 treesize of output 115 [2022-11-18 20:58:36,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 20:58:36,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-11-18 20:58:36,255 WARN L193 Elim1Store]: Array PQE input equivalent to false [2022-11-18 20:58:36,308 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 70 [2022-11-18 20:58:36,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-18 20:58:37,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:58:37,265 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:58:37,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 267 treesize of output 233 [2022-11-18 20:58:37,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 20:58:37,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 20:58:37,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 20:58:37,382 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 20:58:37,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 7 treesize of output 5 [2022-11-18 20:58:37,422 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:58:37,423 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 18 treesize of output 22 [2022-11-18 20:58:37,447 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 28 treesize of output 22 [2022-11-18 20:58:37,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 20:58:37,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-18 20:58:37,857 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-18 20:58:37,916 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-18 20:58:37,957 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:58:37,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:58:38,013 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_736 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_736) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483649)) is different from false [2022-11-18 20:58:40,121 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:58:40,122 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 21 treesize of output 22 [2022-11-18 20:58:40,126 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 124 treesize of output 112 [2022-11-18 20:58:40,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2022-11-18 20:58:40,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2022-11-18 20:58:40,600 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2022-11-18 20:58:40,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136986398] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:58:40,601 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:58:40,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 26 [2022-11-18 20:58:40,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255952042] [2022-11-18 20:58:40,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:58:40,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-18 20:58:40,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:58:40,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-18 20:58:40,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=538, Unknown=7, NotChecked=48, Total=702 [2022-11-18 20:58:40,604 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 27 states, 26 states have (on average 2.5) internal successors, (65), 27 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-18 20:58:41,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:58:41,807 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-11-18 20:58:41,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:58:41,807 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.5) internal successors, (65), 27 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) Word has length 24 [2022-11-18 20:58:41,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:58:41,810 INFO L225 Difference]: With dead ends: 31 [2022-11-18 20:58:41,810 INFO L226 Difference]: Without dead ends: 30 [2022-11-18 20:58:41,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=255, Invalid=864, Unknown=7, NotChecked=64, Total=1190 [2022-11-18 20:58:41,812 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 60 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:58:41,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 46 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 79 Invalid, 0 Unknown, 51 Unchecked, 0.1s Time] [2022-11-18 20:58:41,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-18 20:58:41,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-11-18 20:58:41,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 29 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-18 20:58:41,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2022-11-18 20:58:41,830 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 24 [2022-11-18 20:58:41,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:58:41,831 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2022-11-18 20:58:41,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.5) internal successors, (65), 27 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-18 20:58:41,831 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-11-18 20:58:41,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-18 20:58:41,832 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:58:41,832 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-18 20:58:41,845 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-18 20:58:42,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-18 20:58:42,038 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-18 20:58:42,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:58:42,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1747695832, now seen corresponding path program 2 times [2022-11-18 20:58:42,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:58:42,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270595943] [2022-11-18 20:58:42,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:58:42,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:58:42,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:42,703 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:58:42,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:58:42,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270595943] [2022-11-18 20:58:42,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270595943] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:58:42,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603855441] [2022-11-18 20:58:42,704 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:58:42,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:58:42,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:58:42,706 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:58:42,737 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-18 20:58:42,863 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:58:42,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:58:42,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-18 20:58:42,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:58:43,079 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-18 20:58:43,080 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-18 20:58:43,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-18 20:58:43,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:58:43,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:58:43,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:58:43,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:58:43,587 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-18 20:58:43,587 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 127 treesize of output 68 [2022-11-18 20:58:43,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 20:58:43,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-18 20:58:43,657 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:58:43,667 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:58:43,689 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-18 20:58:43,690 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 225 treesize of output 194 [2022-11-18 20:58:43,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 20:58:43,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 20:58:43,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 20:58:43,838 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 20:58:43,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-18 20:58:44,500 INFO L321 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2022-11-18 20:58:44,500 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 35 treesize of output 30 [2022-11-18 20:58:44,609 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-18 20:58:44,609 INFO L350 Elim1Store]: Elim1 eliminated variable 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 21 treesize of output 34 [2022-11-18 20:58:44,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 20:58:44,710 INFO L350 Elim1Store]: Elim1 eliminated variable 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 29 treesize of output 29 [2022-11-18 20:58:44,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-11-18 20:58:44,973 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:58:44,973 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 20 treesize of output 26 [2022-11-18 20:58:45,012 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 20 treesize of output 22 [2022-11-18 20:58:45,148 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:58:45,148 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 33 treesize of output 25 [2022-11-18 20:58:45,190 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:58:45,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:58:46,781 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 8 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:58:46,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603855441] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:58:46,781 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:58:46,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 14] total 35 [2022-11-18 20:58:46,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979177941] [2022-11-18 20:58:46,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:58:46,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-18 20:58:46,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:58:46,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-18 20:58:46,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=933, Unknown=83, NotChecked=0, Total=1260 [2022-11-18 20:58:46,783 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 36 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 36 states have internal predecessors, (71), 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-18 20:58:48,353 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (or (< 0 (+ .cse0 2147483648)) (< (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|) 1)) (forall ((v_ArrVal_820 (Array Int Int)) (v_ArrVal_818 Int) (v_ArrVal_819 (Array Int Int))) (let ((.cse1 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_818)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_819) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_820))) (or (< (+ v_ArrVal_818 1) .cse0) (< (select (select .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< 0 (+ (select (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)))))))) is different from false [2022-11-18 20:58:48,360 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (or (< 0 (+ .cse0 2147483648)) (not (< 0 |c_ULTIMATE.start_test_fun_#t~mem9#1|))) (forall ((v_ArrVal_820 (Array Int Int)) (v_ArrVal_818 Int) (v_ArrVal_819 (Array Int Int))) (let ((.cse1 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_818)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_819) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_820))) (or (< (+ v_ArrVal_818 1) .cse0) (< (select (select .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< 0 (+ (select (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)))))))) is different from false [2022-11-18 20:58:48,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:58:48,583 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2022-11-18 20:58:48,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-18 20:58:48,583 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 36 states have internal predecessors, (71), 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 25 [2022-11-18 20:58:48,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:58:48,584 INFO L225 Difference]: With dead ends: 54 [2022-11-18 20:58:48,584 INFO L226 Difference]: Without dead ends: 53 [2022-11-18 20:58:48,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 752 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=625, Invalid=1985, Unknown=154, NotChecked=206, Total=2970 [2022-11-18 20:58:48,586 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 68 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 234 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:58:48,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 85 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 48 Invalid, 0 Unknown, 234 Unchecked, 0.1s Time] [2022-11-18 20:58:48,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-18 20:58:48,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2022-11-18 20:58:48,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 50 states have internal predecessors, (53), 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-18 20:58:48,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2022-11-18 20:58:48,603 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 25 [2022-11-18 20:58:48,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:58:48,603 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2022-11-18 20:58:48,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 36 states have internal predecessors, (71), 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-18 20:58:48,604 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2022-11-18 20:58:48,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-18 20:58:48,604 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:58:48,605 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-18 20:58:48,612 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-18 20:58:48,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-18 20:58:48,812 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-18 20:58:48,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:58:48,812 INFO L85 PathProgramCache]: Analyzing trace with hash -2012905382, now seen corresponding path program 2 times [2022-11-18 20:58:48,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:58:48,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203044150] [2022-11-18 20:58:48,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:58:48,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:58:48,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:49,525 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:58:49,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:58:49,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203044150] [2022-11-18 20:58:49,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203044150] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:58:49,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690114772] [2022-11-18 20:58:49,526 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:58:49,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:58:49,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:58:49,528 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:58:49,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-18 20:58:49,704 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:58:49,704 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:58:49,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-18 20:58:49,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:58:49,944 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-18 20:58:49,944 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-18 20:58:49,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 20:58:49,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:58:50,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:58:50,078 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:58:50,096 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:58:50,125 INFO L321 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-11-18 20:58:50,125 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-18 20:58:50,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 20:58:50,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-18 20:58:50,240 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:58:50,245 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:58:50,250 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:58:50,252 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-18 20:58:50,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-18 20:58:50,366 INFO L321 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-11-18 20:58:50,367 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 6 case distinctions, treesize of input 66 treesize of output 25 [2022-11-18 20:58:50,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 20:58:50,411 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:58:50,412 INFO L350 Elim1Store]: Elim1 eliminated variable 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 52 treesize of output 15 [2022-11-18 20:58:50,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 20:58:51,979 INFO L321 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-11-18 20:58:51,979 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 250 treesize of output 235 [2022-11-18 20:58:52,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-18 20:58:52,298 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 20:58:52,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2022-11-18 20:58:52,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-18 20:58:52,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-18 20:58:52,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-18 20:58:52,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-18 20:58:52,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-18 20:58:52,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:58:52,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 20:58:52,867 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:58:52,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:58:52,920 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_914 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_914) |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-18 20:58:53,296 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_910 (Array Int Int)) (v_ArrVal_913 (Array Int Int)) (v_ArrVal_914 (Array Int Int)) (v_ArrVal_911 Int) (v_ArrVal_909 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_909) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_910))) (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_911) (< (select (select (store (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_911)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_913) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_914) |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-18 20:58:53,526 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_910 (Array Int Int)) (v_ArrVal_908 Int) (v_ArrVal_913 (Array Int Int)) (v_ArrVal_914 (Array Int Int)) (v_ArrVal_906 (Array Int Int)) (v_ArrVal_911 Int) (v_ArrVal_909 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_906))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (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_908)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_909) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_910))) (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_908) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_911) (< (select (select (store (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_911)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_913) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_914) |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-18 20:58:56,416 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2022-11-18 20:58:56,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690114772] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:58:56,417 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:58:56,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 14] total 34 [2022-11-18 20:58:56,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60595085] [2022-11-18 20:58:56,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:58:56,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-18 20:58:56,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:58:56,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-18 20:58:56,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=750, Unknown=48, NotChecked=186, Total=1190 [2022-11-18 20:58:56,420 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand has 35 states, 34 states have (on average 2.3823529411764706) internal successors, (81), 35 states have internal predecessors, (81), 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-18 20:59:28,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:59:28,796 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2022-11-18 20:59:28,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-18 20:59:28,797 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.3823529411764706) internal successors, (81), 35 states have internal predecessors, (81), 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 28 [2022-11-18 20:59:28,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:59:28,798 INFO L225 Difference]: With dead ends: 55 [2022-11-18 20:59:28,798 INFO L226 Difference]: Without dead ends: 54 [2022-11-18 20:59:28,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 35 SyntacticMatches, 11 SemanticMatches, 46 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 36.8s TimeCoverageRelationStatistics Valid=407, Invalid=1479, Unknown=106, NotChecked=264, Total=2256 [2022-11-18 20:59:28,800 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 46 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:59:28,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 99 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 133 Unchecked, 0.0s Time] [2022-11-18 20:59:28,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-18 20:59:28,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-11-18 20:59:28,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 53 states have internal predecessors, (54), 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-18 20:59:28,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2022-11-18 20:59:28,814 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 28 [2022-11-18 20:59:28,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:59:28,814 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2022-11-18 20:59:28,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.3823529411764706) internal successors, (81), 35 states have internal predecessors, (81), 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-18 20:59:28,815 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-11-18 20:59:28,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-18 20:59:28,815 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:59:28,816 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2022-11-18 20:59:28,821 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-18 20:59:29,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-18 20:59:29,016 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-18 20:59:29,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:59:29,017 INFO L85 PathProgramCache]: Analyzing trace with hash 914115305, now seen corresponding path program 3 times [2022-11-18 20:59:29,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:59:29,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012692707] [2022-11-18 20:59:29,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:59:29,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:59:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:59:30,360 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:59:30,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:59:30,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012692707] [2022-11-18 20:59:30,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012692707] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:59:30,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885145548] [2022-11-18 20:59:30,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:59:30,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:59:30,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:59:30,362 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:59:30,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-18 20:59:30,649 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-18 20:59:30,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:59:30,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-18 20:59:30,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:59:30,850 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-18 20:59:30,850 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-18 20:59:30,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 20:59:30,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:59:30,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:59:30,982 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:59:30,990 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:59:31,012 INFO L321 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-11-18 20:59:31,012 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 96 [2022-11-18 20:59:31,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 20:59:31,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 20:59:31,097 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:59:31,104 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:59:31,107 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:59:31,108 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-18 20:59:31,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 20:59:31,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:59:31,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:59:31,199 INFO L350 Elim1Store]: Elim1 eliminated variable 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 52 treesize of output 15 [2022-11-18 20:59:31,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-18 20:59:32,631 INFO L321 Elim1Store]: treesize reduction 54, result has 21.7 percent of original size [2022-11-18 20:59:32,632 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 394 treesize of output 367 [2022-11-18 20:59:32,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 20:59:32,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-18 20:59:32,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2022-11-18 20:59:32,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2022-11-18 20:59:33,179 INFO L321 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2022-11-18 20:59:33,180 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 47 treesize of output 62 [2022-11-18 20:59:33,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 20:59:33,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-18 20:59:33,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-18 20:59:33,544 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 32 treesize of output 20 [2022-11-18 20:59:33,657 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:59:33,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2022-11-18 20:59:33,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-18 20:59:33,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 34 treesize of output 22 [2022-11-18 20:59:33,999 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:59:33,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2022-11-18 20:59:34,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-18 20:59:34,215 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 34 treesize of output 22 [2022-11-18 20:59:34,315 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:59:34,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2022-11-18 20:59:34,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-18 20:59:34,530 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 34 treesize of output 22 [2022-11-18 20:59:34,657 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:59:34,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2022-11-18 20:59:34,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-18 20:59:34,889 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:59:34,889 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 33 treesize of output 25 [2022-11-18 20:59:34,918 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:59:34,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:59:44,228 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 22 refuted. 78 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:59:44,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885145548] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:59:44,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:59:44,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20, 27] total 61 [2022-11-18 20:59:44,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613357483] [2022-11-18 20:59:44,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:59:44,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-11-18 20:59:44,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:59:44,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-11-18 20:59:44,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=709, Invalid=2585, Unknown=488, NotChecked=0, Total=3782 [2022-11-18 20:59:44,231 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand has 62 states, 61 states have (on average 2.3442622950819674) internal successors, (143), 62 states have internal predecessors, (143), 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-18 20:59:55,551 WARN L233 SmtUtils]: Spent 7.39s on a formula simplification. DAG size of input: 185 DAG size of output: 181 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 21:00:04,672 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (forall ((v_ArrVal_1044 Int) (v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1045 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1044)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1045) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1046))) (or (< 0 (+ (select (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1044 1) .cse1) (< (select (select .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1)))) (forall ((v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1033 (Array Int Int)) (v_ArrVal_1042 (Array Int Int)) (v_ArrVal_1041 (Array Int Int)) (v_ArrVal_1040 Int) (v_ArrVal_1044 Int) (v_ArrVal_1032 Int) (v_ArrVal_1036 Int)) (let ((.cse9 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1032)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1033) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1034))) (let ((.cse5 (select .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse8 (store (store (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_1036)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1037) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1038))) (let ((.cse3 (select .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse7 (store (store (store .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1040)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1041) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1042))) (let ((.cse6 (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse4 (store (store (store .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1044)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1045) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1046))) (or (< (+ v_ArrVal_1040 1) (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1032 1) .cse1) (< (+ v_ArrVal_1036 1) (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (select (select .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (+ v_ArrVal_1044 1) (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))))))))))) (or (< 0 (+ .cse1 2147483648)) (< (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|) 1)) (forall ((v_ArrVal_1040 Int) (v_ArrVal_1044 Int) (v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1042 (Array Int Int)) (v_ArrVal_1041 (Array Int Int))) (let ((.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1040)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1041) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1042))) (let ((.cse11 (select .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse10 (store (store (store .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse11 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1044)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1045) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1046))) (or (< (select (select .cse10 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (+ v_ArrVal_1040 1) .cse1) (< (+ v_ArrVal_1044 1) (select .cse11 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648))))))) (forall ((v_ArrVal_1040 Int) (v_ArrVal_1044 Int) (v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1036 Int) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1042 (Array Int Int)) (v_ArrVal_1041 (Array Int Int))) (let ((.cse17 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1036)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1037) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1038))) (let ((.cse14 (select .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse16 (store (store (store .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1040)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1041) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1042))) (let ((.cse15 (select .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse13 (store (store (store .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse15 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1044)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1045) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1046))) (or (< (select (select .cse13 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (+ v_ArrVal_1036 1) .cse1) (< (+ v_ArrVal_1040 1) (select .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1044 1) (select .cse15 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))))))))) is different from false [2022-11-18 21:00:04,692 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (forall ((v_ArrVal_1044 Int) (v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1045 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1044)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1045) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1046))) (or (< 0 (+ (select (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1044 1) .cse1) (< (select (select .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1)))) (or (< 0 (+ .cse1 2147483648)) (not (< 0 |c_ULTIMATE.start_test_fun_#t~mem9#1|))) (forall ((v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1033 (Array Int Int)) (v_ArrVal_1042 (Array Int Int)) (v_ArrVal_1041 (Array Int Int)) (v_ArrVal_1040 Int) (v_ArrVal_1044 Int) (v_ArrVal_1032 Int) (v_ArrVal_1036 Int)) (let ((.cse9 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1032)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1033) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1034))) (let ((.cse5 (select .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse8 (store (store (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_1036)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1037) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1038))) (let ((.cse3 (select .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse7 (store (store (store .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1040)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1041) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1042))) (let ((.cse6 (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse4 (store (store (store .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1044)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1045) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1046))) (or (< (+ v_ArrVal_1040 1) (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1032 1) .cse1) (< (+ v_ArrVal_1036 1) (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (select (select .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (+ v_ArrVal_1044 1) (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))))))))))) (forall ((v_ArrVal_1040 Int) (v_ArrVal_1044 Int) (v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1042 (Array Int Int)) (v_ArrVal_1041 (Array Int Int))) (let ((.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1040)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1041) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1042))) (let ((.cse11 (select .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse10 (store (store (store .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse11 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1044)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1045) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1046))) (or (< (select (select .cse10 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (+ v_ArrVal_1040 1) .cse1) (< (+ v_ArrVal_1044 1) (select .cse11 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648))))))) (forall ((v_ArrVal_1040 Int) (v_ArrVal_1044 Int) (v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1036 Int) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1042 (Array Int Int)) (v_ArrVal_1041 (Array Int Int))) (let ((.cse17 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1036)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1037) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1038))) (let ((.cse14 (select .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse16 (store (store (store .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1040)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1041) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1042))) (let ((.cse15 (select .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse13 (store (store (store .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse15 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1044)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1045) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1046))) (or (< (select (select .cse13 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (+ v_ArrVal_1036 1) .cse1) (< (+ v_ArrVal_1040 1) (select .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1044 1) (select .cse15 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))))))))) is different from false [2022-11-18 21:00:08,748 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (forall ((v_ArrVal_1044 Int) (v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1045 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1044)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1045) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1046))) (or (< 0 (+ (select (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1044 1) .cse1) (< (select (select .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1)))) (or (< 0 (+ .cse1 2147483648)) (< (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|) 1)) (forall ((v_ArrVal_1040 Int) (v_ArrVal_1044 Int) (v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1042 (Array Int Int)) (v_ArrVal_1041 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1040)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1041) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1042))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse3 (store (store (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1044)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1045) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1046))) (or (< (select (select .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (+ v_ArrVal_1040 1) .cse1) (< (+ v_ArrVal_1044 1) (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648))))))) (forall ((v_ArrVal_1040 Int) (v_ArrVal_1044 Int) (v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1036 Int) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1042 (Array Int Int)) (v_ArrVal_1041 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1036)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1037) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1038))) (let ((.cse7 (select .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse9 (store (store (store .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1040)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1041) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1042))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse6 (store (store (store .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1044)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1045) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1046))) (or (< (select (select .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (+ v_ArrVal_1036 1) .cse1) (< (+ v_ArrVal_1040 1) (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1044 1) (select .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))))))))) is different from false [2022-11-18 21:00:08,761 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (forall ((v_ArrVal_1044 Int) (v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1045 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1044)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1045) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1046))) (or (< 0 (+ (select (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1044 1) .cse1) (< (select (select .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1)))) (or (< 0 (+ .cse1 2147483648)) (not (< 0 |c_ULTIMATE.start_test_fun_#t~mem9#1|))) (forall ((v_ArrVal_1040 Int) (v_ArrVal_1044 Int) (v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1042 (Array Int Int)) (v_ArrVal_1041 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1040)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1041) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1042))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse3 (store (store (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1044)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1045) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1046))) (or (< (select (select .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (+ v_ArrVal_1040 1) .cse1) (< (+ v_ArrVal_1044 1) (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648))))))) (forall ((v_ArrVal_1040 Int) (v_ArrVal_1044 Int) (v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1036 Int) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1042 (Array Int Int)) (v_ArrVal_1041 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1036)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1037) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1038))) (let ((.cse7 (select .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse9 (store (store (store .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1040)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1041) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1042))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse6 (store (store (store .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1044)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1045) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1046))) (or (< (select (select .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (+ v_ArrVal_1036 1) .cse1) (< (+ v_ArrVal_1040 1) (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1044 1) (select .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))))))))) is different from false [2022-11-18 21:00:20,360 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (forall ((v_ArrVal_1044 Int) (v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1045 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1044)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1045) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1046))) (or (< 0 (+ (select (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1044 1) .cse1) (< (select (select .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1)))) (or (< 0 (+ .cse1 2147483648)) (< (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|) 1)) (forall ((v_ArrVal_1040 Int) (v_ArrVal_1044 Int) (v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1042 (Array Int Int)) (v_ArrVal_1041 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1040)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1041) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1042))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse3 (store (store (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1044)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1045) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1046))) (or (< (select (select .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (+ v_ArrVal_1040 1) .cse1) (< (+ v_ArrVal_1044 1) (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)))))))))) is different from false [2022-11-18 21:00:20,368 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (forall ((v_ArrVal_1044 Int) (v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1045 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1044)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1045) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1046))) (or (< 0 (+ (select (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1044 1) .cse1) (< (select (select .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1)))) (or (< 0 (+ .cse1 2147483648)) (not (< 0 |c_ULTIMATE.start_test_fun_#t~mem9#1|))) (forall ((v_ArrVal_1040 Int) (v_ArrVal_1044 Int) (v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1042 (Array Int Int)) (v_ArrVal_1041 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1040)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1041) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1042))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse3 (store (store (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1044)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1045) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1046))) (or (< (select (select .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (+ v_ArrVal_1040 1) .cse1) (< (+ v_ArrVal_1044 1) (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)))))))))) is different from false [2022-11-18 21:00:21,621 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (forall ((v_ArrVal_1044 Int) (v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1045 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1044)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1045) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1046))) (or (< 0 (+ (select (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1044 1) .cse1) (< (select (select .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1)))) (or (< 0 (+ .cse1 2147483648)) (< (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|) 1))))) is different from false [2022-11-18 21:00:21,626 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (forall ((v_ArrVal_1044 Int) (v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1045 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1044)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1045) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1046))) (or (< 0 (+ (select (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1044 1) .cse1) (< (select (select .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1)))) (or (< 0 (+ .cse1 2147483648)) (not (< 0 |c_ULTIMATE.start_test_fun_#t~mem9#1|)))))) is different from false [2022-11-18 21:00:21,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:00:21,935 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2022-11-18 21:00:21,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-18 21:00:21,936 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 2.3442622950819674) internal successors, (143), 62 states have internal predecessors, (143), 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 49 [2022-11-18 21:00:21,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:00:21,937 INFO L225 Difference]: With dead ends: 105 [2022-11-18 21:00:21,937 INFO L226 Difference]: Without dead ends: 104 [2022-11-18 21:00:21,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 2662 ImplicationChecksByTransitivity, 46.8s TimeCoverageRelationStatistics Valid=1976, Invalid=6227, Unknown=1141, NotChecked=1576, Total=10920 [2022-11-18 21:00:21,942 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 160 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 589 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 21:00:21,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 227 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 42 Invalid, 0 Unknown, 589 Unchecked, 0.1s Time] [2022-11-18 21:00:21,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-18 21:00:21,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2022-11-18 21:00:21,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 97 states have (on average 1.0721649484536082) internal successors, (104), 98 states have internal predecessors, (104), 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-18 21:00:21,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2022-11-18 21:00:21,957 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 49 [2022-11-18 21:00:21,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:00:21,957 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2022-11-18 21:00:21,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 2.3442622950819674) internal successors, (143), 62 states have internal predecessors, (143), 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-18 21:00:21,957 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2022-11-18 21:00:21,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-18 21:00:21,958 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:00:21,958 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1] [2022-11-18 21:00:21,964 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-18 21:00:22,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:00:22,159 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-18 21:00:22,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:00:22,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1978509063, now seen corresponding path program 3 times [2022-11-18 21:00:22,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:00:22,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919006580] [2022-11-18 21:00:22,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:00:22,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:00:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:00:23,451 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 21:00:23,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:00:23,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919006580] [2022-11-18 21:00:23,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919006580] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 21:00:23,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39857730] [2022-11-18 21:00:23,452 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 21:00:23,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:00:23,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:00:23,457 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 21:00:23,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-18 21:00:23,964 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-18 21:00:23,964 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 21:00:23,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 76 conjunts are in the unsatisfiable core [2022-11-18 21:00:23,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:00:23,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-18 21:00:24,040 INFO L321 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-11-18 21:00:24,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 112 treesize of output 104 [2022-11-18 21:00:24,163 INFO L321 Elim1Store]: treesize reduction 96, result has 31.9 percent of original size [2022-11-18 21:00:24,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 96 treesize of output 193 [2022-11-18 21:00:24,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 21:00:24,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 21:00:24,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 21:00:24,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 59 [2022-11-18 21:00:24,291 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 21:00:24,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2022-11-18 21:00:24,375 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 21:00:24,379 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 156 treesize of output 141 [2022-11-18 21:00:24,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 83 [2022-11-18 21:00:24,462 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 21:00:24,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 141 [2022-11-18 21:00:24,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 83 [2022-11-18 21:00:24,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 15 [2022-11-18 21:00:24,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 21:00:24,599 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 21:00:24,600 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 100 treesize of output 66 [2022-11-18 21:00:24,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 21:00:37,089 WARN L233 SmtUtils]: Spent 12.19s on a formula simplification. DAG size of input: 97 DAG size of output: 95 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 21:00:44,920 WARN L233 SmtUtils]: Spent 6.82s on a formula simplification that was a NOOP. DAG size: 101 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 21:00:45,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 21:00:45,617 INFO L321 Elim1Store]: treesize reduction 26, result has 27.8 percent of original size [2022-11-18 21:00:45,617 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 3 case distinctions, treesize of input 364 treesize of output 329 [2022-11-18 21:00:45,626 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 21:00:45,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 332 treesize of output 323 [2022-11-18 21:00:45,651 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 21:00:45,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 70 [2022-11-18 21:00:45,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 21:00:45,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 21:00:45,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 21:00:45,848 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 21:00:45,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 25 [2022-11-18 21:00:45,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-18 21:00:46,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 21:00:46,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 21:00:46,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-18 21:00:46,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 21:00:46,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 21:00:46,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-18 21:00:46,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 21:00:46,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 21:00:46,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-18 21:00:47,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 21:00:47,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 21:00:47,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-18 21:00:47,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 21:00:47,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 21:00:47,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 21:00:47,462 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 21:00:47,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 21:00:47,524 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1193 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1193) |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-18 21:00:47,802 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1189 (Array Int Int)) (v_ArrVal_1190 Int) (v_ArrVal_1193 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1189))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (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_1190)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1192) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1193) |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_1190))))) is different from false [2022-11-18 21:00:48,239 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1186 Int) (v_ArrVal_1189 (Array Int Int)) (v_ArrVal_1188 (Array Int Int)) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1190 Int) (v_ArrVal_1193 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1185))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (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_1186)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1188) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1189))) (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_1186) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1190) (< (select (select (store (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_1190)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1192) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1193) |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-18 21:00:48,540 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1182 Int) (v_ArrVal_1186 Int) (v_ArrVal_1189 (Array Int Int)) (v_ArrVal_1188 (Array Int Int)) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1190 Int) (v_ArrVal_1184 (Array Int Int)) (v_ArrVal_1193 (Array Int Int))) (let ((.cse3 (store (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_1182)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1184) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1185))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (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_1186)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1188) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1189))) (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_1186) (not (<= v_ArrVal_1182 (+ |c_ULTIMATE.start_test_fun_#t~mem12#1| 1))) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1190) (< (select (select (store (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_1190)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1192) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1193) |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-18 21:00:49,234 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1189 (Array Int Int)) (v_ArrVal_1188 (Array Int Int)) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1190 Int) (v_ArrVal_1184 (Array Int Int)) (v_ArrVal_1193 (Array Int Int)) (v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1182 Int) (v_ArrVal_1186 Int) (v_ArrVal_1179 Int)) (let ((.cse5 (store (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_1179)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1180) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1181))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (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_1182)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1184) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1185))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store (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_1186)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1188) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1189))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (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_1190)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1192) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1193) |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_1182) (not (<= v_ArrVal_1179 (+ |c_ULTIMATE.start_test_fun_#t~mem12#1| 1))) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1190) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1186))))))))) is different from false [2022-11-18 21:00:49,332 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1189 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1188 (Array Int Int)) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1190 Int) (v_ArrVal_1184 (Array Int Int)) (v_ArrVal_1193 (Array Int Int)) (v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1182 Int) (v_ArrVal_1186 Int) (v_ArrVal_1179 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1177))) (let ((.cse2 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (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_1179)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1180) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1181))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (store (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_1182)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1184) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1185))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store (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_1186)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1188) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1189))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (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_1190)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1192) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1193) |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_1179) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1186) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1190) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1182))))))))))) is different from false [2022-11-18 21:00:54,578 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 29 refuted. 42 times theorem prover too weak. 0 trivial. 44 not checked. [2022-11-18 21:00:54,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39857730] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 21:00:54,579 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 21:00:54,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 22] total 53 [2022-11-18 21:00:54,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252426791] [2022-11-18 21:00:54,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 21:00:54,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-11-18 21:00:54,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:00:54,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-11-18 21:00:54,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=531, Invalid=1631, Unknown=118, NotChecked=582, Total=2862 [2022-11-18 21:00:54,580 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand has 54 states, 53 states have (on average 2.8867924528301887) internal successors, (153), 54 states have internal predecessors, (153), 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-18 21:01:02,052 WARN L233 SmtUtils]: Spent 6.64s on a formula simplification. DAG size of input: 105 DAG size of output: 65 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 21:01:38,110 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1189 (Array Int Int)) (v_ArrVal_1190 Int) (v_ArrVal_1193 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1189))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (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_1190)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1192) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1193) |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_1190))))) (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1186 Int) (v_ArrVal_1189 (Array Int Int)) (v_ArrVal_1188 (Array Int Int)) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1190 Int) (v_ArrVal_1193 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1185))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (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_1186)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1188) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1189))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1186) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1190) (< (select (select (store (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_1190)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1192) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1193) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))) (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1182 Int) (v_ArrVal_1186 Int) (v_ArrVal_1189 (Array Int Int)) (v_ArrVal_1188 (Array Int Int)) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1190 Int) (v_ArrVal_1184 (Array Int Int)) (v_ArrVal_1193 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1181))) (let ((.cse8 (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse10 (store (store (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1182)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1184) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1185))) (let ((.cse9 (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (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_1186)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1188) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1189))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1190)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1192) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1193) |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_1190) (< (+ (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1182) (< (+ (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1186))))))))) (forall ((v_ArrVal_1193 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1193) |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-18 21:01:38,893 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1189 (Array Int Int)) (v_ArrVal_1188 (Array Int Int)) (v_ArrVal_1190 Int) (v_ArrVal_1193 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1188) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1189))) (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_1190) (< (select (select (store (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_1190)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1192) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1193) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))) (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1193 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1192) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1193) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1186 Int) (v_ArrVal_1189 (Array Int Int)) (v_ArrVal_1188 (Array Int Int)) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1190 Int) (v_ArrVal_1184 (Array Int Int)) (v_ArrVal_1193 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1184) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1185))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (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_1186)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1188) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1189))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (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_1190)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1192) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1193) |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_1186) (< (+ 1 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_ArrVal_1190)))))))) is different from false [2022-11-18 21:01:38,901 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1189 (Array Int Int)) (v_ArrVal_1190 Int) (v_ArrVal_1193 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1189))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (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_1190)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1192) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1193) |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_1190))))) (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1186 Int) (v_ArrVal_1189 (Array Int Int)) (v_ArrVal_1188 (Array Int Int)) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1190 Int) (v_ArrVal_1193 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1185))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (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_1186)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1188) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1189))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1186) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1190) (< (select (select (store (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_1190)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1192) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1193) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))) (forall ((v_ArrVal_1193 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1193) |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-18 21:01:38,910 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_test_fun_#t~mem12#1| 1)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (and (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1190 Int) (v_ArrVal_1193 (Array Int Int))) (or (< (select (select (store (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_1190)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1192) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1193) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_1190 .cse1)))) (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1186 Int) (v_ArrVal_1189 (Array Int Int)) (v_ArrVal_1188 (Array Int Int)) (v_ArrVal_1190 Int) (v_ArrVal_1193 (Array Int Int))) (let ((.cse2 (store (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_1186)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1188) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1189))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (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_1190)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1192) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1193) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_1186 .cse1)) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1190))))))) is different from false [2022-11-18 21:01:44,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:01:44,363 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2022-11-18 21:01:44,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-18 21:01:44,369 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 2.8867924528301887) internal successors, (153), 54 states have internal predecessors, (153), 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 52 [2022-11-18 21:01:44,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:01:44,370 INFO L225 Difference]: With dead ends: 103 [2022-11-18 21:01:44,370 INFO L226 Difference]: Without dead ends: 102 [2022-11-18 21:01:44,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 78 SyntacticMatches, 16 SemanticMatches, 73 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 1777 ImplicationChecksByTransitivity, 76.4s TimeCoverageRelationStatistics Valid=927, Invalid=2916, Unknown=357, NotChecked=1350, Total=5550 [2022-11-18 21:01:44,373 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 49 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 21:01:44,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 138 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 5 Invalid, 0 Unknown, 106 Unchecked, 0.0s Time] [2022-11-18 21:01:44,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-18 21:01:44,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-11-18 21:01:44,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 100 states have (on average 1.02) internal successors, (102), 101 states have internal predecessors, (102), 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-18 21:01:44,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2022-11-18 21:01:44,396 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 52 [2022-11-18 21:01:44,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:01:44,396 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2022-11-18 21:01:44,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 2.8867924528301887) internal successors, (153), 54 states have internal predecessors, (153), 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-18 21:01:44,397 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2022-11-18 21:01:44,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-18 21:01:44,398 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:01:44,398 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2022-11-18 21:01:44,404 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-18 21:01:44,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-18 21:01:44,601 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-18 21:01:44,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:01:44,601 INFO L85 PathProgramCache]: Analyzing trace with hash -2002224789, now seen corresponding path program 4 times [2022-11-18 21:01:44,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:01:44,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604789055] [2022-11-18 21:01:44,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:01:44,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:01:44,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:47,767 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 21:01:47,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:01:47,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604789055] [2022-11-18 21:01:47,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604789055] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 21:01:47,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325392333] [2022-11-18 21:01:47,768 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-18 21:01:47,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:01:47,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:01:47,769 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 21:01:47,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4370af26-6eb4-4885-904f-e36b2faa4847/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-18 21:01:47,965 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-18 21:01:47,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 21:01:47,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 127 conjunts are in the unsatisfiable core [2022-11-18 21:01:47,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:01:48,188 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-18 21:01:48,189 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-18 21:01:48,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 21:01:48,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 21:01:48,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 21:01:49,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 21:01:49,052 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 21:01:49,055 INFO L350 Elim1Store]: Elim1 eliminated variable 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 74 treesize of output 33 [2022-11-18 21:01:49,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 21:01:49,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 21:01:49,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 21:01:49,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 21:01:49,142 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-18 21:01:49,142 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 143 treesize of output 80 [2022-11-18 21:01:49,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 21:01:49,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-18 21:01:50,288 INFO L321 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2022-11-18 21:01:50,289 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 46 treesize of output 44 [2022-11-18 21:01:50,514 INFO L321 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2022-11-18 21:01:50,514 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 61 treesize of output 63 [2022-11-18 21:01:50,714 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 21:01:50,714 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 1 case distinctions, treesize of input 37 treesize of output 38 [2022-11-18 21:01:50,987 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-18 21:01:50,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 43 [2022-11-18 21:01:51,207 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-18 21:01:51,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 47 [2022-11-18 21:01:51,415 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 21:01:51,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 35 [2022-11-18 21:01:51,638 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-18 21:01:51,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 45 [2022-11-18 21:01:51,876 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-18 21:01:51,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 47 [2022-11-18 21:01:52,064 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 21:01:52,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 35 [2022-11-18 21:01:52,310 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-18 21:01:52,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 45 [2022-11-18 21:01:52,523 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-18 21:01:52,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 47 [2022-11-18 21:01:52,727 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 21:01:52,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 35 [2022-11-18 21:01:52,980 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-18 21:01:52,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 45 [2022-11-18 21:01:53,210 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-18 21:01:53,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 47 [2022-11-18 21:01:53,371 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 21:01:53,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 35 [2022-11-18 21:01:53,651 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-18 21:01:53,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 45 [2022-11-18 21:01:53,868 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-18 21:01:53,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 47 [2022-11-18 21:01:54,034 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 21:01:54,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 35 [2022-11-18 21:01:54,308 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-18 21:01:54,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 45 [2022-11-18 21:01:54,544 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-18 21:01:54,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 47 [2022-11-18 21:01:54,736 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 21:01:54,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 35 [2022-11-18 21:01:55,006 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-18 21:01:55,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 45 [2022-11-18 21:01:55,333 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-18 21:01:55,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 47 [2022-11-18 21:01:55,514 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 21:01:55,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 35 [2022-11-18 21:01:55,791 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-18 21:01:55,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 45 [2022-11-18 21:01:56,081 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-18 21:01:56,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 47 [2022-11-18 21:01:56,259 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 21:01:56,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 35 [2022-11-18 21:01:56,607 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-18 21:01:56,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 45 [2022-11-18 21:01:56,848 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-18 21:01:56,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 47 [2022-11-18 21:01:57,043 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 21:01:57,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 35 [2022-11-18 21:01:57,328 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-18 21:01:57,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 45 [2022-11-18 21:01:57,538 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-18 21:01:57,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 47 [2022-11-18 21:01:57,694 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 21:01:57,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 35 [2022-11-18 21:01:57,943 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-18 21:01:58,017 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 21:01:58,017 INFO L328 TraceCheckSpWp]: Computing backward predicates...