./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-properties/list_flag-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-properties/list_flag-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4547628201bbb61f481f84914c46868091db8c6a3d0c4d8890951b495ae3c7da --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 16:09:36,398 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:09:36,400 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:09:36,426 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:09:36,430 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:09:36,434 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:09:36,437 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:09:36,438 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:09:36,440 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:09:36,441 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:09:36,443 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:09:36,444 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:09:36,444 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:09:36,445 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:09:36,447 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:09:36,448 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:09:36,449 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:09:36,450 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:09:36,451 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:09:36,453 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:09:36,454 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:09:36,456 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:09:36,457 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:09:36,458 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:09:36,462 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:09:36,463 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:09:36,463 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:09:36,464 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:09:36,465 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:09:36,466 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:09:36,466 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:09:36,468 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:09:36,469 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:09:36,470 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:09:36,471 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:09:36,472 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:09:36,473 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:09:36,473 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:09:36,474 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:09:36,475 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:09:36,476 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:09:36,477 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-21 16:09:36,501 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:09:36,502 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:09:36,502 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:09:36,502 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:09:36,503 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:09:36,504 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:09:36,505 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:09:36,505 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:09:36,505 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:09:36,506 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:09:36,506 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 16:09:36,507 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:09:36,507 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 16:09:36,507 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:09:36,507 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 16:09:36,508 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:09:36,508 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 16:09:36,508 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 16:09:36,509 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 16:09:36,509 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:09:36,509 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 16:09:36,510 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:09:36,510 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:09:36,510 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:09:36,511 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:09:36,511 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:09:36,511 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:09:36,512 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 16:09:36,512 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:09:36,512 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 16:09:36,512 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 16:09:36,513 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 16:09:36,513 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 16:09:36,513 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_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4547628201bbb61f481f84914c46868091db8c6a3d0c4d8890951b495ae3c7da [2022-11-21 16:09:36,878 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:09:36,910 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:09:36,914 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:09:36,915 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:09:36,916 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:09:36,918 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/list-properties/list_flag-2.i [2022-11-21 16:09:40,033 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:09:40,380 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:09:40,383 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/sv-benchmarks/c/list-properties/list_flag-2.i [2022-11-21 16:09:40,417 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/data/b50f5404c/c9db069c820e4ebea93f3afe79bf07ef/FLAG329d53ca7 [2022-11-21 16:09:40,449 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/data/b50f5404c/c9db069c820e4ebea93f3afe79bf07ef [2022-11-21 16:09:40,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:09:40,453 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:09:40,454 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:09:40,455 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:09:40,459 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:09:40,462 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:09:40" (1/1) ... [2022-11-21 16:09:40,464 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1331ff58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:09:40, skipping insertion in model container [2022-11-21 16:09:40,464 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:09:40" (1/1) ... [2022-11-21 16:09:40,472 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:09:40,537 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:09:40,952 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/sv-benchmarks/c/list-properties/list_flag-2.i[23375,23388] [2022-11-21 16:09:40,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:09:40,967 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:09:41,027 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/sv-benchmarks/c/list-properties/list_flag-2.i[23375,23388] [2022-11-21 16:09:41,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:09:41,060 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:09:41,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:09:41 WrapperNode [2022-11-21 16:09:41,061 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:09:41,062 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:09:41,062 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:09:41,063 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:09:41,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:09:41" (1/1) ... [2022-11-21 16:09:41,098 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:09:41" (1/1) ... [2022-11-21 16:09:41,130 INFO L138 Inliner]: procedures = 124, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 70 [2022-11-21 16:09:41,131 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:09:41,132 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:09:41,132 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:09:41,132 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:09:41,143 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:09:41" (1/1) ... [2022-11-21 16:09:41,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:09:41" (1/1) ... [2022-11-21 16:09:41,161 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:09:41" (1/1) ... [2022-11-21 16:09:41,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:09:41" (1/1) ... [2022-11-21 16:09:41,169 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:09:41" (1/1) ... [2022-11-21 16:09:41,174 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:09:41" (1/1) ... [2022-11-21 16:09:41,175 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:09:41" (1/1) ... [2022-11-21 16:09:41,177 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:09:41" (1/1) ... [2022-11-21 16:09:41,183 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:09:41,192 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:09:41,192 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:09:41,192 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:09:41,193 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:09:41" (1/1) ... [2022-11-21 16:09:41,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:09:41,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:09:41,239 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:09:41,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:09:41,294 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-21 16:09:41,295 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-21 16:09:41,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 16:09:41,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 16:09:41,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 16:09:41,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:09:41,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-21 16:09:41,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-21 16:09:41,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 16:09:41,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:09:41,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:09:41,473 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:09:41,476 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:09:41,523 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-21 16:09:41,648 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:09:41,656 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:09:41,656 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-21 16:09:41,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:09:41 BoogieIcfgContainer [2022-11-21 16:09:41,659 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:09:41,662 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:09:41,662 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:09:41,666 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:09:41,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:09:40" (1/3) ... [2022-11-21 16:09:41,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a53ec36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:09:41, skipping insertion in model container [2022-11-21 16:09:41,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:09:41" (2/3) ... [2022-11-21 16:09:41,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a53ec36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:09:41, skipping insertion in model container [2022-11-21 16:09:41,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:09:41" (3/3) ... [2022-11-21 16:09:41,669 INFO L112 eAbstractionObserver]: Analyzing ICFG list_flag-2.i [2022-11-21 16:09:41,691 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:09:41,692 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-21 16:09:41,748 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:09:41,757 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;@5a535fbd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:09:41,757 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-21 16:09:41,762 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 25 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:41,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-21 16:09:41,786 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:09:41,787 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:09:41,788 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:09:41,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:09:41,794 INFO L85 PathProgramCache]: Analyzing trace with hash 943582971, now seen corresponding path program 1 times [2022-11-21 16:09:41,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:09:41,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701906130] [2022-11-21 16:09:41,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:41,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:09:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:42,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:09:42,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:09:42,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701906130] [2022-11-21 16:09:42,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701906130] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:09:42,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:09:42,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:09:42,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123056487] [2022-11-21 16:09:42,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:09:42,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 16:09:42,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:09:42,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 16:09:42,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 16:09:42,172 INFO L87 Difference]: Start difference. First operand has 27 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 25 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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-21 16:09:42,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:09:42,195 INFO L93 Difference]: Finished difference Result 40 states and 55 transitions. [2022-11-21 16:09:42,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 16:09:42,197 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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-21 16:09:42,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:09:42,206 INFO L225 Difference]: With dead ends: 40 [2022-11-21 16:09:42,206 INFO L226 Difference]: Without dead ends: 20 [2022-11-21 16:09:42,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 16:09:42,214 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:09:42,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:09:42,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-21 16:09:42,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-11-21 16:09:42,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:42,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-11-21 16:09:42,256 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 11 [2022-11-21 16:09:42,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:09:42,257 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-11-21 16:09:42,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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-21 16:09:42,258 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-11-21 16:09:42,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-21 16:09:42,259 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:09:42,260 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:09:42,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 16:09:42,261 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:09:42,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:09:42,262 INFO L85 PathProgramCache]: Analyzing trace with hash 267820561, now seen corresponding path program 1 times [2022-11-21 16:09:42,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:09:42,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298396503] [2022-11-21 16:09:42,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:42,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:09:42,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:42,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-21 16:09:42,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:09:42,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298396503] [2022-11-21 16:09:42,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298396503] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:09:42,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:09:42,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:09:42,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180090069] [2022-11-21 16:09:42,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:09:42,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:09:42,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:09:42,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:09:42,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:09:42,601 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:42,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:09:42,748 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-11-21 16:09:42,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:09:42,749 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2022-11-21 16:09:42,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:09:42,750 INFO L225 Difference]: With dead ends: 44 [2022-11-21 16:09:42,750 INFO L226 Difference]: Without dead ends: 40 [2022-11-21 16:09:42,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:09:42,752 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 25 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:09:42,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 57 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:09:42,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-21 16:09:42,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2022-11-21 16:09:42,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:42,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-11-21 16:09:42,768 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 13 [2022-11-21 16:09:42,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:09:42,768 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-11-21 16:09:42,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:42,769 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-11-21 16:09:42,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-21 16:09:42,770 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:09:42,770 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:09:42,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 16:09:42,771 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:09:42,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:09:42,772 INFO L85 PathProgramCache]: Analyzing trace with hash -273802420, now seen corresponding path program 1 times [2022-11-21 16:09:42,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:09:42,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233190778] [2022-11-21 16:09:42,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:42,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:09:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:43,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:09:43,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:09:43,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233190778] [2022-11-21 16:09:43,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233190778] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:09:43,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:09:43,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:09:43,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506910738] [2022-11-21 16:09:43,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:09:43,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:09:43,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:09:43,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:09:43,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:09:43,036 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:43,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:09:43,190 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-11-21 16:09:43,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:09:43,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-21 16:09:43,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:09:43,192 INFO L225 Difference]: With dead ends: 46 [2022-11-21 16:09:43,192 INFO L226 Difference]: Without dead ends: 38 [2022-11-21 16:09:43,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:09:43,194 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 21 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:09:43,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 61 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:09:43,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-21 16:09:43,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 26. [2022-11-21 16:09:43,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 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-21 16:09:43,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-11-21 16:09:43,202 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 15 [2022-11-21 16:09:43,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:09:43,202 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-11-21 16:09:43,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:43,203 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-11-21 16:09:43,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-21 16:09:43,204 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:09:43,204 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:09:43,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 16:09:43,205 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:09:43,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:09:43,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1517543941, now seen corresponding path program 1 times [2022-11-21 16:09:43,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:09:43,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596090284] [2022-11-21 16:09:43,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:43,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:09:43,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:43,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:09:43,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:09:43,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596090284] [2022-11-21 16:09:43,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596090284] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:09:43,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:09:43,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:09:43,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525402126] [2022-11-21 16:09:43,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:09:43,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:09:43,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:09:43,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:09:43,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:09:43,417 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:43,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:09:43,533 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2022-11-21 16:09:43,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:09:43,534 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-21 16:09:43,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:09:43,536 INFO L225 Difference]: With dead ends: 50 [2022-11-21 16:09:43,536 INFO L226 Difference]: Without dead ends: 40 [2022-11-21 16:09:43,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:09:43,539 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 21 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:09:43,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 56 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:09:43,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-21 16:09:43,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 22. [2022-11-21 16:09:43,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:43,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-11-21 16:09:43,546 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 15 [2022-11-21 16:09:43,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:09:43,546 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-11-21 16:09:43,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:43,547 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-11-21 16:09:43,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-21 16:09:43,548 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:09:43,548 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:09:43,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 16:09:43,549 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:09:43,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:09:43,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1906655974, now seen corresponding path program 1 times [2022-11-21 16:09:43,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:09:43,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848958049] [2022-11-21 16:09:43,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:43,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:09:43,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:43,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:09:43,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:09:43,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848958049] [2022-11-21 16:09:43,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848958049] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:09:43,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:09:43,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:09:43,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117022196] [2022-11-21 16:09:43,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:09:43,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:09:43,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:09:43,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:09:43,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:09:43,640 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-21 16:09:43,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:09:43,663 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2022-11-21 16:09:43,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:09:43,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-21 16:09:43,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:09:43,665 INFO L225 Difference]: With dead ends: 50 [2022-11-21 16:09:43,665 INFO L226 Difference]: Without dead ends: 34 [2022-11-21 16:09:43,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:09:43,667 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 8 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:09:43,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 41 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:09:43,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-21 16:09:43,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2022-11-21 16:09:43,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 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-21 16:09:43,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-11-21 16:09:43,673 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 19 [2022-11-21 16:09:43,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:09:43,674 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-11-21 16:09:43,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-21 16:09:43,675 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-11-21 16:09:43,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-21 16:09:43,675 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:09:43,676 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:09:43,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 16:09:43,676 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:09:43,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:09:43,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1462919029, now seen corresponding path program 1 times [2022-11-21 16:09:43,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:09:43,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953314618] [2022-11-21 16:09:43,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:43,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:09:43,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:44,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:09:44,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:09:44,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953314618] [2022-11-21 16:09:44,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953314618] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:09:44,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478717762] [2022-11-21 16:09:44,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:44,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:09:44,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:09:44,283 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:09:44,318 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 16:09:44,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:44,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-21 16:09:44,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:09:44,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 16:09:44,682 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:09:44,764 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 16:09:44,765 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 11 treesize of output 11 [2022-11-21 16:09:44,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:09:44,852 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 21 treesize of output 20 [2022-11-21 16:09:44,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 16:09:44,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 16:09:44,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:09:44,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:09:45,167 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:09:45,168 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 2 case distinctions, treesize of input 23 treesize of output 29 [2022-11-21 16:09:45,184 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:09:45,184 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 30 treesize of output 33 [2022-11-21 16:09:45,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-21 16:09:45,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:09:45,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478717762] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:09:45,384 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:09:45,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2022-11-21 16:09:45,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225081584] [2022-11-21 16:09:45,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:09:45,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-21 16:09:45,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:09:45,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-21 16:09:45,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=301, Unknown=3, NotChecked=0, Total=380 [2022-11-21 16:09:45,392 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:45,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:09:45,946 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-11-21 16:09:45,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:09:45,948 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-21 16:09:45,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:09:45,949 INFO L225 Difference]: With dead ends: 59 [2022-11-21 16:09:45,949 INFO L226 Difference]: Without dead ends: 55 [2022-11-21 16:09:45,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=140, Invalid=457, Unknown=3, NotChecked=0, Total=600 [2022-11-21 16:09:45,951 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 139 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 33 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:09:45,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 79 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 128 Invalid, 2 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 16:09:45,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-21 16:09:45,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 41. [2022-11-21 16:09:45,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:45,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2022-11-21 16:09:45,961 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 19 [2022-11-21 16:09:45,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:09:45,961 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2022-11-21 16:09:45,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:45,962 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-11-21 16:09:45,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-21 16:09:45,963 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:09:45,963 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:09:45,977 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 16:09:46,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:09:46,171 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:09:46,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:09:46,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1319849960, now seen corresponding path program 1 times [2022-11-21 16:09:46,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:09:46,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057698057] [2022-11-21 16:09:46,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:46,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:09:46,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:46,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:09:46,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:09:46,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057698057] [2022-11-21 16:09:46,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057698057] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:09:46,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026650596] [2022-11-21 16:09:46,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:46,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:09:46,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:09:46,529 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:09:46,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 16:09:46,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:46,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-21 16:09:46,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:09:46,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 16:09:46,733 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:09:46,790 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 16:09:46,791 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 11 treesize of output 11 [2022-11-21 16:09:46,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:09:46,877 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 21 treesize of output 20 [2022-11-21 16:09:46,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 16:09:46,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 16:09:46,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:09:46,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:09:47,156 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:09:47,157 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 2 case distinctions, treesize of input 23 treesize of output 29 [2022-11-21 16:09:47,171 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:09:47,172 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 30 treesize of output 33 [2022-11-21 16:09:47,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-21 16:09:47,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:09:47,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026650596] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:09:47,328 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:09:47,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2022-11-21 16:09:47,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204935453] [2022-11-21 16:09:47,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:09:47,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-21 16:09:47,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:09:47,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-21 16:09:47,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=301, Unknown=3, NotChecked=0, Total=380 [2022-11-21 16:09:47,331 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:48,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:09:48,169 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2022-11-21 16:09:48,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:09:48,170 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-21 16:09:48,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:09:48,171 INFO L225 Difference]: With dead ends: 59 [2022-11-21 16:09:48,171 INFO L226 Difference]: Without dead ends: 55 [2022-11-21 16:09:48,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=143, Invalid=454, Unknown=3, NotChecked=0, Total=600 [2022-11-21 16:09:48,173 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 95 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 26 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 16:09:48,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 118 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 217 Invalid, 1 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 16:09:48,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-21 16:09:48,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 43. [2022-11-21 16:09:48,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 42 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-21 16:09:48,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2022-11-21 16:09:48,183 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 19 [2022-11-21 16:09:48,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:09:48,183 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2022-11-21 16:09:48,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:48,184 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2022-11-21 16:09:48,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-21 16:09:48,185 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:09:48,185 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:09:48,195 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 16:09:48,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:09:48,392 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:09:48,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:09:48,393 INFO L85 PathProgramCache]: Analyzing trace with hash 876113015, now seen corresponding path program 1 times [2022-11-21 16:09:48,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:09:48,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478053848] [2022-11-21 16:09:48,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:48,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:09:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:48,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:09:48,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:09:48,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478053848] [2022-11-21 16:09:48,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478053848] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:09:48,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:09:48,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:09:48,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980791912] [2022-11-21 16:09:48,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:09:48,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:09:48,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:09:48,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:09:48,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:09:48,460 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-21 16:09:48,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:09:48,486 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2022-11-21 16:09:48,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:09:48,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-21 16:09:48,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:09:48,490 INFO L225 Difference]: With dead ends: 53 [2022-11-21 16:09:48,490 INFO L226 Difference]: Without dead ends: 39 [2022-11-21 16:09:48,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:09:48,494 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 8 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:09:48,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 49 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:09:48,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-21 16:09:48,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2022-11-21 16:09:48,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1470588235294117) 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-21 16:09:48,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-11-21 16:09:48,517 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 19 [2022-11-21 16:09:48,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:09:48,518 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-11-21 16:09:48,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-21 16:09:48,518 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-11-21 16:09:48,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-21 16:09:48,520 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:09:48,520 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:09:48,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 16:09:48,521 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:09:48,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:09:48,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1445257616, now seen corresponding path program 1 times [2022-11-21 16:09:48,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:09:48,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119586202] [2022-11-21 16:09:48,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:48,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:09:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:49,064 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-21 16:09:49,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:09:49,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119586202] [2022-11-21 16:09:49,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119586202] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:09:49,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460895644] [2022-11-21 16:09:49,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:49,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:09:49,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:09:49,067 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:09:49,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 16:09:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:49,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-21 16:09:49,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:09:49,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 6 treesize of output 5 [2022-11-21 16:09:49,294 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 16:09:49,295 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 11 treesize of output 11 [2022-11-21 16:09:49,341 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 16:09:49,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 16:09:49,427 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 16:09:49,428 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 61 [2022-11-21 16:09:49,434 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 42 treesize of output 44 [2022-11-21 16:09:49,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2022-11-21 16:09:49,490 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 39 treesize of output 21 [2022-11-21 16:09:49,496 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 23 treesize of output 11 [2022-11-21 16:09:49,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 16:09:49,514 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-21 16:09:49,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:09:49,560 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 79 treesize of output 57 [2022-11-21 16:09:49,670 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:09:49,670 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 22 treesize of output 23 [2022-11-21 16:09:49,683 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:09:49,688 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 36 treesize of output 35 [2022-11-21 16:09:49,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 16:09:49,726 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:09:49,727 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 22 treesize of output 1 [2022-11-21 16:09:49,891 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-21 16:09:49,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460895644] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:09:49,891 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:09:49,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-11-21 16:09:49,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294723454] [2022-11-21 16:09:49,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:09:49,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-21 16:09:49,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:09:49,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-21 16:09:49,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=249, Unknown=6, NotChecked=0, Total=306 [2022-11-21 16:09:49,896 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 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-21 16:09:50,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:09:50,264 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2022-11-21 16:09:50,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 16:09:50,265 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 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) Word has length 21 [2022-11-21 16:09:50,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:09:50,266 INFO L225 Difference]: With dead ends: 69 [2022-11-21 16:09:50,266 INFO L226 Difference]: Without dead ends: 65 [2022-11-21 16:09:50,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=398, Unknown=6, NotChecked=0, Total=506 [2022-11-21 16:09:50,267 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 129 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:09:50,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 134 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:09:50,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-21 16:09:50,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2022-11-21 16:09:50,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 52 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:50,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2022-11-21 16:09:50,286 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 21 [2022-11-21 16:09:50,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:09:50,287 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2022-11-21 16:09:50,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 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-21 16:09:50,287 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2022-11-21 16:09:50,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-21 16:09:50,290 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:09:50,290 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:09:50,303 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-21 16:09:50,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-21 16:09:50,498 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:09:50,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:09:50,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1652508907, now seen corresponding path program 2 times [2022-11-21 16:09:50,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:09:50,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657633012] [2022-11-21 16:09:50,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:50,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:09:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:51,050 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:09:51,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:09:51,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657633012] [2022-11-21 16:09:51,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657633012] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:09:51,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971117948] [2022-11-21 16:09:51,050 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 16:09:51,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:09:51,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:09:51,055 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:09:51,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 16:09:51,176 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 16:09:51,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:09:51,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-21 16:09:51,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:09:51,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 16:09:51,272 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 16:09:51,272 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 11 treesize of output 11 [2022-11-21 16:09:51,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 16:09:51,321 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 16:09:51,376 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 16:09:51,377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 61 [2022-11-21 16:09:51,387 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 42 treesize of output 44 [2022-11-21 16:09:51,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2022-11-21 16:09:51,437 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 39 treesize of output 21 [2022-11-21 16:09:51,442 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 23 treesize of output 11 [2022-11-21 16:09:51,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 16:09:51,482 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:09:51,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:09:51,562 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 52 treesize of output 30 [2022-11-21 16:09:51,571 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_284 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_284) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_ArrVal_286 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2022-11-21 16:09:51,599 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:09:51,599 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 22 treesize of output 23 [2022-11-21 16:09:51,610 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:09:51,610 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 38 treesize of output 31 [2022-11-21 16:09:51,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:09:51,639 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:09:51,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2022-11-21 16:09:51,806 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-21 16:09:51,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971117948] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:09:51,806 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:09:51,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2022-11-21 16:09:51,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511146599] [2022-11-21 16:09:51,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:09:51,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-21 16:09:51,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:09:51,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-21 16:09:51,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=362, Unknown=1, NotChecked=38, Total=462 [2022-11-21 16:09:51,809 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 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-21 16:09:52,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:09:52,441 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2022-11-21 16:09:52,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-21 16:09:52,442 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 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) Word has length 23 [2022-11-21 16:09:52,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:09:52,442 INFO L225 Difference]: With dead ends: 71 [2022-11-21 16:09:52,443 INFO L226 Difference]: Without dead ends: 59 [2022-11-21 16:09:52,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=150, Invalid=783, Unknown=1, NotChecked=58, Total=992 [2022-11-21 16:09:52,445 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 74 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:09:52,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 149 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 246 Invalid, 1 Unknown, 34 Unchecked, 0.2s Time] [2022-11-21 16:09:52,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-21 16:09:52,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2022-11-21 16:09:52,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.125) internal successors, (54), 48 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-21 16:09:52,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2022-11-21 16:09:52,460 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 23 [2022-11-21 16:09:52,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:09:52,461 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2022-11-21 16:09:52,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 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-21 16:09:52,461 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2022-11-21 16:09:52,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-21 16:09:52,462 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:09:52,462 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:09:52,474 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-21 16:09:52,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:09:52,669 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:09:52,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:09:52,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1313154078, now seen corresponding path program 1 times [2022-11-21 16:09:52,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:09:52,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704099722] [2022-11-21 16:09:52,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:52,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:09:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:53,074 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:09:53,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:09:53,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704099722] [2022-11-21 16:09:53,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704099722] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:09:53,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238760194] [2022-11-21 16:09:53,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:53,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:09:53,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:09:53,079 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:09:53,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-21 16:09:53,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:53,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-21 16:09:53,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:09:53,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 16:09:53,243 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 16:09:53,243 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 11 treesize of output 11 [2022-11-21 16:09:53,276 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 16:09:53,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 16:09:53,343 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 16:09:53,343 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 61 [2022-11-21 16:09:53,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2022-11-21 16:09:53,354 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 34 [2022-11-21 16:09:53,391 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 39 treesize of output 21 [2022-11-21 16:09:53,395 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 23 treesize of output 11 [2022-11-21 16:09:53,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 16:09:53,429 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:09:53,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:09:53,496 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 52 treesize of output 30 [2022-11-21 16:09:53,600 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:09:53,601 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 22 treesize of output 23 [2022-11-21 16:09:53,609 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:09:53,610 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 38 treesize of output 31 [2022-11-21 16:09:53,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:09:53,635 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:09:53,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2022-11-21 16:09:53,763 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:09:53,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238760194] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:09:53,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:09:53,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2022-11-21 16:09:53,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699396111] [2022-11-21 16:09:53,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:09:53,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-21 16:09:53,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:09:53,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-21 16:09:53,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=392, Unknown=7, NotChecked=0, Total=462 [2022-11-21 16:09:53,766 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 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-21 16:09:54,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:09:54,268 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2022-11-21 16:09:54,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-21 16:09:54,269 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 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) Word has length 23 [2022-11-21 16:09:54,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:09:54,269 INFO L225 Difference]: With dead ends: 65 [2022-11-21 16:09:54,269 INFO L226 Difference]: Without dead ends: 53 [2022-11-21 16:09:54,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=168, Invalid=755, Unknown=7, NotChecked=0, Total=930 [2022-11-21 16:09:54,271 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 77 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:09:54,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 135 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:09:54,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-21 16:09:54,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 45. [2022-11-21 16:09:54,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 44 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-21 16:09:54,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2022-11-21 16:09:54,277 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 23 [2022-11-21 16:09:54,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:09:54,277 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2022-11-21 16:09:54,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 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-21 16:09:54,278 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-11-21 16:09:54,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-21 16:09:54,278 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:09:54,278 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:09:54,291 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-21 16:09:54,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:09:54,479 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:09:54,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:09:54,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1574953317, now seen corresponding path program 3 times [2022-11-21 16:09:54,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:09:54,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546899289] [2022-11-21 16:09:54,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:54,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:09:54,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:55,279 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:09:55,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:09:55,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546899289] [2022-11-21 16:09:55,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546899289] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:09:55,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669003189] [2022-11-21 16:09:55,280 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 16:09:55,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:09:55,280 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:09:55,281 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:09:55,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-21 16:09:55,406 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-21 16:09:55,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:09:55,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-21 16:09:55,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:09:55,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 16:09:55,492 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 16:09:55,492 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 11 treesize of output 11 [2022-11-21 16:09:55,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:09:55,571 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:09:55,642 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:09:55,660 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 16:09:55,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-11-21 16:09:55,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:09:55,694 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 16:09:55,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2022-11-21 16:09:55,893 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 16:09:55,893 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 92 [2022-11-21 16:09:55,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:09:55,902 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 41 treesize of output 36 [2022-11-21 16:09:55,910 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 51 [2022-11-21 16:09:56,035 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 16:09:56,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 56 [2022-11-21 16:09:56,060 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-21 16:09:56,061 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 27 treesize of output 32 [2022-11-21 16:09:56,097 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-11-21 16:09:56,098 INFO L350 Elim1Store]: Elim1 eliminated variable 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 36 treesize of output 47 [2022-11-21 16:09:56,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-21 16:09:56,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 47 [2022-11-21 16:09:56,668 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 101 treesize of output 77 [2022-11-21 16:09:56,695 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-11-21 16:09:56,696 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 81 treesize of output 73 [2022-11-21 16:09:57,011 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 16:09:57,011 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 22 treesize of output 14 [2022-11-21 16:09:57,043 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:09:57,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:09:58,013 INFO L321 Elim1Store]: treesize reduction 4, result has 90.0 percent of original size [2022-11-21 16:09:58,014 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 1963 treesize of output 1863 [2022-11-21 16:09:58,052 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:09:58,053 INFO L350 Elim1Store]: Elim1 eliminated variable 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 1 case distinctions, treesize of input 1294 treesize of output 1137 [2022-11-21 16:10:00,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-21 16:10:00,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-21 16:10:00,803 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse27 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse10 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (let ((.cse4 (or (and (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (let ((.cse31 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_61| .cse31) (= .cse31 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_ArrVal_426 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (= (select v_arrayElimArr_9 .cse0) 0)))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_426 (Array Int Int))) (let ((.cse32 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse32) (= .cse32 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_61| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (not (= (select v_arrayElimArr_9 .cse0) 0))))) .cse10)) (.cse5 (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (let ((.cse30 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_61| .cse30) (= .cse30 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_ArrVal_426 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|)) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|)))))) (.cse8 (not (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse9 (not .cse27)) (.cse15 (or (and (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (let ((.cse28 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse28 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse28 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_ArrVal_426 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)))))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_426 (Array Int Int))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse29 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse29)))) (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|))))))) .cse10)) (.cse3 (and (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse0) .cse27)) (.cse18 (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_426 (Array Int Int))) (let ((.cse26 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse26 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse26)))) (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|)))))) (.cse6 (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_426 (Array Int Int))) (let ((.cse25 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse25) (= .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_61| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|))) (not (= (select v_arrayElimArr_9 .cse0) 0))))) (.cse19 (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (let ((.cse24 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse24 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse24 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_ArrVal_426 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|))))))) (and (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_426 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse1 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse1) (= .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|))))) (or .cse3 (and .cse4 .cse5 .cse6)) .cse4 (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((v_ArrVal_424 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_61| Int) (v_ArrVal_426 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (let ((.cse7 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_61| .cse7) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse7 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|)))) (not (= (select v_arrayElimArr_9 .cse0) 0)))) (or .cse8 .cse9 .cse10 (forall ((v_ArrVal_424 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_61| Int) (v_ArrVal_426 (Array Int Int)) (v_ArrVal_429 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0) (not (= (select v_arrayElimArr_9 .cse0) 0)) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)))) .cse5 (or (and (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse0) 0)) (forall ((v_ArrVal_424 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_61| Int) (v_ArrVal_426 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (let ((.cse11 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse11 0) (= .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|)))))) (or (forall ((v_ArrVal_424 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_61| Int) (v_ArrVal_426 (Array Int Int)) (v_ArrVal_429 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse12 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse12 0) (not (= (select v_arrayElimArr_9 .cse0) 0)) (= .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)))) .cse10)) .cse3) (or .cse8 .cse9 (forall ((v_ArrVal_424 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_61| Int) (v_ArrVal_426 (Array Int Int)) (v_ArrVal_429 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse0) 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_61| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|)))) (or (and (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_426 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (let ((.cse13 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_61| .cse13) (= .cse13 |c_ULTIMATE.start_main_~a~0#1.base|)))))) (not (= (select v_arrayElimArr_9 .cse0) 0)))) (forall ((v_ArrVal_424 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_61| Int) (v_ArrVal_429 (Array Int Int))) (let ((.cse14 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_61| .cse14) (= .cse14 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse14 |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse10) .cse15 (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_426 (Array Int Int))) (let ((.cse16 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse16 0) (= .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|))) (not (= (select v_arrayElimArr_9 .cse0) 0)))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_426 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (let ((.cse17 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_61| .cse17) (= .cse17 |c_ULTIMATE.start_main_~a~0#1.base|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|))))) (or (and .cse15 .cse18 .cse19) .cse3) (forall ((v_ArrVal_424 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_61| Int) (v_ArrVal_429 (Array Int Int))) (let ((.cse20 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_61| .cse20) (= .cse20 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse20 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|)))) .cse18 (or (and (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_426 (Array Int Int))) (let ((.cse21 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse21 0) (= .cse21 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int) (v_ArrVal_426 (Array Int Int))) (let ((.cse22 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse22 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse22) (= .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) .cse10) (or (forall ((v_ArrVal_424 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_61| Int) (v_ArrVal_426 (Array Int Int)) (v_ArrVal_429 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse23 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_9 .cse0) 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_61| .cse23) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse23 |c_ULTIMATE.start_main_~a~0#1.base|)))) .cse10) .cse6 .cse19))) is different from false [2022-11-21 16:10:03,293 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:10:03,295 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 76 treesize of output 56 [2022-11-21 16:10:03,305 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:10:03,306 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 188 treesize of output 175 [2022-11-21 16:10:03,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 136 [2022-11-21 16:10:03,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 61 [2022-11-21 16:10:03,572 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:10:03,572 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 25 treesize of output 26 [2022-11-21 16:10:03,595 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:10:03,596 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 51 treesize of output 41 [2022-11-21 16:10:03,602 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:10:03,616 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:10:03,618 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 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-21 16:10:03,622 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:10:03,631 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:10:03,632 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 1 case distinctions, treesize of input 61 treesize of output 54 [2022-11-21 16:10:03,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-11-21 16:10:03,659 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:10:03,659 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 20 treesize of output 20 [2022-11-21 16:10:03,721 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:10:03,721 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 51 treesize of output 1 [2022-11-21 16:10:03,733 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:10:03,734 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 25 treesize of output 1 [2022-11-21 16:10:03,750 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:10:03,750 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 51 treesize of output 1 [2022-11-21 16:10:03,762 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:10:03,762 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 51 treesize of output 1 [2022-11-21 16:10:03,774 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:10:03,775 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 51 treesize of output 1 [2022-11-21 16:10:03,783 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:10:03,784 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 76 treesize of output 56 [2022-11-21 16:10:03,788 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:10:03,800 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:10:03,800 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 1 case distinctions, treesize of input 86 treesize of output 73 [2022-11-21 16:10:03,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2022-11-21 16:10:03,843 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:10:03,844 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 51 treesize of output 1 [2022-11-21 16:10:03,851 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-21 16:10:03,863 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:10:03,863 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 25 treesize of output 1 [2022-11-21 16:10:03,878 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:10:03,878 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 51 treesize of output 1 [2022-11-21 16:10:03,888 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:10:03,888 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 76 treesize of output 1 [2022-11-21 16:10:03,895 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-21 16:10:03,903 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-21 16:10:04,262 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-21 16:10:04,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669003189] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:10:04,262 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:10:04,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 36 [2022-11-21 16:10:04,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443513675] [2022-11-21 16:10:04,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:10:04,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-21 16:10:04,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:10:04,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-21 16:10:04,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1062, Unknown=10, NotChecked=66, Total=1260 [2022-11-21 16:10:04,265 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 36 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:10:11,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:10:13,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:10:19,060 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse34 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse10 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (let ((.cse4 (or (and (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (let ((.cse38 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_61| .cse38) (= .cse38 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_ArrVal_426 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (= (select v_arrayElimArr_9 .cse0) 0)))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_426 (Array Int Int))) (let ((.cse39 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse39) (= .cse39 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_61| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (not (= (select v_arrayElimArr_9 .cse0) 0))))) .cse10)) (.cse5 (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (let ((.cse37 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_61| .cse37) (= .cse37 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_ArrVal_426 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|)) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|)))))) (.cse11 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse8 (not (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse9 (not .cse34)) (.cse20 (or (and (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (let ((.cse35 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse35 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse35 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_ArrVal_426 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)))))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_426 (Array Int Int))) (let ((.cse36 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse36 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse36)))) (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|))))))) .cse10)) (.cse3 (and (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse0) .cse34)) (.cse23 (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_426 (Array Int Int))) (let ((.cse33 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse33 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse33)))) (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|)))))) (.cse15 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse6 (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_426 (Array Int Int))) (let ((.cse32 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse32) (= .cse32 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_61| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|))) (not (= (select v_arrayElimArr_9 .cse0) 0))))) (.cse24 (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (let ((.cse31 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse31 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse31 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_ArrVal_426 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|))))))) (and (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_426 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse1 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse1) (= .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|))))) (or .cse3 (and .cse4 .cse5 .cse6)) (= (select |c_#valid| |c_ULTIMATE.start_main_~p~0#1.base|) 1) .cse4 (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((v_ArrVal_424 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_61| Int) (v_ArrVal_426 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (let ((.cse7 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_61| .cse7) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse7 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|)))) (not (= (select v_arrayElimArr_9 .cse0) 0)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (or .cse8 .cse9 .cse10 (forall ((v_ArrVal_424 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_61| Int) (v_ArrVal_426 (Array Int Int)) (v_ArrVal_429 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0) (not (= (select v_arrayElimArr_9 .cse0) 0)) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)))) (not (= .cse11 |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_424 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_61| Int) (v_ArrVal_426 (Array Int Int)) (v_ArrVal_429 (Array Int Int)) (v_ArrVal_425 Int)) (let ((.cse13 (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 v_ArrVal_425)))) (store .cse14 |v_ULTIMATE.start_main_~p~0#1.base_61| (store (select .cse14 |v_ULTIMATE.start_main_~p~0#1.base_61|) 0 3))))) (let ((.cse12 (select (select .cse13 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 0)) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))) (or (= .cse12 1) (= 3 .cse12) (not (= (select (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))))) .cse5 (= .cse15 0) (= .cse11 |c_ULTIMATE.start_main_~p~0#1.base|) (or (and (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse0) 0)) (forall ((v_ArrVal_424 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_61| Int) (v_ArrVal_426 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (let ((.cse16 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse16 0) (= .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|)))))) (or (forall ((v_ArrVal_424 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_61| Int) (v_ArrVal_426 (Array Int Int)) (v_ArrVal_429 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse17 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse17 0) (not (= (select v_arrayElimArr_9 .cse0) 0)) (= .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)))) .cse10)) .cse3) (or .cse8 .cse9 (forall ((v_ArrVal_424 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_61| Int) (v_ArrVal_426 (Array Int Int)) (v_ArrVal_429 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse0) 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_61| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|)))) (or (and (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_426 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (let ((.cse18 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_61| .cse18) (= .cse18 |c_ULTIMATE.start_main_~a~0#1.base|)))))) (not (= (select v_arrayElimArr_9 .cse0) 0)))) (forall ((v_ArrVal_424 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_61| Int) (v_ArrVal_429 (Array Int Int))) (let ((.cse19 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_61| .cse19) (= .cse19 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse19 |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse10) .cse20 (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_426 (Array Int Int))) (let ((.cse21 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse21 0) (= .cse21 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|))) (not (= (select v_arrayElimArr_9 .cse0) 0)))) .cse9 (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_426 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (let ((.cse22 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_61| .cse22) (= .cse22 |c_ULTIMATE.start_main_~a~0#1.base|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|))))) (or (and .cse20 .cse23 .cse24) .cse3) (forall ((v_ArrVal_424 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_61| Int) (v_ArrVal_429 (Array Int Int))) (let ((.cse25 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_61| .cse25) (= .cse25 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse25 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|)))) .cse23 .cse10 (or (and (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_426 (Array Int Int))) (let ((.cse26 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse26 0) (= .cse26 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int) (v_ArrVal_426 (Array Int Int))) (let ((.cse27 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse27 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse27) (= .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) .cse10) (or (forall ((v_ArrVal_424 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_61| Int) (v_ArrVal_426 (Array Int Int)) (v_ArrVal_429 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse28 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_9 .cse0) 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_61| .cse28) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse28 |c_ULTIMATE.start_main_~a~0#1.base|)))) .cse10) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse29 (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)))) (or (not (= (select (select .cse29 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (forall ((v_ArrVal_426 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (let ((.cse30 (select (select .cse29 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))) (or (= .cse30 1) (= 3 .cse30))))))) (= .cse15 |c_ULTIMATE.start_main_~p~0#1.offset|) .cse6 .cse24))) is different from false [2022-11-21 16:10:24,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:10:24,399 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2022-11-21 16:10:24,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-21 16:10:24,400 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 36 states have internal predecessors, (70), 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 27 [2022-11-21 16:10:24,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:10:24,401 INFO L225 Difference]: With dead ends: 79 [2022-11-21 16:10:24,402 INFO L226 Difference]: Without dead ends: 75 [2022-11-21 16:10:24,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=338, Invalid=2413, Unknown=13, NotChecked=206, Total=2970 [2022-11-21 16:10:24,404 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 117 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 43 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:10:24,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 336 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 518 Invalid, 2 Unknown, 47 Unchecked, 4.1s Time] [2022-11-21 16:10:24,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-21 16:10:24,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 55. [2022-11-21 16:10:24,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 54 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:10:24,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2022-11-21 16:10:24,418 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 27 [2022-11-21 16:10:24,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:10:24,420 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2022-11-21 16:10:24,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 36 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:10:24,420 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2022-11-21 16:10:24,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-21 16:10:24,421 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:10:24,422 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:10:24,434 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-21 16:10:24,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:10:24,634 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:10:24,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:10:24,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1961532986, now seen corresponding path program 2 times [2022-11-21 16:10:24,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:10:24,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790649390] [2022-11-21 16:10:24,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:10:24,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:10:24,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:25,455 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:10:25,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:10:25,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790649390] [2022-11-21 16:10:25,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790649390] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:10:25,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035089884] [2022-11-21 16:10:25,456 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 16:10:25,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:10:25,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:10:25,457 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:10:25,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-21 16:10:25,572 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 16:10:25,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:10:25,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-21 16:10:25,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:10:25,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 16:10:25,648 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 16:10:25,648 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 11 treesize of output 11 [2022-11-21 16:10:25,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:10:25,724 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:10:25,801 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:10:25,825 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 16:10:25,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-11-21 16:10:25,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:10:25,861 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 16:10:25,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2022-11-21 16:10:26,043 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 16:10:26,044 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 92 [2022-11-21 16:10:26,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:10:26,055 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 41 treesize of output 36 [2022-11-21 16:10:26,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 51 [2022-11-21 16:10:26,175 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 16:10:26,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 56 [2022-11-21 16:10:26,203 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-21 16:10:26,204 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 27 treesize of output 32 [2022-11-21 16:10:26,247 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-11-21 16:10:26,248 INFO L350 Elim1Store]: Elim1 eliminated variable 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 36 treesize of output 47 [2022-11-21 16:10:26,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-21 16:10:26,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 47 [2022-11-21 16:10:26,866 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 101 treesize of output 77 [2022-11-21 16:10:26,894 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-11-21 16:10:26,895 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 81 treesize of output 73 [2022-11-21 16:10:27,266 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 16:10:27,266 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 22 treesize of output 14 [2022-11-21 16:10:27,303 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:10:27,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:10:28,331 INFO L321 Elim1Store]: treesize reduction 4, result has 90.0 percent of original size [2022-11-21 16:10:28,332 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 2083 treesize of output 1979 [2022-11-21 16:10:28,371 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:10:28,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1296 treesize of output 1139 [2022-11-21 16:10:30,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-21 16:10:30,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-21 16:10:30,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-21 16:10:30,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-21 16:10:30,806 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse3 (forall ((v_arrayElimArr_23 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (let ((.cse34 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse34 0) (= .cse34 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~a~0#1.base|)))))) (.cse16 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse7 (forall ((v_arrayElimArr_23 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (let ((.cse33 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse33 0) (= .cse33 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)))) (not (= (select v_arrayElimArr_23 .cse0) 0))))) (.cse10 (forall ((v_arrayElimArr_23 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_518 (Array Int Int))) (let ((.cse32 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse32 0) (= .cse32 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse32 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (not (= (select v_arrayElimArr_23 .cse0) 0))))) (.cse11 (forall ((v_arrayElimArr_23 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (let ((.cse31 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse31 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse31 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_71| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (not (= (select v_arrayElimArr_23 .cse0) 0))))) (.cse20 (forall ((v_arrayElimArr_23 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (let ((.cse30 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse30 0) (= .cse30 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse30 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~a~0#1.base|))) (not (= (select v_arrayElimArr_23 .cse0) 0))))) (.cse21 (forall ((v_arrayElimArr_23 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse29 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse29 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_71| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~a~0#1.base|))) (not (= (select v_arrayElimArr_23 .cse0) 0)))))) (and (forall ((v_arrayElimArr_23 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_71| .cse1)))) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_518 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|)))))) .cse3 (or (and (forall ((v_arrayElimArr_23 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse4 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse4 |c_ULTIMATE.start_main_~a~0#1.base|)))))))) (forall ((v_arrayElimArr_23 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse5 0) (not (= .cse5 .cse0))))) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse6 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse6 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse6 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_71| .cse6)))) .cse7 (forall ((v_arrayElimArr_23 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_518 (Array Int Int))) (let ((.cse8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse8 0) (not (= .cse8 .cse0)) (= .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (forall ((v_arrayElimArr_23 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (let ((.cse9 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse9 0) (= .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)))))) .cse10 .cse11 (forall ((v_arrayElimArr_23 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (let ((.cse12 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= .cse12 .cse0)) (= .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_71| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))) (forall ((v_arrayElimArr_23 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse13 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse13 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_71| .cse13)))) (forall ((v_ArrVal_518 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (forall ((v_arrayElimArr_23 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse14 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse14 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_71| .cse14)))) (forall ((v_ArrVal_518 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (not (= (select v_arrayElimArr_23 .cse0) 0)))) (forall ((v_arrayElimArr_23 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse15 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse15 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_71| .cse15)))) (forall ((v_ArrVal_518 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse0))))) (not (= (select v_arrayElimArr_23 .cse0) 0))))) .cse16) (forall ((v_arrayElimArr_23 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (let ((.cse17 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse17 0) (not (= .cse17 .cse0)) (= .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~a~0#1.base|))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse18 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse18 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse18 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_71| .cse18)))) (or (not (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse0)) (and .cse3 (forall ((v_arrayElimArr_23 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)))) (not (= (select v_arrayElimArr_23 .cse0) 0)))) (or .cse16 (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse19 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse19 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_71| .cse19)))) (forall ((v_arrayElimArr_23 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)))) (not (= (select v_arrayElimArr_23 .cse0) 0)))) .cse7 .cse10 .cse11)) .cse20 .cse21 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse22 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse22 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_71| .cse22))))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((v_arrayElimArr_23 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (let ((.cse23 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= .cse23 .cse0)) (= .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_71| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~a~0#1.base|))) (not (= (select v_arrayElimArr_23 .cse0) 0)))) (forall ((v_arrayElimArr_23 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse24 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse24 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse24 |c_ULTIMATE.start_main_~a~0#1.base|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~a~0#1.base|))))) (forall ((v_arrayElimArr_23 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (let ((.cse25 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse25 0) (not (= .cse25 .cse0))))) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~a~0#1.base|))) (not (= (select v_arrayElimArr_23 .cse0) 0)))) (forall ((v_arrayElimArr_23 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse26 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse26 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_71| .cse26)))) (forall ((v_ArrVal_518 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|)) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~a~0#1.base|))) (not (= (select v_arrayElimArr_23 .cse0) 0)))) .cse20 (forall ((v_arrayElimArr_23 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse27 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse27 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_71| .cse27)))) (forall ((v_ArrVal_518 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse0))) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~a~0#1.base|))))) (forall ((v_arrayElimArr_23 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (let ((.cse28 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse28 0) (= .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)))) (not (= (select v_arrayElimArr_23 .cse0) 0)))) .cse21))) is different from false [2022-11-21 16:10:32,942 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:10:32,942 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 25 treesize of output 26 [2022-11-21 16:10:32,952 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:10:32,953 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 51 treesize of output 41 [2022-11-21 16:10:32,959 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:10:32,973 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:10:32,973 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 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-21 16:10:32,985 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:10:32,985 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 20 treesize of output 20 [2022-11-21 16:10:33,019 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:10:33,034 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:10:33,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 54 [2022-11-21 16:10:33,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-11-21 16:10:33,077 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:10:33,077 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 76 treesize of output 56 [2022-11-21 16:10:33,083 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:10:33,100 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:10:33,101 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 1 case distinctions, treesize of input 86 treesize of output 73 [2022-11-21 16:10:33,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2022-11-21 16:10:33,158 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:10:33,159 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 28 treesize of output 1 [2022-11-21 16:10:33,172 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:10:33,172 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 51 treesize of output 1 [2022-11-21 16:10:33,188 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:10:33,189 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 51 treesize of output 1 [2022-11-21 16:10:33,197 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-21 16:10:33,214 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:10:33,215 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 76 treesize of output 56 [2022-11-21 16:10:33,219 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:10:33,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:10:33,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:10:33,225 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 62 [2022-11-21 16:10:33,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-21 16:10:33,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 10 [2022-11-21 16:10:33,253 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:10:33,253 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 76 treesize of output 1 [2022-11-21 16:10:33,267 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:10:33,268 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 54 treesize of output 1 [2022-11-21 16:10:33,275 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-21 16:10:33,286 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:10:33,287 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 79 treesize of output 1 [2022-11-21 16:10:33,300 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:10:33,301 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 25 treesize of output 1 [2022-11-21 16:10:33,314 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:10:33,314 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 54 treesize of output 1 [2022-11-21 16:10:33,729 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-21 16:10:33,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035089884] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:10:33,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:10:33,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 36 [2022-11-21 16:10:33,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143654756] [2022-11-21 16:10:33,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:10:33,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-21 16:10:33,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:10:33,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-21 16:10:33,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1067, Unknown=5, NotChecked=66, Total=1260 [2022-11-21 16:10:33,733 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 36 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:10:37,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:10:39,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:10:48,042 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse3 (forall ((v_arrayElimArr_23 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (let ((.cse42 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse42 0) (= .cse42 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~a~0#1.base|)))))) (.cse7 (forall ((v_arrayElimArr_23 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (let ((.cse41 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse41 0) (= .cse41 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)))) (not (= (select v_arrayElimArr_23 .cse0) 0))))) (.cse10 (forall ((v_arrayElimArr_23 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_518 (Array Int Int))) (let ((.cse40 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse40 0) (= .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse40 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (not (= (select v_arrayElimArr_23 .cse0) 0))))) (.cse11 (forall ((v_arrayElimArr_23 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (let ((.cse39 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse39 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse39 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_71| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (not (= (select v_arrayElimArr_23 .cse0) 0))))) (.cse18 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse21 (forall ((v_arrayElimArr_23 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (let ((.cse38 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse38 0) (= .cse38 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse38 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~a~0#1.base|))) (not (= (select v_arrayElimArr_23 .cse0) 0))))) (.cse24 (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse16 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse22 (forall ((v_arrayElimArr_23 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (let ((.cse37 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse37 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse37 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_71| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~a~0#1.base|))) (not (= (select v_arrayElimArr_23 .cse0) 0))))) (.cse27 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~p~0#1.base|) 1) (forall ((v_arrayElimArr_23 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_71| .cse1)))) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_518 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|)))))) .cse3 (or (and (forall ((v_arrayElimArr_23 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse4 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse4 |c_ULTIMATE.start_main_~a~0#1.base|)))))))) (forall ((v_arrayElimArr_23 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse5 0) (not (= .cse5 .cse0))))) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse6 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse6 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse6 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_71| .cse6)))) .cse7 (forall ((v_arrayElimArr_23 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_518 (Array Int Int))) (let ((.cse8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse8 0) (not (= .cse8 .cse0)) (= .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (forall ((v_arrayElimArr_23 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (let ((.cse9 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse9 0) (= .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)))))) .cse10 .cse11 (forall ((v_arrayElimArr_23 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (let ((.cse12 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= .cse12 .cse0)) (= .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_71| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))) (forall ((v_arrayElimArr_23 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse13 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse13 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_71| .cse13)))) (forall ((v_ArrVal_518 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (forall ((v_arrayElimArr_23 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse14 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse14 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_71| .cse14)))) (forall ((v_ArrVal_518 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (not (= (select v_arrayElimArr_23 .cse0) 0)))) (forall ((v_arrayElimArr_23 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse15 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse15 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_71| .cse15)))) (forall ((v_ArrVal_518 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse0))))) (not (= (select v_arrayElimArr_23 .cse0) 0))))) .cse16) (forall ((v_arrayElimArr_23 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (let ((.cse17 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse17 0) (not (= .cse17 .cse0)) (= .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~a~0#1.base|))))) (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (not (= .cse18 |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse19 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse19 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse19 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_71| .cse19)))) (or (not (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse0)) (and .cse3 (forall ((v_arrayElimArr_23 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)))) (not (= (select v_arrayElimArr_23 .cse0) 0)))) (or .cse16 (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse20 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse20 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_71| .cse20)))) (forall ((v_arrayElimArr_23 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)))) (not (= (select v_arrayElimArr_23 .cse0) 0)))) .cse7 .cse10 .cse11)) .cse21 .cse22 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse23 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse23 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_71| .cse23))))) .cse24) (forall ((v_arrayElimArr_23 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (let ((.cse25 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= .cse25 .cse0)) (= .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_71| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~a~0#1.base|))) (not (= (select v_arrayElimArr_23 .cse0) 0)))) (forall ((v_arrayElimArr_23 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse26 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse26 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse26 |c_ULTIMATE.start_main_~a~0#1.base|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~a~0#1.base|))))) (= .cse27 0) (= .cse18 |c_ULTIMATE.start_main_~p~0#1.base|) (forall ((v_arrayElimArr_23 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (let ((.cse28 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse28 0) (not (= .cse28 .cse0))))) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~a~0#1.base|))) (not (= (select v_arrayElimArr_23 .cse0) 0)))) (forall ((v_arrayElimArr_23 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse29 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_71| .cse29)))) (forall ((v_ArrVal_518 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|)) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~a~0#1.base|))) (not (= (select v_arrayElimArr_23 .cse0) 0)))) .cse21 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int)) (v_ArrVal_518 (Array Int Int)) (v_ArrVal_513 Int)) (let ((.cse30 (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 v_ArrVal_513)))) (store .cse32 |v_ULTIMATE.start_main_~p~0#1.base_71| (store (select .cse32 |v_ULTIMATE.start_main_~p~0#1.base_71|) 0 3))))) (let ((.cse31 (select (select .cse30 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 0)) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))) (or (not (= (select (select .cse30 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (= 3 .cse31) (= 2 .cse31))))) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse34 (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)))) (or (forall ((v_ArrVal_516 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse33 (select (select .cse34 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))) (or (= .cse33 3) (= .cse33 2)))) (not (= 2 (select (select .cse34 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) .cse24 (forall ((v_arrayElimArr_23 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse35 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse35 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_71| .cse35)))) (forall ((v_ArrVal_518 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse0))) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~a~0#1.base|))))) (forall ((v_arrayElimArr_23 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (let ((.cse36 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse36 0) (= .cse36 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)))) (not (= (select v_arrayElimArr_23 .cse0) 0)))) .cse16 .cse22 (= .cse27 |c_ULTIMATE.start_main_~p~0#1.offset|)))) is different from false [2022-11-21 16:10:51,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:10:51,617 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2022-11-21 16:10:51,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-21 16:10:51,618 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 36 states have internal predecessors, (70), 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 27 [2022-11-21 16:10:51,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:10:51,619 INFO L225 Difference]: With dead ends: 85 [2022-11-21 16:10:51,619 INFO L226 Difference]: Without dead ends: 81 [2022-11-21 16:10:51,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=338, Invalid=2420, Unknown=6, NotChecked=206, Total=2970 [2022-11-21 16:10:51,621 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 107 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 37 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:10:51,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 383 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 580 Invalid, 9 Unknown, 44 Unchecked, 5.1s Time] [2022-11-21 16:10:51,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-21 16:10:51,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 65. [2022-11-21 16:10:51,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.109375) internal successors, (71), 64 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-21 16:10:51,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2022-11-21 16:10:51,631 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 27 [2022-11-21 16:10:51,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:10:51,631 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2022-11-21 16:10:51,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 36 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:10:51,632 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-11-21 16:10:51,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-21 16:10:51,633 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:10:51,633 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:10:51,643 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-21 16:10:51,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-21 16:10:51,840 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:10:51,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:10:51,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1736025984, now seen corresponding path program 4 times [2022-11-21 16:10:51,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:10:51,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413457537] [2022-11-21 16:10:51,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:10:51,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:10:51,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:53,178 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-21 16:10:53,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:10:53,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413457537] [2022-11-21 16:10:53,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413457537] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:10:53,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491343674] [2022-11-21 16:10:53,179 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-21 16:10:53,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:10:53,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:10:53,181 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:10:53,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-21 16:10:53,369 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-21 16:10:53,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:10:53,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-21 16:10:53,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:10:53,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 16:10:53,489 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 16:10:53,489 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 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-21 16:10:53,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:10:53,603 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:10:53,734 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 16:10:53,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-11-21 16:10:53,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:10:53,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 16:10:53,801 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-21 16:10:53,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 22 [2022-11-21 16:10:53,920 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-21 16:10:53,921 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 75 [2022-11-21 16:10:53,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 82 [2022-11-21 16:10:54,092 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-21 16:10:54,093 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 117 [2022-11-21 16:10:54,127 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-21 16:10:54,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 114 treesize of output 112 [2022-11-21 16:10:54,143 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 53 treesize of output 35 [2022-11-21 16:10:54,368 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-21 16:10:54,368 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 49 [2022-11-21 16:10:54,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2022-11-21 16:10:54,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 16:10:54,393 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-21 16:10:54,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:10:54,520 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 187 treesize of output 129 [2022-11-21 16:10:54,747 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse4 |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|))) (and (forall ((v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_79| Int)) (= (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_606))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse3 .cse4 |v_ULTIMATE.start_main_~p~0#1.offset_79|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_607) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)) |c_ULTIMATE.start_main_~t~0#1.base|)) (forall ((v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_79| Int)) (= |v_ULTIMATE.start_main_~p~0#1.offset_79| (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse3 .cse4 |v_ULTIMATE.start_main_~p~0#1.offset_79|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_607))) (select (select .cse5 (select (select (store .cse2 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_606) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (+ (select (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)))))))) is different from false [2022-11-21 16:10:54,940 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:10:54,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 58 [2022-11-21 16:10:54,950 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:10:54,951 INFO L350 Elim1Store]: Elim1 eliminated variable 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 1 case distinctions, treesize of input 49 treesize of output 48 [2022-11-21 16:10:54,971 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:10:54,971 INFO L350 Elim1Store]: Elim1 eliminated variable 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 1 case distinctions, treesize of input 54 treesize of output 58 [2022-11-21 16:10:54,981 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:10:54,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 60 [2022-11-21 16:10:55,240 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:10:55,241 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 85 treesize of output 86 [2022-11-21 16:10:55,251 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:10:55,251 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 75 treesize of output 66 [2022-11-21 16:10:55,364 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:10:55,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 2718 treesize of output 1887 [2022-11-21 16:10:55,421 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:10:55,422 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 5774 treesize of output 5407 [2022-11-21 16:10:55,511 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:10:55,512 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 5402 treesize of output 3766 [2022-11-21 16:10:55,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3752 treesize of output 3256 [2022-11-21 16:10:55,658 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:10:55,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 3070 treesize of output 3008 [2022-11-21 16:10:55,868 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:10:55,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 2982 treesize of output 2896 [2022-11-21 16:15:55,225 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:15:55,225 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 85 treesize of output 86 [2022-11-21 16:15:55,234 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:15:55,234 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 99 treesize of output 90 [2022-11-21 16:15:55,250 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:15:55,251 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 332 treesize of output 235 [2022-11-21 16:15:55,258 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:15:55,803 INFO L321 Elim1Store]: treesize reduction 122, result has 72.1 percent of original size [2022-11-21 16:15:55,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 1232 treesize of output 1289 [2022-11-21 16:15:55,944 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:15:55,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1118 treesize of output 842 [2022-11-21 16:15:55,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 786 treesize of output 722 [2022-11-21 16:15:56,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 461 treesize of output 405 [2022-11-21 16:15:56,102 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:15:56,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 594 treesize of output 586 [2022-11-21 16:16:02,363 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-21 16:16:02,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491343674] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:16:02,363 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:16:02,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 28 [2022-11-21 16:16:02,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652554585] [2022-11-21 16:16:02,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:16:02,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-21 16:16:02,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:16:02,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-21 16:16:02,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=615, Unknown=15, NotChecked=50, Total=756 [2022-11-21 16:16:02,366 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 28 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 28 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:16:10,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:16:10,620 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2022-11-21 16:16:10,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-21 16:16:10,620 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 28 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-21 16:16:10,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:16:10,621 INFO L225 Difference]: With dead ends: 85 [2022-11-21 16:16:10,622 INFO L226 Difference]: Without dead ends: 81 [2022-11-21 16:16:10,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=195, Invalid=1353, Unknown=16, NotChecked=76, Total=1640 [2022-11-21 16:16:10,623 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 108 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:16:10,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 236 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 605 Invalid, 0 Unknown, 51 Unchecked, 1.0s Time] [2022-11-21 16:16:10,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-21 16:16:10,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 69. [2022-11-21 16:16:10,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:16:10,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2022-11-21 16:16:10,639 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 29 [2022-11-21 16:16:10,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:16:10,639 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2022-11-21 16:16:10,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 28 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:16:10,639 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2022-11-21 16:16:10,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-21 16:16:10,640 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:16:10,640 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:16:10,651 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-21 16:16:10,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-21 16:16:10,847 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:16:10,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:16:10,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1908036315, now seen corresponding path program 5 times [2022-11-21 16:16:10,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:16:10,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708369525] [2022-11-21 16:16:10,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:16:10,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:16:10,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:12,092 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:16:12,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:16:12,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708369525] [2022-11-21 16:16:12,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708369525] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:16:12,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152746897] [2022-11-21 16:16:12,093 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-21 16:16:12,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:16:12,093 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:16:12,095 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:16:12,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-21 16:16:12,270 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-11-21 16:16:12,271 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:16:12,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-21 16:16:12,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:16:12,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 16:16:12,389 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 16:16:12,389 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 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-21 16:16:12,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:16:12,521 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:16:12,666 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 16:16:12,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-11-21 16:16:12,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:16:12,687 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 21 treesize of output 21 [2022-11-21 16:16:12,739 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-21 16:16:12,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 22 [2022-11-21 16:16:12,874 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:16:12,890 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-21 16:16:12,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 75 [2022-11-21 16:16:12,898 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 85 [2022-11-21 16:16:13,096 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-21 16:16:13,096 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 151 treesize of output 126 [2022-11-21 16:16:13,134 INFO L321 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-11-21 16:16:13,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 126 [2022-11-21 16:16:13,142 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 53 treesize of output 35 [2022-11-21 16:16:13,544 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:16:13,554 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 16:16:13,554 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 58 [2022-11-21 16:16:13,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 22 [2022-11-21 16:16:13,646 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 16:16:13,647 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 22 treesize of output 14 [2022-11-21 16:16:13,692 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:16:13,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:16:13,908 INFO L321 Elim1Store]: treesize reduction 64, result has 1.5 percent of original size [2022-11-21 16:16:13,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 139 treesize of output 77 [2022-11-21 16:16:18,653 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:16:18,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 58 [2022-11-21 16:16:18,664 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:16:18,665 INFO L350 Elim1Store]: Elim1 eliminated variable 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 1 case distinctions, treesize of input 61 treesize of output 60 [2022-11-21 16:16:18,694 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:16:18,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2022-11-21 16:16:18,704 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:16:18,705 INFO L350 Elim1Store]: Elim1 eliminated variable 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 1 case distinctions, treesize of input 60 treesize of output 64 [2022-11-21 16:16:18,737 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:16:18,739 INFO L350 Elim1Store]: Elim1 eliminated variable 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 1 case distinctions, treesize of input 54 treesize of output 58 [2022-11-21 16:16:18,749 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:16:18,750 INFO L350 Elim1Store]: Elim1 eliminated variable 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 1 case distinctions, treesize of input 61 treesize of output 60 [2022-11-21 16:16:18,773 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:16:18,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2022-11-21 16:16:18,783 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:16:18,784 INFO L350 Elim1Store]: Elim1 eliminated variable 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 1 case distinctions, treesize of input 60 treesize of output 64 [2022-11-21 16:16:19,451 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:16:19,452 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 85 treesize of output 86 [2022-11-21 16:16:19,462 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:16:19,462 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 75 treesize of output 66 [2022-11-21 16:16:19,467 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:16:19,482 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:16:19,483 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 1 case distinctions, treesize of input 108 treesize of output 107 [2022-11-21 16:16:19,490 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:16:19,912 INFO L321 Elim1Store]: treesize reduction 38, result has 82.6 percent of original size [2022-11-21 16:16:19,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 598 treesize of output 651 [2022-11-21 16:16:20,033 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:16:20,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 573 treesize of output 437 [2022-11-21 16:16:20,080 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:16:20,080 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 282 treesize of output 242 [2022-11-21 16:16:20,141 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:16:20,141 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 292 treesize of output 284 [2022-11-21 16:16:38,067 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:16:38,068 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 81 treesize of output 82 [2022-11-21 16:16:38,079 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:16:38,080 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 71 treesize of output 62 [2022-11-21 16:16:38,086 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:16:38,103 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:16:38,103 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 1 case distinctions, treesize of input 100 treesize of output 99 [2022-11-21 16:16:38,111 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:16:38,485 INFO L321 Elim1Store]: treesize reduction 42, result has 82.1 percent of original size [2022-11-21 16:16:38,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 480 treesize of output 583 [2022-11-21 16:16:38,596 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:16:38,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 478 treesize of output 476 [2022-11-21 16:16:38,689 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:16:38,689 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 439 treesize of output 303 [2022-11-21 16:16:38,733 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:16:38,733 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 214 treesize of output 206 [2022-11-21 16:16:53,341 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:16:53,341 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 85 treesize of output 86 [2022-11-21 16:16:53,354 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:16:53,354 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 75 treesize of output 66 [2022-11-21 16:16:53,382 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:16:53,382 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 230 treesize of output 229 [2022-11-21 16:16:54,720 INFO L321 Elim1Store]: treesize reduction 390, result has 58.3 percent of original size [2022-11-21 16:16:54,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 12 new quantified variables, introduced 55 case distinctions, treesize of input 2888 treesize of output 3071 [2022-11-21 16:16:54,968 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:16:54,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 2718 treesize of output 1822 [2022-11-21 16:16:55,118 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:16:55,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1740 treesize of output 1516 [2022-11-21 16:16:55,219 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:16:55,220 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 275 treesize of output 203 [2022-11-21 16:16:55,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 247 treesize of output 171 [2022-11-21 16:20:26,636 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:20:26,637 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 81 treesize of output 82 [2022-11-21 16:20:26,647 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:20:26,647 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 71 treesize of output 62 [2022-11-21 16:20:26,653 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:20:26,669 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:20:26,669 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 100 treesize of output 99 [2022-11-21 16:20:26,675 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:20:27,001 INFO L321 Elim1Store]: treesize reduction 42, result has 82.1 percent of original size [2022-11-21 16:20:27,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 748 treesize of output 803 [2022-11-21 16:20:27,044 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:20:27,045 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 694 treesize of output 482 [2022-11-21 16:20:27,139 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:20:27,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 492 treesize of output 472 [2022-11-21 16:20:27,199 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:20:27,200 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 326 treesize of output 310 [2022-11-21 16:20:47,997 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:20:47,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152746897] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:20:47,998 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:20:47,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 32 [2022-11-21 16:20:47,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537944830] [2022-11-21 16:20:47,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:20:47,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-21 16:20:47,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:20:48,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-21 16:20:48,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=878, Unknown=1, NotChecked=0, Total=992 [2022-11-21 16:20:48,000 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 32 states, 32 states have (on average 2.28125) internal successors, (73), 32 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:20:49,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:20:49,959 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2022-11-21 16:20:49,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-21 16:20:49,959 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.28125) internal successors, (73), 32 states have internal predecessors, (73), 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 31 [2022-11-21 16:20:49,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:20:49,960 INFO L225 Difference]: With dead ends: 87 [2022-11-21 16:20:49,960 INFO L226 Difference]: Without dead ends: 73 [2022-11-21 16:20:49,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=280, Invalid=1880, Unknown=2, NotChecked=0, Total=2162 [2022-11-21 16:20:49,962 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 181 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 35 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:20:49,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 221 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 532 Invalid, 9 Unknown, 0 Unchecked, 1.1s Time] [2022-11-21 16:20:49,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-21 16:20:49,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 63. [2022-11-21 16:20:49,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.096774193548387) internal successors, (68), 62 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:20:49,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2022-11-21 16:20:49,972 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 31 [2022-11-21 16:20:49,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:20:49,973 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2022-11-21 16:20:49,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.28125) internal successors, (73), 32 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:20:49,973 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2022-11-21 16:20:49,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-21 16:20:49,974 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:20:49,974 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:20:49,986 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-21 16:20:50,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-21 16:20:50,180 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:20:50,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:20:50,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1934558864, now seen corresponding path program 3 times [2022-11-21 16:20:50,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:20:50,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585555157] [2022-11-21 16:20:50,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:20:50,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:20:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:20:51,225 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:20:51,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:20:51,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585555157] [2022-11-21 16:20:51,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585555157] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:20:51,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162715584] [2022-11-21 16:20:51,226 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 16:20:51,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:20:51,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:20:51,227 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:20:51,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e3f38a-1421-47c9-8a0d-37b7a644bb7e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-21 16:20:51,394 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-21 16:20:51,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:20:51,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-21 16:20:51,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:20:51,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 16:20:51,484 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 16:20:51,484 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 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-21 16:20:51,553 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:20:51,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:20:51,655 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 16:20:51,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-11-21 16:20:51,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:20:51,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 16:20:51,702 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-21 16:20:51,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 22 [2022-11-21 16:20:51,798 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-21 16:20:51,798 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 75 [2022-11-21 16:20:51,805 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 82 [2022-11-21 16:20:51,941 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-21 16:20:51,941 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 159 treesize of output 132 [2022-11-21 16:20:51,965 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-21 16:20:51,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 131 treesize of output 121 [2022-11-21 16:20:51,978 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 53 treesize of output 35 [2022-11-21 16:20:52,179 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-21 16:20:52,179 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 62 [2022-11-21 16:20:52,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 19 [2022-11-21 16:20:52,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 16:20:52,227 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:20:52,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:20:52,394 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 66 [2022-11-21 16:20:52,405 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_782 (Array Int Int)) (v_ArrVal_783 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_783))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_782) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (+ 4 (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_ArrVal_782 (Array Int Int)) (v_ArrVal_783 (Array Int Int))) (= (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_782))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_783) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2022-11-21 16:20:52,440 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse5 |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse5 |c_ULTIMATE.start_main_~t~0#1.offset|))) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_782 (Array Int Int)) (v_ArrVal_783 (Array Int Int))) (= |c_ULTIMATE.start_main_~t~0#1.offset| (let ((.cse0 (store .cse3 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_783))) (select (select .cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_782) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4))))) (forall ((v_ArrVal_782 (Array Int Int)) (v_ArrVal_783 (Array Int Int))) (= |c_ULTIMATE.start_main_~t~0#1.base| (select (let ((.cse4 (store .cse1 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_782))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_783) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4))))))) is different from false [2022-11-21 16:20:52,605 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:20:52,605 INFO L350 Elim1Store]: Elim1 eliminated variable 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 1 case distinctions, treesize of input 54 treesize of output 53 [2022-11-21 16:20:52,612 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:20:52,613 INFO L350 Elim1Store]: Elim1 eliminated variable 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 1 case distinctions, treesize of input 60 treesize of output 64 [2022-11-21 16:20:52,630 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:20:52,631 INFO L350 Elim1Store]: Elim1 eliminated variable 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 1 case distinctions, treesize of input 54 treesize of output 58 [2022-11-21 16:20:52,639 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:20:52,639 INFO L350 Elim1Store]: Elim1 eliminated variable 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 1 case distinctions, treesize of input 61 treesize of output 60 [2022-11-21 16:20:52,923 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:20:52,923 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 81 treesize of output 82 [2022-11-21 16:20:52,932 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:20:52,932 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 71 treesize of output 62 [2022-11-21 16:20:53,043 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:20:53,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 4784 treesize of output 3351 [2022-11-21 16:20:53,098 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:20:53,098 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 10754 treesize of output 10051 [2022-11-21 16:20:53,211 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:20:53,211 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 10046 treesize of output 6898 [2022-11-21 16:20:53,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6884 treesize of output 5940 [2022-11-21 16:20:53,431 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:20:53,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 5762 treesize of output 5720 [2022-11-21 16:20:53,618 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:20:53,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 5654 treesize of output 5522 [2022-11-21 16:23:40,018 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:23:40,019 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 85 treesize of output 86 [2022-11-21 16:23:40,028 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:23:40,028 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 99 treesize of output 90 [2022-11-21 16:23:40,046 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:23:40,047 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 346 treesize of output 243 [2022-11-21 16:23:40,054 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:23:40,616 INFO L321 Elim1Store]: treesize reduction 122, result has 72.1 percent of original size [2022-11-21 16:23:40,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 2568 treesize of output 2321 [2022-11-21 16:23:40,785 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:23:40,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 2150 treesize of output 1574 [2022-11-21 16:23:40,847 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:23:40,848 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 859 treesize of output 799 [2022-11-21 16:23:40,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1490 treesize of output 1410 [2022-11-21 16:23:41,016 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:23:41,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1302 treesize of output 1262