./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/heap-manipulation/dancing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a 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_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/dancing.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a --- 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-5e519f3 [2022-11-02 20:53:20,554 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:53:20,557 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:53:20,602 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:53:20,603 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:53:20,604 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:53:20,605 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:53:20,607 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:53:20,608 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:53:20,609 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:53:20,610 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:53:20,611 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:53:20,612 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:53:20,613 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:53:20,616 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:53:20,618 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:53:20,620 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:53:20,624 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:53:20,626 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:53:20,631 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:53:20,632 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:53:20,637 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:53:20,638 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:53:20,639 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:53:20,642 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:53:20,643 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:53:20,643 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:53:20,644 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:53:20,644 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:53:20,645 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:53:20,645 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:53:20,646 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:53:20,646 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:53:20,647 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:53:20,648 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:53:20,648 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:53:20,649 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:53:20,655 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:53:20,656 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:53:20,656 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:53:20,657 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:53:20,658 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-02 20:53:20,699 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:53:20,699 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:53:20,700 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:53:20,700 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:53:20,701 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:53:20,701 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:53:20,702 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:53:20,702 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:53:20,702 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:53:20,702 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:53:20,703 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:53:20,704 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:53:20,704 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:53:20,704 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:53:20,704 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:53:20,704 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-02 20:53:20,704 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-02 20:53:20,705 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-02 20:53:20,705 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:53:20,705 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 20:53:20,705 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:53:20,705 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:53:20,706 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:53:20,706 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:53:20,706 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:53:20,706 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:53:20,708 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:53:20,708 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:53:20,708 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:53:20,708 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:53:20,708 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_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/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_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a [2022-11-02 20:53:20,960 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:53:21,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:53:21,003 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:53:21,005 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:53:21,006 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:53:21,007 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/heap-manipulation/dancing.i [2022-11-02 20:53:21,076 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/data/1acff286c/896d820c4c024d1ebefb8496acfd38cd/FLAG10931d431 [2022-11-02 20:53:21,670 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:53:21,675 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/sv-benchmarks/c/heap-manipulation/dancing.i [2022-11-02 20:53:21,690 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/data/1acff286c/896d820c4c024d1ebefb8496acfd38cd/FLAG10931d431 [2022-11-02 20:53:21,938 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/data/1acff286c/896d820c4c024d1ebefb8496acfd38cd [2022-11-02 20:53:21,942 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:53:21,944 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:53:21,947 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:53:21,947 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:53:21,951 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:53:21,952 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:53:21" (1/1) ... [2022-11-02 20:53:21,953 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f455d6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:21, skipping insertion in model container [2022-11-02 20:53:21,953 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:53:21" (1/1) ... [2022-11-02 20:53:21,962 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:53:22,018 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:53:22,211 WARN L230 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_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/sv-benchmarks/c/heap-manipulation/dancing.i[938,951] [2022-11-02 20:53:22,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:53:22,325 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:53:22,337 WARN L230 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_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/sv-benchmarks/c/heap-manipulation/dancing.i[938,951] [2022-11-02 20:53:22,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:53:22,402 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:53:22,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:22 WrapperNode [2022-11-02 20:53:22,404 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:53:22,405 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:53:22,406 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:53:22,406 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:53:22,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:22" (1/1) ... [2022-11-02 20:53:22,451 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:22" (1/1) ... [2022-11-02 20:53:22,470 INFO L138 Inliner]: procedures = 124, calls = 40, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 90 [2022-11-02 20:53:22,471 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:53:22,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:53:22,472 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:53:22,472 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:53:22,481 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:22" (1/1) ... [2022-11-02 20:53:22,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:22" (1/1) ... [2022-11-02 20:53:22,485 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:22" (1/1) ... [2022-11-02 20:53:22,485 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:22" (1/1) ... [2022-11-02 20:53:22,493 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:22" (1/1) ... [2022-11-02 20:53:22,496 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:22" (1/1) ... [2022-11-02 20:53:22,498 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:22" (1/1) ... [2022-11-02 20:53:22,500 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:22" (1/1) ... [2022-11-02 20:53:22,502 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:53:22,503 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:53:22,503 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:53:22,504 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:53:22,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:22" (1/1) ... [2022-11-02 20:53:22,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:53:22,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:22,540 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:53:22,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:53:22,584 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2022-11-02 20:53:22,584 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2022-11-02 20:53:22,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-02 20:53:22,584 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-02 20:53:22,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:53:22,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:53:22,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:53:22,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:53:22,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:53:22,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:53:22,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:53:22,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:53:22,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:53:22,696 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:53:22,698 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:53:23,201 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:53:23,209 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:53:23,209 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 20:53:23,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:53:23 BoogieIcfgContainer [2022-11-02 20:53:23,212 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:53:23,214 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:53:23,215 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:53:23,218 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:53:23,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:53:21" (1/3) ... [2022-11-02 20:53:23,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76d86cc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:53:23, skipping insertion in model container [2022-11-02 20:53:23,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:22" (2/3) ... [2022-11-02 20:53:23,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76d86cc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:53:23, skipping insertion in model container [2022-11-02 20:53:23,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:53:23" (3/3) ... [2022-11-02 20:53:23,221 INFO L112 eAbstractionObserver]: Analyzing ICFG dancing.i [2022-11-02 20:53:23,241 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:53:23,241 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2022-11-02 20:53:23,286 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:53:23,293 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@24d27029, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:53:23,293 INFO L358 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2022-11-02 20:53:23,297 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 55 states have (on average 2.036363636363636) internal successors, (112), 99 states have internal predecessors, (112), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:53:23,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:53:23,304 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:23,304 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:53:23,305 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-02 20:53:23,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:23,310 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-11-02 20:53:23,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:23,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212937831] [2022-11-02 20:53:23,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:23,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:23,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:23,493 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-02 20:53:23,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:23,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212937831] [2022-11-02 20:53:23,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212937831] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:23,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:23,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:53:23,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548669779] [2022-11-02 20:53:23,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:23,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:53:23,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:23,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:53:23,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:53:23,552 INFO L87 Difference]: Start difference. First operand has 108 states, 55 states have (on average 2.036363636363636) internal successors, (112), 99 states have internal predecessors, (112), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-02 20:53:23,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:23,701 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2022-11-02 20:53:23,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:53:23,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2022-11-02 20:53:23,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:23,712 INFO L225 Difference]: With dead ends: 106 [2022-11-02 20:53:23,712 INFO L226 Difference]: Without dead ends: 104 [2022-11-02 20:53:23,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-02 20:53:23,717 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 82 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:23,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 94 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:53:23,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-02 20:53:23,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-11-02 20:53:23,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 54 states have (on average 1.9444444444444444) internal successors, (105), 95 states have internal predecessors, (105), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:53:23,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 117 transitions. [2022-11-02 20:53:23,756 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 117 transitions. Word has length 3 [2022-11-02 20:53:23,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:23,757 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 117 transitions. [2022-11-02 20:53:23,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-02 20:53:23,757 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2022-11-02 20:53:23,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:53:23,758 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:23,758 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:53:23,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:53:23,759 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-02 20:53:23,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:23,759 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-11-02 20:53:23,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:23,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960669283] [2022-11-02 20:53:23,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:23,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:23,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:23,847 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-02 20:53:23,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:23,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960669283] [2022-11-02 20:53:23,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960669283] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:23,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:23,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:53:23,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384916311] [2022-11-02 20:53:23,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:23,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:53:23,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:23,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:53:23,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:53:23,851 INFO L87 Difference]: Start difference. First operand 104 states and 117 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-02 20:53:23,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:23,947 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2022-11-02 20:53:23,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:53:23,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2022-11-02 20:53:23,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:23,948 INFO L225 Difference]: With dead ends: 102 [2022-11-02 20:53:23,949 INFO L226 Difference]: Without dead ends: 102 [2022-11-02 20:53:23,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-02 20:53:23,950 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 80 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:23,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 92 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:53:23,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-02 20:53:23,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-11-02 20:53:23,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 93 states have internal predecessors, (103), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:53:23,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2022-11-02 20:53:23,961 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 3 [2022-11-02 20:53:23,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:23,961 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2022-11-02 20:53:23,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-02 20:53:23,962 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2022-11-02 20:53:23,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-02 20:53:23,962 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:23,962 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:23,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:53:23,963 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-02 20:53:23,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:23,964 INFO L85 PathProgramCache]: Analyzing trace with hash 59267633, now seen corresponding path program 1 times [2022-11-02 20:53:23,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:23,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725014632] [2022-11-02 20:53:23,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:23,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:24,120 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-02 20:53:24,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:24,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725014632] [2022-11-02 20:53:24,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725014632] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:24,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:24,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:53:24,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278537744] [2022-11-02 20:53:24,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:24,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:53:24,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:24,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:53:24,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:53:24,123 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:24,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:24,288 INFO L93 Difference]: Finished difference Result 165 states and 189 transitions. [2022-11-02 20:53:24,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:53:24,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-02 20:53:24,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:24,294 INFO L225 Difference]: With dead ends: 165 [2022-11-02 20:53:24,294 INFO L226 Difference]: Without dead ends: 165 [2022-11-02 20:53:24,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-02 20:53:24,301 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 74 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:24,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 213 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:53:24,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-11-02 20:53:24,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 100. [2022-11-02 20:53:24,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 54 states have (on average 1.8703703703703705) internal successors, (101), 91 states have internal predecessors, (101), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:53:24,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2022-11-02 20:53:24,312 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 8 [2022-11-02 20:53:24,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:24,316 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2022-11-02 20:53:24,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:24,317 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2022-11-02 20:53:24,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-02 20:53:24,318 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:24,318 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:24,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:53:24,319 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-02 20:53:24,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:24,323 INFO L85 PathProgramCache]: Analyzing trace with hash 59267634, now seen corresponding path program 1 times [2022-11-02 20:53:24,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:24,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024254472] [2022-11-02 20:53:24,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:24,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:24,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:24,554 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-02 20:53:24,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:24,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024254472] [2022-11-02 20:53:24,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024254472] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:24,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:24,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:53:24,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462406140] [2022-11-02 20:53:24,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:24,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:53:24,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:24,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:53:24,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:53:24,557 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:24,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:24,718 INFO L93 Difference]: Finished difference Result 165 states and 188 transitions. [2022-11-02 20:53:24,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:53:24,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-02 20:53:24,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:24,720 INFO L225 Difference]: With dead ends: 165 [2022-11-02 20:53:24,721 INFO L226 Difference]: Without dead ends: 165 [2022-11-02 20:53:24,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-02 20:53:24,723 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 74 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:24,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 217 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:53:24,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-11-02 20:53:24,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 98. [2022-11-02 20:53:24,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 89 states have internal predecessors, (99), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:53:24,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2022-11-02 20:53:24,765 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 8 [2022-11-02 20:53:24,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:24,765 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2022-11-02 20:53:24,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:24,765 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2022-11-02 20:53:24,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-02 20:53:24,766 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:24,766 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:24,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:53:24,767 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-02 20:53:24,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:24,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1124238034, now seen corresponding path program 1 times [2022-11-02 20:53:24,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:24,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314926337] [2022-11-02 20:53:24,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:24,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:24,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:24,942 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-02 20:53:24,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:24,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314926337] [2022-11-02 20:53:24,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314926337] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:24,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:24,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:53:24,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880612822] [2022-11-02 20:53:24,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:24,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:53:24,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:24,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:53:24,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:53:24,946 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:25,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:25,028 INFO L93 Difference]: Finished difference Result 176 states and 204 transitions. [2022-11-02 20:53:25,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:53:25,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-02 20:53:25,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:25,031 INFO L225 Difference]: With dead ends: 176 [2022-11-02 20:53:25,032 INFO L226 Difference]: Without dead ends: 176 [2022-11-02 20:53:25,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:53:25,033 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 78 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:25,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 403 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:53:25,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-11-02 20:53:25,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 142. [2022-11-02 20:53:25,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 93 states have (on average 1.89247311827957) internal successors, (176), 129 states have internal predecessors, (176), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-02 20:53:25,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 196 transitions. [2022-11-02 20:53:25,046 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 196 transitions. Word has length 10 [2022-11-02 20:53:25,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:25,047 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 196 transitions. [2022-11-02 20:53:25,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:25,047 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 196 transitions. [2022-11-02 20:53:25,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-02 20:53:25,048 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:25,048 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:25,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:53:25,048 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-02 20:53:25,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:25,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1121620373, now seen corresponding path program 1 times [2022-11-02 20:53:25,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:25,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256406511] [2022-11-02 20:53:25,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:25,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:25,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:25,281 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-02 20:53:25,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:25,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256406511] [2022-11-02 20:53:25,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256406511] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:25,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:25,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:53:25,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945285094] [2022-11-02 20:53:25,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:25,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:53:25,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:25,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:53:25,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:53:25,284 INFO L87 Difference]: Start difference. First operand 142 states and 196 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:25,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:25,467 INFO L93 Difference]: Finished difference Result 140 states and 192 transitions. [2022-11-02 20:53:25,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:53:25,468 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-02 20:53:25,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:25,470 INFO L225 Difference]: With dead ends: 140 [2022-11-02 20:53:25,470 INFO L226 Difference]: Without dead ends: 140 [2022-11-02 20:53:25,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:53:25,473 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 218 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:25,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 105 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:53:25,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-11-02 20:53:25,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2022-11-02 20:53:25,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 93 states have (on average 1.8494623655913978) internal successors, (172), 127 states have internal predecessors, (172), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-02 20:53:25,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 192 transitions. [2022-11-02 20:53:25,499 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 192 transitions. Word has length 10 [2022-11-02 20:53:25,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:25,499 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 192 transitions. [2022-11-02 20:53:25,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:25,500 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 192 transitions. [2022-11-02 20:53:25,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 20:53:25,501 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:25,501 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:25,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:53:25,502 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-02 20:53:25,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:25,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1910990355, now seen corresponding path program 1 times [2022-11-02 20:53:25,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:25,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392876267] [2022-11-02 20:53:25,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:25,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:25,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:25,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:53:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:25,642 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-02 20:53:25,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:25,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392876267] [2022-11-02 20:53:25,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392876267] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:25,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:25,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:53:25,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316296607] [2022-11-02 20:53:25,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:25,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:53:25,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:25,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:53:25,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:53:25,645 INFO L87 Difference]: Start difference. First operand 140 states and 192 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:53:25,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:25,923 INFO L93 Difference]: Finished difference Result 159 states and 184 transitions. [2022-11-02 20:53:25,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:53:25,925 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-11-02 20:53:25,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:25,926 INFO L225 Difference]: With dead ends: 159 [2022-11-02 20:53:25,926 INFO L226 Difference]: Without dead ends: 159 [2022-11-02 20:53:25,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:53:25,928 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 238 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:25,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 203 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:53:25,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-11-02 20:53:25,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 135. [2022-11-02 20:53:25,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 93 states have (on average 1.7311827956989247) internal successors, (161), 122 states have internal predecessors, (161), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-02 20:53:25,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 181 transitions. [2022-11-02 20:53:25,949 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 181 transitions. Word has length 15 [2022-11-02 20:53:25,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:25,950 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 181 transitions. [2022-11-02 20:53:25,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:53:25,950 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 181 transitions. [2022-11-02 20:53:25,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 20:53:25,951 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:25,952 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:25,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:53:25,952 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-02 20:53:25,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:25,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1910990356, now seen corresponding path program 1 times [2022-11-02 20:53:25,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:25,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165826559] [2022-11-02 20:53:25,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:25,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:25,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:26,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:53:26,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:26,186 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-02 20:53:26,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:26,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165826559] [2022-11-02 20:53:26,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165826559] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:26,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:26,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:53:26,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539144798] [2022-11-02 20:53:26,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:26,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:53:26,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:26,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:53:26,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:53:26,189 INFO L87 Difference]: Start difference. First operand 135 states and 181 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:53:26,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:26,458 INFO L93 Difference]: Finished difference Result 155 states and 179 transitions. [2022-11-02 20:53:26,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:53:26,458 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-11-02 20:53:26,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:26,460 INFO L225 Difference]: With dead ends: 155 [2022-11-02 20:53:26,460 INFO L226 Difference]: Without dead ends: 155 [2022-11-02 20:53:26,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:53:26,461 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 288 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:26,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 186 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:53:26,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-11-02 20:53:26,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 135. [2022-11-02 20:53:26,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 93 states have (on average 1.6666666666666667) internal successors, (155), 122 states have internal predecessors, (155), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-02 20:53:26,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 175 transitions. [2022-11-02 20:53:26,471 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 175 transitions. Word has length 15 [2022-11-02 20:53:26,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:26,471 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 175 transitions. [2022-11-02 20:53:26,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:53:26,472 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 175 transitions. [2022-11-02 20:53:26,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:53:26,473 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:26,473 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:26,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:53:26,474 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-02 20:53:26,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:26,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1007148901, now seen corresponding path program 1 times [2022-11-02 20:53:26,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:26,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31799421] [2022-11-02 20:53:26,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:26,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:26,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:26,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:26,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:26,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31799421] [2022-11-02 20:53:26,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31799421] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:26,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696181066] [2022-11-02 20:53:26,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:26,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:26,629 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:26,632 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:53:26,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:53:26,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:26,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-02 20:53:26,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:26,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02 20:53:26,882 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:53:26,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-02 20:53:27,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:27,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:53:27,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:27,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696181066] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:53:27,359 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:53:27,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 14 [2022-11-02 20:53:27,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537541201] [2022-11-02 20:53:27,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:53:27,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:53:27,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:27,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:53:27,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:53:27,361 INFO L87 Difference]: Start difference. First operand 135 states and 175 transitions. Second operand has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 12 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:27,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:27,991 INFO L93 Difference]: Finished difference Result 200 states and 254 transitions. [2022-11-02 20:53:27,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:53:27,992 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 12 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-02 20:53:27,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:27,993 INFO L225 Difference]: With dead ends: 200 [2022-11-02 20:53:27,993 INFO L226 Difference]: Without dead ends: 200 [2022-11-02 20:53:27,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:53:27,994 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 362 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:27,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 447 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:53:27,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-11-02 20:53:28,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 143. [2022-11-02 20:53:28,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 100 states have (on average 1.65) internal successors, (165), 128 states have internal predecessors, (165), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-02 20:53:28,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 187 transitions. [2022-11-02 20:53:28,003 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 187 transitions. Word has length 16 [2022-11-02 20:53:28,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:28,003 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 187 transitions. [2022-11-02 20:53:28,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 12 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:28,004 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 187 transitions. [2022-11-02 20:53:28,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:53:28,004 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:28,004 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:28,046 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:53:28,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-02 20:53:28,205 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-02 20:53:28,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:28,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1007148902, now seen corresponding path program 1 times [2022-11-02 20:53:28,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:28,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458556983] [2022-11-02 20:53:28,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:28,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:28,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:28,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:28,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:28,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458556983] [2022-11-02 20:53:28,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458556983] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:28,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550616676] [2022-11-02 20:53:28,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:28,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:28,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:28,401 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:53:28,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:53:28,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:28,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-02 20:53:28,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:28,548 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:53:28,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-02 20:53:28,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:28,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:53:29,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-11-02 20:53:29,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:29,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550616676] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:53:29,068 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:53:29,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 15 [2022-11-02 20:53:29,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883680930] [2022-11-02 20:53:29,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:53:29,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-02 20:53:29,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:29,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-02 20:53:29,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:53:29,070 INFO L87 Difference]: Start difference. First operand 143 states and 187 transitions. Second operand has 16 states, 15 states have (on average 2.4) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:29,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:29,815 INFO L93 Difference]: Finished difference Result 197 states and 251 transitions. [2022-11-02 20:53:29,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:53:29,816 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.4) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-02 20:53:29,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:29,817 INFO L225 Difference]: With dead ends: 197 [2022-11-02 20:53:29,818 INFO L226 Difference]: Without dead ends: 197 [2022-11-02 20:53:29,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2022-11-02 20:53:29,819 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 495 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:29,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 497 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:53:29,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-11-02 20:53:29,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 142. [2022-11-02 20:53:29,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 100 states have (on average 1.62) internal successors, (162), 127 states have internal predecessors, (162), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-02 20:53:29,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 184 transitions. [2022-11-02 20:53:29,825 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 184 transitions. Word has length 16 [2022-11-02 20:53:29,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:29,826 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 184 transitions. [2022-11-02 20:53:29,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.4) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:29,826 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 184 transitions. [2022-11-02 20:53:29,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 20:53:29,827 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:29,827 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:29,869 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:53:30,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-02 20:53:30,046 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-02 20:53:30,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:30,046 INFO L85 PathProgramCache]: Analyzing trace with hash -992190633, now seen corresponding path program 1 times [2022-11-02 20:53:30,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:30,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778480486] [2022-11-02 20:53:30,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:30,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:30,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:30,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:53:30,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:30,408 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-02 20:53:30,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:30,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778480486] [2022-11-02 20:53:30,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778480486] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:30,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:30,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:53:30,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387002530] [2022-11-02 20:53:30,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:30,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:53:30,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:30,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:53:30,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:53:30,422 INFO L87 Difference]: Start difference. First operand 142 states and 184 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:53:30,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:30,682 INFO L93 Difference]: Finished difference Result 190 states and 242 transitions. [2022-11-02 20:53:30,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:53:30,682 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-11-02 20:53:30,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:30,683 INFO L225 Difference]: With dead ends: 190 [2022-11-02 20:53:30,683 INFO L226 Difference]: Without dead ends: 190 [2022-11-02 20:53:30,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:53:30,684 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 187 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:30,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 395 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:53:30,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-11-02 20:53:30,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 150. [2022-11-02 20:53:30,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 107 states have (on average 1.5981308411214954) internal successors, (171), 134 states have internal predecessors, (171), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-02 20:53:30,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 195 transitions. [2022-11-02 20:53:30,692 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 195 transitions. Word has length 19 [2022-11-02 20:53:30,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:30,692 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 195 transitions. [2022-11-02 20:53:30,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:53:30,693 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 195 transitions. [2022-11-02 20:53:30,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-02 20:53:30,697 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:30,697 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:30,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:53:30,698 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-02 20:53:30,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:30,698 INFO L85 PathProgramCache]: Analyzing trace with hash 343557913, now seen corresponding path program 1 times [2022-11-02 20:53:30,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:30,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877113844] [2022-11-02 20:53:30,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:30,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:30,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:30,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:53:30,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:30,976 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-02 20:53:30,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:30,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877113844] [2022-11-02 20:53:30,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877113844] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:30,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:30,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:53:30,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315901746] [2022-11-02 20:53:30,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:30,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:53:30,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:30,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:53:30,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:53:30,979 INFO L87 Difference]: Start difference. First operand 150 states and 195 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:53:31,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:31,187 INFO L93 Difference]: Finished difference Result 185 states and 236 transitions. [2022-11-02 20:53:31,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:53:31,187 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-11-02 20:53:31,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:31,191 INFO L225 Difference]: With dead ends: 185 [2022-11-02 20:53:31,191 INFO L226 Difference]: Without dead ends: 185 [2022-11-02 20:53:31,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:53:31,192 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 135 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:31,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 397 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:53:31,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-11-02 20:53:31,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 152. [2022-11-02 20:53:31,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 109 states have (on average 1.5871559633027523) internal successors, (173), 136 states have internal predecessors, (173), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-02 20:53:31,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 197 transitions. [2022-11-02 20:53:31,200 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 197 transitions. Word has length 21 [2022-11-02 20:53:31,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:31,202 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 197 transitions. [2022-11-02 20:53:31,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:53:31,202 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 197 transitions. [2022-11-02 20:53:31,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:53:31,204 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:31,205 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:31,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:53:31,205 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-02 20:53:31,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:31,205 INFO L85 PathProgramCache]: Analyzing trace with hash 451808416, now seen corresponding path program 1 times [2022-11-02 20:53:31,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:31,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040871009] [2022-11-02 20:53:31,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:31,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:31,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:31,660 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:31,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:31,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040871009] [2022-11-02 20:53:31,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040871009] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:31,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50879834] [2022-11-02 20:53:31,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:31,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:31,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:31,662 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:53:31,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:53:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:31,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-02 20:53:31,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:31,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02 20:53:31,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:32,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-02 20:53:32,103 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-02 20:53:32,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:53:32,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 28 [2022-11-02 20:53:32,349 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-02 20:53:32,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50879834] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:53:32,350 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:53:32,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 24 [2022-11-02 20:53:32,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074399133] [2022-11-02 20:53:32,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:53:32,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-02 20:53:32,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:32,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-02 20:53:32,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2022-11-02 20:53:32,358 INFO L87 Difference]: Start difference. First operand 152 states and 197 transitions. Second operand has 24 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 19 states have internal predecessors, (51), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:34,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:34,587 INFO L93 Difference]: Finished difference Result 500 states and 656 transitions. [2022-11-02 20:53:34,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-02 20:53:34,587 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 19 states have internal predecessors, (51), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-02 20:53:34,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:34,590 INFO L225 Difference]: With dead ends: 500 [2022-11-02 20:53:34,591 INFO L226 Difference]: Without dead ends: 500 [2022-11-02 20:53:34,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=214, Invalid=1426, Unknown=0, NotChecked=0, Total=1640 [2022-11-02 20:53:34,592 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 1024 mSDsluCounter, 1511 mSDsCounter, 0 mSdLazyCounter, 1932 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 1635 SdHoareTripleChecker+Invalid, 2246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 1932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:34,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 1635 Invalid, 2246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 1932 Invalid, 0 Unknown, 100 Unchecked, 1.6s Time] [2022-11-02 20:53:34,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2022-11-02 20:53:34,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 237. [2022-11-02 20:53:34,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 176 states have (on average 1.5795454545454546) internal successors, (278), 206 states have internal predecessors, (278), 25 states have call successors, (25), 9 states have call predecessors, (25), 9 states have return successors, (25), 21 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-02 20:53:34,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 328 transitions. [2022-11-02 20:53:34,618 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 328 transitions. Word has length 22 [2022-11-02 20:53:34,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:34,619 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 328 transitions. [2022-11-02 20:53:34,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 19 states have internal predecessors, (51), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:34,619 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 328 transitions. [2022-11-02 20:53:34,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-02 20:53:34,620 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:34,620 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:34,655 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:53:34,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-02 20:53:34,842 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-02 20:53:34,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:34,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1286860128, now seen corresponding path program 1 times [2022-11-02 20:53:34,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:34,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250978120] [2022-11-02 20:53:34,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:34,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:34,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:34,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:53:34,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:34,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:34,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:34,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250978120] [2022-11-02 20:53:34,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250978120] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:34,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394256415] [2022-11-02 20:53:34,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:34,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:34,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:34,974 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:53:34,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:53:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:35,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-02 20:53:35,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:35,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:35,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:53:35,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:35,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394256415] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:53:35,324 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:53:35,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-11-02 20:53:35,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706253643] [2022-11-02 20:53:35,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:53:35,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-02 20:53:35,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:35,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-02 20:53:35,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:53:35,326 INFO L87 Difference]: Start difference. First operand 237 states and 328 transitions. Second operand has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:53:35,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:35,917 INFO L93 Difference]: Finished difference Result 305 states and 388 transitions. [2022-11-02 20:53:35,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:53:35,917 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) Word has length 21 [2022-11-02 20:53:35,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:35,919 INFO L225 Difference]: With dead ends: 305 [2022-11-02 20:53:35,919 INFO L226 Difference]: Without dead ends: 299 [2022-11-02 20:53:35,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2022-11-02 20:53:35,920 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 299 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:35,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 630 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:53:35,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-11-02 20:53:35,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 237. [2022-11-02 20:53:35,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 176 states have (on average 1.5625) internal successors, (275), 206 states have internal predecessors, (275), 25 states have call successors, (25), 9 states have call predecessors, (25), 9 states have return successors, (25), 21 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-02 20:53:35,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 325 transitions. [2022-11-02 20:53:35,930 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 325 transitions. Word has length 21 [2022-11-02 20:53:35,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:35,930 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 325 transitions. [2022-11-02 20:53:35,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:53:35,931 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 325 transitions. [2022-11-02 20:53:35,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 20:53:35,931 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:35,931 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:35,975 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:53:36,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:36,158 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-02 20:53:36,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:36,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1821114983, now seen corresponding path program 1 times [2022-11-02 20:53:36,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:36,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910861854] [2022-11-02 20:53:36,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:36,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:36,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:36,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:53:36,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:36,243 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-02 20:53:36,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:36,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910861854] [2022-11-02 20:53:36,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910861854] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:36,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:36,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:53:36,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333282116] [2022-11-02 20:53:36,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:36,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:53:36,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:36,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:53:36,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:53:36,246 INFO L87 Difference]: Start difference. First operand 237 states and 325 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:53:36,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:36,277 INFO L93 Difference]: Finished difference Result 251 states and 343 transitions. [2022-11-02 20:53:36,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:53:36,277 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-11-02 20:53:36,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:36,282 INFO L225 Difference]: With dead ends: 251 [2022-11-02 20:53:36,282 INFO L226 Difference]: Without dead ends: 251 [2022-11-02 20:53:36,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:53:36,283 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 6 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:36,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 389 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:53:36,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-11-02 20:53:36,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 246. [2022-11-02 20:53:36,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 179 states have (on average 1.553072625698324) internal successors, (278), 214 states have internal predecessors, (278), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 21 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-02 20:53:36,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 338 transitions. [2022-11-02 20:53:36,293 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 338 transitions. Word has length 24 [2022-11-02 20:53:36,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:36,293 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 338 transitions. [2022-11-02 20:53:36,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:53:36,293 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 338 transitions. [2022-11-02 20:53:36,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-02 20:53:36,294 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:36,294 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:36,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:53:36,295 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-02 20:53:36,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:36,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1983275188, now seen corresponding path program 1 times [2022-11-02 20:53:36,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:36,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371608336] [2022-11-02 20:53:36,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:36,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:36,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:53:36,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:36,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:36,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:36,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371608336] [2022-11-02 20:53:36,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371608336] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:36,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:36,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:53:36,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810694255] [2022-11-02 20:53:36,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:36,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:53:36,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:36,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:53:36,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:53:36,382 INFO L87 Difference]: Start difference. First operand 246 states and 338 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:53:36,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:36,657 INFO L93 Difference]: Finished difference Result 304 states and 389 transitions. [2022-11-02 20:53:36,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:53:36,658 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-11-02 20:53:36,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:36,659 INFO L225 Difference]: With dead ends: 304 [2022-11-02 20:53:36,659 INFO L226 Difference]: Without dead ends: 304 [2022-11-02 20:53:36,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:53:36,660 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 206 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:36,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 254 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:53:36,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-11-02 20:53:36,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 245. [2022-11-02 20:53:36,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 179 states have (on average 1.541899441340782) internal successors, (276), 213 states have internal predecessors, (276), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 21 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-02 20:53:36,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 336 transitions. [2022-11-02 20:53:36,673 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 336 transitions. Word has length 23 [2022-11-02 20:53:36,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:36,673 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 336 transitions. [2022-11-02 20:53:36,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:53:36,673 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 336 transitions. [2022-11-02 20:53:36,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-02 20:53:36,676 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:36,677 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:36,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:53:36,677 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-02 20:53:36,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:36,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1983275187, now seen corresponding path program 1 times [2022-11-02 20:53:36,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:36,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864081502] [2022-11-02 20:53:36,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:36,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:36,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:53:36,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:36,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:36,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:36,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864081502] [2022-11-02 20:53:36,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864081502] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:36,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:36,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:53:36,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123391710] [2022-11-02 20:53:36,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:36,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:53:36,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:36,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:53:36,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:53:36,850 INFO L87 Difference]: Start difference. First operand 245 states and 336 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:53:37,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:37,122 INFO L93 Difference]: Finished difference Result 302 states and 382 transitions. [2022-11-02 20:53:37,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:53:37,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-11-02 20:53:37,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:37,124 INFO L225 Difference]: With dead ends: 302 [2022-11-02 20:53:37,124 INFO L226 Difference]: Without dead ends: 302 [2022-11-02 20:53:37,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-02 20:53:37,124 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 194 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:37,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 349 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:53:37,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-11-02 20:53:37,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 239. [2022-11-02 20:53:37,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 179 states have (on average 1.4916201117318435) internal successors, (267), 207 states have internal predecessors, (267), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 21 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-02 20:53:37,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 327 transitions. [2022-11-02 20:53:37,133 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 327 transitions. Word has length 23 [2022-11-02 20:53:37,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:37,133 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 327 transitions. [2022-11-02 20:53:37,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:53:37,134 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 327 transitions. [2022-11-02 20:53:37,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 20:53:37,134 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:37,134 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:37,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:53:37,135 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-02 20:53:37,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:37,135 INFO L85 PathProgramCache]: Analyzing trace with hash -2147398490, now seen corresponding path program 1 times [2022-11-02 20:53:37,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:37,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176570284] [2022-11-02 20:53:37,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:37,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:38,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:53:38,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:38,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:38,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:38,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176570284] [2022-11-02 20:53:38,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176570284] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:38,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574287878] [2022-11-02 20:53:38,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:38,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:38,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:38,052 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:53:38,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:53:38,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:38,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-02 20:53:38,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:38,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02 20:53:38,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:38,563 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:53:38,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 17 [2022-11-02 20:53:38,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:38,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:53:38,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574287878] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:38,779 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:53:38,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 22 [2022-11-02 20:53:38,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549105756] [2022-11-02 20:53:38,779 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:53:38,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-02 20:53:38,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:38,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-02 20:53:38,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2022-11-02 20:53:38,781 INFO L87 Difference]: Start difference. First operand 239 states and 327 transitions. Second operand has 23 states, 22 states have (on average 2.0) internal successors, (44), 23 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:53:41,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:41,535 INFO L93 Difference]: Finished difference Result 552 states and 721 transitions. [2022-11-02 20:53:41,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-02 20:53:41,536 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 23 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-11-02 20:53:41,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:41,538 INFO L225 Difference]: With dead ends: 552 [2022-11-02 20:53:41,538 INFO L226 Difference]: Without dead ends: 552 [2022-11-02 20:53:41,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=316, Invalid=1576, Unknown=0, NotChecked=0, Total=1892 [2022-11-02 20:53:41,540 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 594 mSDsluCounter, 1796 mSDsCounter, 0 mSdLazyCounter, 1669 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 1968 SdHoareTripleChecker+Invalid, 2464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 654 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:41,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 1968 Invalid, 2464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1669 Invalid, 0 Unknown, 654 Unchecked, 1.5s Time] [2022-11-02 20:53:41,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2022-11-02 20:53:41,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 252. [2022-11-02 20:53:41,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 190 states have (on average 1.4736842105263157) internal successors, (280), 218 states have internal predecessors, (280), 31 states have call successors, (31), 11 states have call predecessors, (31), 11 states have return successors, (31), 22 states have call predecessors, (31), 31 states have call successors, (31) [2022-11-02 20:53:41,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 342 transitions. [2022-11-02 20:53:41,551 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 342 transitions. Word has length 25 [2022-11-02 20:53:41,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:41,552 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 342 transitions. [2022-11-02 20:53:41,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 23 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:53:41,552 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 342 transitions. [2022-11-02 20:53:41,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 20:53:41,553 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:41,553 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:41,597 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:53:41,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-02 20:53:41,780 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-02 20:53:41,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:41,781 INFO L85 PathProgramCache]: Analyzing trace with hash -2147398489, now seen corresponding path program 1 times [2022-11-02 20:53:41,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:41,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615495914] [2022-11-02 20:53:41,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:41,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:41,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:42,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:53:42,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:42,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:42,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:42,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615495914] [2022-11-02 20:53:42,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615495914] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:42,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538240454] [2022-11-02 20:53:42,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:42,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:42,807 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:42,808 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:53:42,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:53:42,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:42,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-02 20:53:42,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:43,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:43,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:43,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 9 [2022-11-02 20:53:43,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2022-11-02 20:53:43,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:43,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:53:43,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 70 treesize of output 64 [2022-11-02 20:53:43,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 94 treesize of output 82 [2022-11-02 20:53:43,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:43,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:43,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 6 [2022-11-02 20:53:43,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:43,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538240454] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:53:43,581 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:53:43,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 7] total 26 [2022-11-02 20:53:43,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035480733] [2022-11-02 20:53:43,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:53:43,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-02 20:53:43,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:43,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-02 20:53:43,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2022-11-02 20:53:43,584 INFO L87 Difference]: Start difference. First operand 252 states and 342 transitions. Second operand has 27 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 27 states have internal predecessors, (60), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:53:45,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:45,917 INFO L93 Difference]: Finished difference Result 410 states and 506 transitions. [2022-11-02 20:53:45,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 20:53:45,918 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 27 states have internal predecessors, (60), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 25 [2022-11-02 20:53:45,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:45,920 INFO L225 Difference]: With dead ends: 410 [2022-11-02 20:53:45,921 INFO L226 Difference]: Without dead ends: 410 [2022-11-02 20:53:45,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=254, Invalid=1386, Unknown=0, NotChecked=0, Total=1640 [2022-11-02 20:53:45,922 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 582 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 1483 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 1735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 1483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:45,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 1297 Invalid, 1735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 1483 Invalid, 0 Unknown, 80 Unchecked, 1.4s Time] [2022-11-02 20:53:45,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-11-02 20:53:45,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 261. [2022-11-02 20:53:45,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 196 states have (on average 1.4489795918367347) internal successors, (284), 225 states have internal predecessors, (284), 32 states have call successors, (32), 13 states have call predecessors, (32), 13 states have return successors, (32), 22 states have call predecessors, (32), 32 states have call successors, (32) [2022-11-02 20:53:45,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 348 transitions. [2022-11-02 20:53:45,934 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 348 transitions. Word has length 25 [2022-11-02 20:53:45,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:45,934 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 348 transitions. [2022-11-02 20:53:45,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 27 states have internal predecessors, (60), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:53:45,935 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 348 transitions. [2022-11-02 20:53:45,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-02 20:53:45,936 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:45,936 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:45,972 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:53:46,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:46,162 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-02 20:53:46,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:46,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1195361463, now seen corresponding path program 1 times [2022-11-02 20:53:46,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:46,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144298424] [2022-11-02 20:53:46,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:46,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:46,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:53:46,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:46,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:53:46,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:46,257 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-02 20:53:46,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:46,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144298424] [2022-11-02 20:53:46,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144298424] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:46,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:46,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:53:46,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527599555] [2022-11-02 20:53:46,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:46,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:53:46,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:46,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:53:46,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:53:46,260 INFO L87 Difference]: Start difference. First operand 261 states and 348 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:53:46,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:46,472 INFO L93 Difference]: Finished difference Result 271 states and 340 transitions. [2022-11-02 20:53:46,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:53:46,473 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-11-02 20:53:46,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:46,474 INFO L225 Difference]: With dead ends: 271 [2022-11-02 20:53:46,474 INFO L226 Difference]: Without dead ends: 271 [2022-11-02 20:53:46,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:53:46,475 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 159 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:46,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 195 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:53:46,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-11-02 20:53:46,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 258. [2022-11-02 20:53:46,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 196 states have (on average 1.3928571428571428) internal successors, (273), 222 states have internal predecessors, (273), 32 states have call successors, (32), 13 states have call predecessors, (32), 13 states have return successors, (32), 22 states have call predecessors, (32), 32 states have call successors, (32) [2022-11-02 20:53:46,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 337 transitions. [2022-11-02 20:53:46,484 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 337 transitions. Word has length 27 [2022-11-02 20:53:46,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:46,484 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 337 transitions. [2022-11-02 20:53:46,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:53:46,485 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 337 transitions. [2022-11-02 20:53:46,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-02 20:53:46,485 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:46,486 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:46,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:53:46,486 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-02 20:53:46,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:46,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1195361464, now seen corresponding path program 1 times [2022-11-02 20:53:46,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:46,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840662674] [2022-11-02 20:53:46,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:46,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:46,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:46,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:53:46,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:46,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:53:46,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:46,619 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-02 20:53:46,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:46,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840662674] [2022-11-02 20:53:46,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840662674] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:46,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:46,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:53:46,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700347922] [2022-11-02 20:53:46,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:46,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:53:46,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:46,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:53:46,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:53:46,622 INFO L87 Difference]: Start difference. First operand 258 states and 337 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:53:46,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:46,831 INFO L93 Difference]: Finished difference Result 269 states and 335 transitions. [2022-11-02 20:53:46,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:53:46,831 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-11-02 20:53:46,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:46,833 INFO L225 Difference]: With dead ends: 269 [2022-11-02 20:53:46,833 INFO L226 Difference]: Without dead ends: 269 [2022-11-02 20:53:46,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:53:46,833 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 214 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:46,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 167 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:53:46,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-11-02 20:53:46,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 258. [2022-11-02 20:53:46,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 196 states have (on average 1.3622448979591837) internal successors, (267), 222 states have internal predecessors, (267), 32 states have call successors, (32), 13 states have call predecessors, (32), 13 states have return successors, (32), 22 states have call predecessors, (32), 32 states have call successors, (32) [2022-11-02 20:53:46,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 331 transitions. [2022-11-02 20:53:46,842 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 331 transitions. Word has length 27 [2022-11-02 20:53:46,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:46,843 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 331 transitions. [2022-11-02 20:53:46,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:53:46,843 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 331 transitions. [2022-11-02 20:53:46,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 20:53:46,844 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:46,844 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:46,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:53:46,844 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-02 20:53:46,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:46,845 INFO L85 PathProgramCache]: Analyzing trace with hash 468828335, now seen corresponding path program 1 times [2022-11-02 20:53:46,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:46,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005643317] [2022-11-02 20:53:46,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:46,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:46,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:46,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:53:46,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:46,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:53:46,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:46,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005643317] [2022-11-02 20:53:46,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005643317] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:46,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:46,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:53:46,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570635797] [2022-11-02 20:53:46,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:46,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:53:46,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:46,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:53:46,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:53:46,883 INFO L87 Difference]: Start difference. First operand 258 states and 331 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:53:46,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:46,895 INFO L93 Difference]: Finished difference Result 267 states and 341 transitions. [2022-11-02 20:53:46,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:53:46,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-11-02 20:53:46,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:46,897 INFO L225 Difference]: With dead ends: 267 [2022-11-02 20:53:46,897 INFO L226 Difference]: Without dead ends: 267 [2022-11-02 20:53:46,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-02 20:53:46,898 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 57 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:46,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 193 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:53:46,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-11-02 20:53:46,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 238. [2022-11-02 20:53:46,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 180 states have (on average 1.3611111111111112) internal successors, (245), 205 states have internal predecessors, (245), 30 states have call successors, (30), 11 states have call predecessors, (30), 11 states have return successors, (30), 21 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-02 20:53:46,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 305 transitions. [2022-11-02 20:53:46,906 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 305 transitions. Word has length 26 [2022-11-02 20:53:46,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:46,906 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 305 transitions. [2022-11-02 20:53:46,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:53:46,907 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 305 transitions. [2022-11-02 20:53:46,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-02 20:53:46,907 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:46,907 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:46,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:53:46,908 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-02 20:53:46,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:46,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1109218320, now seen corresponding path program 1 times [2022-11-02 20:53:46,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:46,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735182094] [2022-11-02 20:53:46,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:46,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:47,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:53:47,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:47,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:53:47,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:47,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735182094] [2022-11-02 20:53:47,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735182094] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:47,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:47,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:53:47,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335723744] [2022-11-02 20:53:47,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:47,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:53:47,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:47,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:53:47,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:53:47,061 INFO L87 Difference]: Start difference. First operand 238 states and 305 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:53:47,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:47,085 INFO L93 Difference]: Finished difference Result 252 states and 324 transitions. [2022-11-02 20:53:47,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:53:47,086 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-11-02 20:53:47,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:47,087 INFO L225 Difference]: With dead ends: 252 [2022-11-02 20:53:47,088 INFO L226 Difference]: Without dead ends: 248 [2022-11-02 20:53:47,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:53:47,088 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 1 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:47,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 370 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:53:47,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-11-02 20:53:47,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 242. [2022-11-02 20:53:47,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 182 states have (on average 1.3571428571428572) internal successors, (247), 209 states have internal predecessors, (247), 30 states have call successors, (30), 11 states have call predecessors, (30), 13 states have return successors, (34), 21 states have call predecessors, (34), 30 states have call successors, (34) [2022-11-02 20:53:47,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 311 transitions. [2022-11-02 20:53:47,097 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 311 transitions. Word has length 27 [2022-11-02 20:53:47,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:47,098 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 311 transitions. [2022-11-02 20:53:47,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:53:47,098 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 311 transitions. [2022-11-02 20:53:47,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-02 20:53:47,099 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:47,099 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:47,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:53:47,099 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-02 20:53:47,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:47,100 INFO L85 PathProgramCache]: Analyzing trace with hash -815173774, now seen corresponding path program 1 times [2022-11-02 20:53:47,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:47,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369224641] [2022-11-02 20:53:47,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:47,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:47,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:48,231 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:48,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:48,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369224641] [2022-11-02 20:53:48,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369224641] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:48,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445605260] [2022-11-02 20:53:48,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:48,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:48,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:48,234 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:53:48,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 20:53:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:48,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 83 conjunts are in the unsatisfiable core [2022-11-02 20:53:48,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:48,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:48,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:48,639 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:53:48,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 22 [2022-11-02 20:53:48,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-02 20:53:48,666 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:53:48,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 22 [2022-11-02 20:53:48,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-02 20:53:48,746 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:53:48,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 26 [2022-11-02 20:53:48,773 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:53:48,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 26 [2022-11-02 20:53:48,810 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-02 20:53:48,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 30 [2022-11-02 20:53:48,840 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-02 20:53:48,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 30 [2022-11-02 20:53:49,038 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:53:49,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:49,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:53:49,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 23 treesize of output 25 [2022-11-02 20:53:49,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 32 treesize of output 32 [2022-11-02 20:53:49,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 32 treesize of output 32 [2022-11-02 20:53:49,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 23 treesize of output 25 [2022-11-02 20:53:49,463 INFO L356 Elim1Store]: treesize reduction 14, result has 61.1 percent of original size [2022-11-02 20:53:49,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 39 treesize of output 44 [2022-11-02 20:53:49,483 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-02 20:53:49,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 33 [2022-11-02 20:53:50,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 17 [2022-11-02 20:53:50,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:53:50,545 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:50,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:53:51,654 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:53:51,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 342 treesize of output 347 [2022-11-02 20:54:01,779 WARN L234 SmtUtils]: Spent 8.62s on a formula simplification. DAG size of input: 97 DAG size of output: 72 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:54:06,110 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:54:06,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 308 treesize of output 378 [2022-11-02 20:54:14,129 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (and (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_26 Int) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (< (select (select (let ((.cse1 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse0 (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse2 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 v_prenex_26))) v_prenex_24 v_prenex_25))) (store .cse0 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) 1) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_24))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((v_prenex_27 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_2 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (let ((.cse4 (select (select (let ((.cse6 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse5 (store (let ((.cse7 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse7 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse6 |ULTIMATE.start_main_~n~0#1.base|))) v_prenex_27 v_prenex_2))) (store .cse5 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse6 v_prenex_27)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3))) (or (= .cse4 v_prenex_27) (= .cse4 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_27)))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_29 Int) (v_prenex_28 Int) (v_prenex_3 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (<= 0 (+ (select (select (let ((.cse9 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse8 (store (let ((.cse10 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse10 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse9 v_prenex_29))) v_prenex_28 v_prenex_3))) (store .cse8 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse9 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) 4)) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_28))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (or (= |c_ULTIMATE.start_main_~n~0#1.offset| |c_ULTIMATE.start_main_~#list~0#1.offset|) (and (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~n~0#1.base_21| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_854 Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse12 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= (select (select (let ((.cse11 (store (let ((.cse13 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse13 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse12 v_ArrVal_854))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_861))) (store .cse11 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse12 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_~n~0#1.base_21| |c_ULTIMATE.start_main_~tail~0#1.base|) (= (select (select (let ((.cse14 (store (let ((.cse15 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse15 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse15 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse12 |ULTIMATE.start_main_~n~0#1.base|))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_860))) (store .cse14 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse12 |v_ULTIMATE.start_main_~n~0#1.base_21|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) |v_ULTIMATE.start_main_~n~0#1.base_21|)))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_26 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (< (select (select (let ((.cse17 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse16 (store (let ((.cse18 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse18 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse18 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse17 v_prenex_26))) v_prenex_24 v_prenex_25))) (store .cse16 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse16 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse17 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) 1) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_24))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_29 Int) (v_prenex_28 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_3 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (<= 0 (+ (select (select (let ((.cse20 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse19 (store (let ((.cse21 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse21 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse21 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse20 v_prenex_29))) v_prenex_28 v_prenex_3))) (store .cse19 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse19 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse20 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) 4)) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_28))) (forall ((v_prenex_27 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_2 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (let ((.cse22 (select (select (let ((.cse24 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse23 (store (let ((.cse25 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse25 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse25 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse24 |ULTIMATE.start_main_~n~0#1.base|))) v_prenex_27 v_prenex_2))) (store .cse23 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse23 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse24 v_prenex_27)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3))) (or (= .cse22 v_prenex_27) (= .cse22 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_27)))))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~n~0#1.base_21| Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_854 Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse27 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= (select (select (let ((.cse26 (store (let ((.cse28 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse28 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse28 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse27 v_ArrVal_854))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_861))) (store .cse26 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse26 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse27 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_~n~0#1.base_21| |c_ULTIMATE.start_main_~tail~0#1.base|) (= (select (select (let ((.cse29 (store (let ((.cse30 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse30 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse30 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse27 |ULTIMATE.start_main_~n~0#1.base|))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_860))) (store .cse29 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse29 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse27 |v_ULTIMATE.start_main_~n~0#1.base_21|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) |v_ULTIMATE.start_main_~n~0#1.base_21|)))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))))) is different from false [2022-11-02 20:54:14,546 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (and (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_26 Int) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (< (select (select (let ((.cse1 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse0 (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse2 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 v_prenex_26))) v_prenex_24 v_prenex_25))) (store .cse0 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) 1) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_24))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (or (and (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~n~0#1.base_21| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_854 Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse5 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= (select (select (let ((.cse4 (store (let ((.cse6 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse6 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse5 v_ArrVal_854))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_861))) (store .cse4 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse5 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_~n~0#1.base_21| |c_ULTIMATE.start_main_~tail~0#1.base|) (= (select (select (let ((.cse7 (store (let ((.cse8 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse8 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse5 |ULTIMATE.start_main_~n~0#1.base|))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_860))) (store .cse7 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse5 |v_ULTIMATE.start_main_~n~0#1.base_21|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) |v_ULTIMATE.start_main_~n~0#1.base_21|)))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_26 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (< (select (select (let ((.cse10 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse9 (store (let ((.cse11 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse11 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse10 v_prenex_26))) v_prenex_24 v_prenex_25))) (store .cse9 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse10 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) 1) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_24))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_29 Int) (v_prenex_28 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_3 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (<= 0 (+ (select (select (let ((.cse13 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse12 (store (let ((.cse14 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse14 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse13 v_prenex_29))) v_prenex_28 v_prenex_3))) (store .cse12 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse13 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) 4)) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_28))) (forall ((v_prenex_27 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_2 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (let ((.cse15 (select (select (let ((.cse17 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse16 (store (let ((.cse18 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse18 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse18 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse17 |ULTIMATE.start_main_~n~0#1.base|))) v_prenex_27 v_prenex_2))) (store .cse16 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse16 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse17 v_prenex_27)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3))) (or (= .cse15 v_prenex_27) (= .cse15 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_27))))) (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0)) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((v_prenex_27 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_2 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (let ((.cse19 (select (select (let ((.cse21 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse20 (store (let ((.cse22 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse22 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse22 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse21 |ULTIMATE.start_main_~n~0#1.base|))) v_prenex_27 v_prenex_2))) (store .cse20 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse20 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse21 v_prenex_27)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3))) (or (= .cse19 v_prenex_27) (= .cse19 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_27)))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_29 Int) (v_prenex_28 Int) (v_prenex_3 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (<= 0 (+ (select (select (let ((.cse24 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse23 (store (let ((.cse25 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse25 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse25 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse24 v_prenex_29))) v_prenex_28 v_prenex_3))) (store .cse23 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse23 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse24 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) 4)) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_28))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~n~0#1.base_21| Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_854 Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse27 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= (select (select (let ((.cse26 (store (let ((.cse28 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse28 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse28 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse27 v_ArrVal_854))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_861))) (store .cse26 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse26 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse27 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_~n~0#1.base_21| |c_ULTIMATE.start_main_~tail~0#1.base|) (= (select (select (let ((.cse29 (store (let ((.cse30 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse30 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse30 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse27 |ULTIMATE.start_main_~n~0#1.base|))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_860))) (store .cse29 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse29 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse27 |v_ULTIMATE.start_main_~n~0#1.base_21|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) |v_ULTIMATE.start_main_~n~0#1.base_21|)))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))))) is different from false [2022-11-02 20:54:14,723 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (and (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((v_prenex_27 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_2 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (let ((.cse0 (select (let ((.cse2 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (store (select (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse1 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2 |ULTIMATE.start_main_~n~0#1.base|))) v_prenex_27 v_prenex_2) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2 v_prenex_27)) .cse3))) (or (= v_prenex_27 |c_ULTIMATE.start_main_~#list~0#1.base|) (= v_prenex_27 .cse0) (= .cse0 0)))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_29 Int) (v_prenex_28 Int) (v_prenex_3 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (<= 0 (+ (select (let ((.cse5 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (store (select (store (let ((.cse4 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse4 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5 v_prenex_29))) v_prenex_28 v_prenex_3) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5 0)) .cse3) 4)) (= v_prenex_28 |c_ULTIMATE.start_main_~#list~0#1.base|))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_26 Int) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (= v_prenex_24 |c_ULTIMATE.start_main_~#list~0#1.base|) (< (select (let ((.cse7 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (store (select (store (let ((.cse6 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse6 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse7 v_prenex_26))) v_prenex_24 v_prenex_25) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse7 0)) .cse3) 1))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (or (and (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_29 Int) (v_prenex_28 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_3 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (<= 0 (+ (select (let ((.cse9 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (store (select (store (let ((.cse8 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse8 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse9 v_prenex_29))) v_prenex_28 v_prenex_3) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse9 0)) .cse3) 4)) (= v_prenex_28 |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~n~0#1.base_21| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_854 Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse11 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= (select (store (select (store (let ((.cse10 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse10 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse11 v_ArrVal_854))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_861) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse11 0) .cse3) 0) (= |v_ULTIMATE.start_main_~n~0#1.base_21| |c_ULTIMATE.start_main_~#list~0#1.base|) (= (select (store (select (store (let ((.cse12 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse12 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse11 |ULTIMATE.start_main_~n~0#1.base|))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_860) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse11 |v_ULTIMATE.start_main_~n~0#1.base_21|) .cse3) |v_ULTIMATE.start_main_~n~0#1.base_21|)))) (forall ((v_prenex_27 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_2 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (let ((.cse13 (select (let ((.cse15 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (store (select (store (let ((.cse14 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse14 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse15 |ULTIMATE.start_main_~n~0#1.base|))) v_prenex_27 v_prenex_2) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse15 v_prenex_27)) .cse3))) (or (= v_prenex_27 |c_ULTIMATE.start_main_~#list~0#1.base|) (= v_prenex_27 .cse13) (= .cse13 0)))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_26 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (= v_prenex_24 |c_ULTIMATE.start_main_~#list~0#1.base|) (< (select (let ((.cse17 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (store (select (store (let ((.cse16 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse16 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse16 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse17 v_prenex_26))) v_prenex_24 v_prenex_25) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse17 0)) .cse3) 1)))) (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0)) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~n~0#1.base_21| Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_854 Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse19 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= (select (store (select (store (let ((.cse18 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse18 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse18 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse19 v_ArrVal_854))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_861) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse19 0) .cse3) 0) (= |v_ULTIMATE.start_main_~n~0#1.base_21| |c_ULTIMATE.start_main_~#list~0#1.base|) (= (select (store (select (store (let ((.cse20 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse20 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse20 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse19 |ULTIMATE.start_main_~n~0#1.base|))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_860) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse19 |v_ULTIMATE.start_main_~n~0#1.base_21|) .cse3) |v_ULTIMATE.start_main_~n~0#1.base_21|)))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))))) is different from false [2022-11-02 20:54:14,794 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 20:54:14,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 1 [2022-11-02 20:54:14,807 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 20:54:14,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 1 [2022-11-02 20:54:14,815 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 20:54:14,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 1 [2022-11-02 20:54:14,825 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:54:14,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 53 treesize of output 44 [2022-11-02 20:54:14,829 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:54:14,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 42 [2022-11-02 20:54:14,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-11-02 20:54:14,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-02 20:54:14,867 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 20:54:14,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 1 [2022-11-02 20:54:14,872 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-02 20:54:14,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445605260] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:54:14,872 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:54:14,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 20] total 49 [2022-11-02 20:54:14,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628878380] [2022-11-02 20:54:14,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:54:14,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-02 20:54:14,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:14,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-02 20:54:14,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1998, Unknown=7, NotChecked=276, Total=2450 [2022-11-02 20:54:14,877 INFO L87 Difference]: Start difference. First operand 242 states and 311 transitions. Second operand has 50 states, 46 states have (on average 1.608695652173913) internal successors, (74), 44 states have internal predecessors, (74), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:16,968 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_ULTIMATE.start_main_~#list~0#1.base|)) (.cse9 (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0)) (.cse1 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (and (<= .cse0 8) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1)) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((v_prenex_27 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_2 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (let ((.cse2 (select (let ((.cse4 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (store (select (store (let ((.cse3 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse3 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4 |ULTIMATE.start_main_~n~0#1.base|))) v_prenex_27 v_prenex_2) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4 v_prenex_27)) .cse1))) (or (= v_prenex_27 |c_ULTIMATE.start_main_~#list~0#1.base|) (= v_prenex_27 .cse2) (= .cse2 0)))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (<= 8 .cse0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1) 0) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_29 Int) (v_prenex_28 Int) (v_prenex_3 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (<= 0 (+ (select (let ((.cse6 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (store (select (store (let ((.cse5 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse5 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse6 v_prenex_29))) v_prenex_28 v_prenex_3) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse6 0)) .cse1) 4)) (= v_prenex_28 |c_ULTIMATE.start_main_~#list~0#1.base|))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_26 Int) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (= v_prenex_24 |c_ULTIMATE.start_main_~#list~0#1.base|) (< (select (let ((.cse8 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (store (select (store (let ((.cse7 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse7 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse8 v_prenex_26))) v_prenex_24 v_prenex_25) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse8 0)) .cse1) 1))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) .cse9 (or (and (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_29 Int) (v_prenex_28 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_3 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (<= 0 (+ (select (let ((.cse11 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (store (select (store (let ((.cse10 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse10 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse11 v_prenex_29))) v_prenex_28 v_prenex_3) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse11 0)) .cse1) 4)) (= v_prenex_28 |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~n~0#1.base_21| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_854 Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse13 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= (select (store (select (store (let ((.cse12 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse12 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse13 v_ArrVal_854))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_861) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse13 0) .cse1) 0) (= |v_ULTIMATE.start_main_~n~0#1.base_21| |c_ULTIMATE.start_main_~#list~0#1.base|) (= (select (store (select (store (let ((.cse14 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse14 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse13 |ULTIMATE.start_main_~n~0#1.base|))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_860) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse13 |v_ULTIMATE.start_main_~n~0#1.base_21|) .cse1) |v_ULTIMATE.start_main_~n~0#1.base_21|)))) (forall ((v_prenex_27 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_2 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (let ((.cse15 (select (let ((.cse17 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (store (select (store (let ((.cse16 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse16 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse16 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse17 |ULTIMATE.start_main_~n~0#1.base|))) v_prenex_27 v_prenex_2) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse17 v_prenex_27)) .cse1))) (or (= v_prenex_27 |c_ULTIMATE.start_main_~#list~0#1.base|) (= v_prenex_27 .cse15) (= .cse15 0)))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_26 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (= v_prenex_24 |c_ULTIMATE.start_main_~#list~0#1.base|) (< (select (let ((.cse19 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (store (select (store (let ((.cse18 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse18 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse18 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse19 v_prenex_26))) v_prenex_24 v_prenex_25) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse19 0)) .cse1) 1)))) .cse9) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~n~0#1.base_21| Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_854 Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse21 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= (select (store (select (store (let ((.cse20 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse20 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse20 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse21 v_ArrVal_854))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_861) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse21 0) .cse1) 0) (= |v_ULTIMATE.start_main_~n~0#1.base_21| |c_ULTIMATE.start_main_~#list~0#1.base|) (= (select (store (select (store (let ((.cse22 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse22 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse22 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse21 |ULTIMATE.start_main_~n~0#1.base|))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_860) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse21 |v_ULTIMATE.start_main_~n~0#1.base_21|) .cse1) |v_ULTIMATE.start_main_~n~0#1.base_21|)))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))))) is different from false [2022-11-02 20:54:18,980 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_ULTIMATE.start_main_~#list~0#1.base|)) (.cse20 (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0)) (.cse1 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (and (<= .cse0 8) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1)) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_26 Int) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (< (select (select (let ((.cse3 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse2 (store (let ((.cse4 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse4 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse3 v_prenex_26))) v_prenex_24 v_prenex_25))) (store .cse2 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse3 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1) 1) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_24))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (<= 8 .cse0) (or (and (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~n~0#1.base_21| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_854 Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse6 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= (select (select (let ((.cse5 (store (let ((.cse7 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse7 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse6 v_ArrVal_854))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_861))) (store .cse5 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse6 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_~n~0#1.base_21| |c_ULTIMATE.start_main_~tail~0#1.base|) (= (select (select (let ((.cse8 (store (let ((.cse9 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse9 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse6 |ULTIMATE.start_main_~n~0#1.base|))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_860))) (store .cse8 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse6 |v_ULTIMATE.start_main_~n~0#1.base_21|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1) |v_ULTIMATE.start_main_~n~0#1.base_21|)))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_26 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (< (select (select (let ((.cse11 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse10 (store (let ((.cse12 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse12 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse11 v_prenex_26))) v_prenex_24 v_prenex_25))) (store .cse10 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse11 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1) 1) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_24))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_29 Int) (v_prenex_28 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_3 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (<= 0 (+ (select (select (let ((.cse14 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse13 (store (let ((.cse15 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse15 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse15 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse14 v_prenex_29))) v_prenex_28 v_prenex_3))) (store .cse13 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse14 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1) 4)) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_28))) (forall ((v_prenex_27 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_2 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (let ((.cse16 (select (select (let ((.cse18 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse17 (store (let ((.cse19 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse19 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse19 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse18 |ULTIMATE.start_main_~n~0#1.base|))) v_prenex_27 v_prenex_2))) (store .cse17 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse18 v_prenex_27)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1))) (or (= .cse16 v_prenex_27) (= .cse16 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_27))))) .cse20) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1) 0) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((v_prenex_27 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_2 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (let ((.cse21 (select (select (let ((.cse23 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse22 (store (let ((.cse24 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse24 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse24 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse23 |ULTIMATE.start_main_~n~0#1.base|))) v_prenex_27 v_prenex_2))) (store .cse22 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse22 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse23 v_prenex_27)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1))) (or (= .cse21 v_prenex_27) (= .cse21 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_27)))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (= |c_ULTIMATE.start_main_~tail~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|) (= |c_ULTIMATE.start_main_~tail~0#1.offset| |c_ULTIMATE.start_main_~#list~0#1.offset|) .cse20 (= |c_ULTIMATE.start_main_~tail~0#1.offset| 0) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_29 Int) (v_prenex_28 Int) (v_prenex_3 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (<= 0 (+ (select (select (let ((.cse26 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse25 (store (let ((.cse27 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse27 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse27 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse26 v_prenex_29))) v_prenex_28 v_prenex_3))) (store .cse25 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse25 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse26 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1) 4)) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_28))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~n~0#1.base_21| Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_854 Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse29 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= (select (select (let ((.cse28 (store (let ((.cse30 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse30 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse30 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse29 v_ArrVal_854))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_861))) (store .cse28 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse28 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse29 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_~n~0#1.base_21| |c_ULTIMATE.start_main_~tail~0#1.base|) (= (select (select (let ((.cse31 (store (let ((.cse32 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse32 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse32 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse29 |ULTIMATE.start_main_~n~0#1.base|))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_860))) (store .cse31 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse31 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse29 |v_ULTIMATE.start_main_~n~0#1.base_21|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1) |v_ULTIMATE.start_main_~n~0#1.base_21|)))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))))) is different from false [2022-11-02 20:54:20,995 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_main_~tail~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~n~0#1.offset| 0)) (.cse0 (= |c_ULTIMATE.start_main_~n~0#1.offset| |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (and (or (and .cse0 (= |c_ULTIMATE.start_main_~#list~0#1.base| |c_ULTIMATE.start_main_~n~0#1.base|)) (let ((.cse1 (select |c_#length| |c_ULTIMATE.start_main_~tail~0#1.base|))) (and (<= 8 .cse1) .cse2 .cse3 (<= .cse1 8)))) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4)) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_26 Int) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (< (select (select (let ((.cse6 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse5 (store (let ((.cse7 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse7 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse6 v_prenex_26))) v_prenex_24 v_prenex_25))) (store .cse5 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse6 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4) 1) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_24))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4) 0) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((v_prenex_27 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_2 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (let ((.cse8 (select (select (let ((.cse10 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse9 (store (let ((.cse11 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse11 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse10 |ULTIMATE.start_main_~n~0#1.base|))) v_prenex_27 v_prenex_2))) (store .cse9 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse10 v_prenex_27)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4))) (or (= .cse8 v_prenex_27) (= .cse8 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_27)))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) .cse2 (= |c_ULTIMATE.start_main_~tail~0#1.offset| |c_ULTIMATE.start_main_~#list~0#1.offset|) (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0) .cse3 (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_29 Int) (v_prenex_28 Int) (v_prenex_3 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (<= 0 (+ (select (select (let ((.cse13 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse12 (store (let ((.cse14 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse14 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse13 v_prenex_29))) v_prenex_28 v_prenex_3))) (store .cse12 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse13 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4) 4)) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_28))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (or .cse0 (and (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~n~0#1.base_21| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_854 Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse16 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= (select (select (let ((.cse15 (store (let ((.cse17 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse17 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse16 v_ArrVal_854))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_861))) (store .cse15 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse15 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse16 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4) 0) (= |v_ULTIMATE.start_main_~n~0#1.base_21| |c_ULTIMATE.start_main_~tail~0#1.base|) (= (select (select (let ((.cse18 (store (let ((.cse19 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse19 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse19 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse16 |ULTIMATE.start_main_~n~0#1.base|))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_860))) (store .cse18 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse18 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse16 |v_ULTIMATE.start_main_~n~0#1.base_21|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4) |v_ULTIMATE.start_main_~n~0#1.base_21|)))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_26 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (< (select (select (let ((.cse21 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse20 (store (let ((.cse22 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse22 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse22 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse21 v_prenex_26))) v_prenex_24 v_prenex_25))) (store .cse20 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse20 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse21 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4) 1) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_24))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_29 Int) (v_prenex_28 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_3 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (<= 0 (+ (select (select (let ((.cse24 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse23 (store (let ((.cse25 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse25 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse25 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse24 v_prenex_29))) v_prenex_28 v_prenex_3))) (store .cse23 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse23 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse24 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4) 4)) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_28))) (forall ((v_prenex_27 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_2 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (let ((.cse26 (select (select (let ((.cse28 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse27 (store (let ((.cse29 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse29 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse29 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse28 |ULTIMATE.start_main_~n~0#1.base|))) v_prenex_27 v_prenex_2))) (store .cse27 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse27 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse28 v_prenex_27)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4))) (or (= .cse26 v_prenex_27) (= .cse26 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_27)))))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~n~0#1.base_21| Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_854 Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse31 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= (select (select (let ((.cse30 (store (let ((.cse32 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse32 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse32 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse31 v_ArrVal_854))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_861))) (store .cse30 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse30 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse31 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4) 0) (= |v_ULTIMATE.start_main_~n~0#1.base_21| |c_ULTIMATE.start_main_~tail~0#1.base|) (= (select (select (let ((.cse33 (store (let ((.cse34 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse34 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse34 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse31 |ULTIMATE.start_main_~n~0#1.base|))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_860))) (store .cse33 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse33 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse31 |v_ULTIMATE.start_main_~n~0#1.base_21|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4) |v_ULTIMATE.start_main_~n~0#1.base_21|)))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))))) is different from false [2022-11-02 20:54:31,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:31,650 INFO L93 Difference]: Finished difference Result 743 states and 942 transitions. [2022-11-02 20:54:31,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-02 20:54:31,651 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 46 states have (on average 1.608695652173913) internal successors, (74), 44 states have internal predecessors, (74), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-02 20:54:31,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:31,655 INFO L225 Difference]: With dead ends: 743 [2022-11-02 20:54:31,655 INFO L226 Difference]: Without dead ends: 743 [2022-11-02 20:54:31,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 21 SyntacticMatches, 10 SemanticMatches, 91 ConstructedPredicates, 6 IntricatePredicates, 2 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 31.8s TimeCoverageRelationStatistics Valid=623, Invalid=6873, Unknown=10, NotChecked=1050, Total=8556 [2022-11-02 20:54:31,660 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 1460 mSDsluCounter, 2338 mSDsCounter, 0 mSdLazyCounter, 2930 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1475 SdHoareTripleChecker+Valid, 2521 SdHoareTripleChecker+Invalid, 5883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 2930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2637 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:31,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1475 Valid, 2521 Invalid, 5883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 2930 Invalid, 0 Unknown, 2637 Unchecked, 3.7s Time] [2022-11-02 20:54:31,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2022-11-02 20:54:31,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 327. [2022-11-02 20:54:31,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 252 states have (on average 1.3492063492063493) internal successors, (340), 283 states have internal predecessors, (340), 40 states have call successors, (40), 15 states have call predecessors, (40), 18 states have return successors, (46), 28 states have call predecessors, (46), 40 states have call successors, (46) [2022-11-02 20:54:31,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 426 transitions. [2022-11-02 20:54:31,674 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 426 transitions. Word has length 28 [2022-11-02 20:54:31,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:31,675 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 426 transitions. [2022-11-02 20:54:31,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 46 states have (on average 1.608695652173913) internal successors, (74), 44 states have internal predecessors, (74), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:31,675 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 426 transitions. [2022-11-02 20:54:31,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-02 20:54:31,676 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:31,676 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:31,716 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 20:54:31,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:54:31,902 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-02 20:54:31,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:31,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1709630296, now seen corresponding path program 1 times [2022-11-02 20:54:31,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:31,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015146411] [2022-11-02 20:54:31,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:31,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:31,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:32,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:54:32,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:32,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:32,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:32,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015146411] [2022-11-02 20:54:32,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015146411] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:54:32,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638175175] [2022-11-02 20:54:32,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:32,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:54:32,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:54:32,508 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:54:32,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 20:54:32,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:32,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-02 20:54:32,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:54:32,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-02 20:54:33,030 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:54:33,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 16 [2022-11-02 20:54:33,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:33,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:54:33,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638175175] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:54:33,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:54:33,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2022-11-02 20:54:33,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781611007] [2022-11-02 20:54:33,274 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:54:33,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-02 20:54:33,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:33,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-02 20:54:33,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:54:33,275 INFO L87 Difference]: Start difference. First operand 327 states and 426 transitions. Second operand has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:54:34,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:34,174 INFO L93 Difference]: Finished difference Result 348 states and 448 transitions. [2022-11-02 20:54:34,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:54:34,174 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-11-02 20:54:34,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:34,176 INFO L225 Difference]: With dead ends: 348 [2022-11-02 20:54:34,176 INFO L226 Difference]: Without dead ends: 347 [2022-11-02 20:54:34,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=167, Invalid=889, Unknown=0, NotChecked=0, Total=1056 [2022-11-02 20:54:34,177 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 150 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 137 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:34,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 892 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 348 Invalid, 0 Unknown, 137 Unchecked, 0.4s Time] [2022-11-02 20:54:34,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-11-02 20:54:34,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 308. [2022-11-02 20:54:34,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 238 states have (on average 1.3487394957983194) internal successors, (321), 267 states have internal predecessors, (321), 36 states have call successors, (36), 14 states have call predecessors, (36), 17 states have return successors, (42), 26 states have call predecessors, (42), 36 states have call successors, (42) [2022-11-02 20:54:34,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 399 transitions. [2022-11-02 20:54:34,186 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 399 transitions. Word has length 27 [2022-11-02 20:54:34,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:34,186 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 399 transitions. [2022-11-02 20:54:34,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:54:34,186 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 399 transitions. [2022-11-02 20:54:34,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:54:34,187 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:34,187 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:34,231 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-02 20:54:34,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-02 20:54:34,414 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-02 20:54:34,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:34,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1952238210, now seen corresponding path program 1 times [2022-11-02 20:54:34,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:34,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191742481] [2022-11-02 20:54:34,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:34,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:34,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:54:34,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:34,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:54:34,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:34,467 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:54:34,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:34,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191742481] [2022-11-02 20:54:34,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191742481] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:34,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:34,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:54:34,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693592018] [2022-11-02 20:54:34,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:34,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:54:34,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:34,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:54:34,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:54:34,470 INFO L87 Difference]: Start difference. First operand 308 states and 399 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:54:34,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:34,516 INFO L93 Difference]: Finished difference Result 317 states and 400 transitions. [2022-11-02 20:54:34,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:54:34,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2022-11-02 20:54:34,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:34,518 INFO L225 Difference]: With dead ends: 317 [2022-11-02 20:54:34,518 INFO L226 Difference]: Without dead ends: 317 [2022-11-02 20:54:34,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:54:34,519 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 38 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:34,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 253 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:54:34,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-11-02 20:54:34,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 305. [2022-11-02 20:54:34,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 237 states have (on average 1.3459915611814346) internal successors, (319), 265 states have internal predecessors, (319), 34 states have call successors, (34), 14 states have call predecessors, (34), 17 states have return successors, (40), 25 states have call predecessors, (40), 34 states have call successors, (40) [2022-11-02 20:54:34,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 393 transitions. [2022-11-02 20:54:34,544 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 393 transitions. Word has length 30 [2022-11-02 20:54:34,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:34,545 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 393 transitions. [2022-11-02 20:54:34,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:54:34,546 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 393 transitions. [2022-11-02 20:54:34,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:54:34,546 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:34,546 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:34,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 20:54:34,547 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-02 20:54:34,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:34,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1439567607, now seen corresponding path program 1 times [2022-11-02 20:54:34,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:34,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739840483] [2022-11-02 20:54:34,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:34,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:34,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:34,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:54:34,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:34,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:54:34,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:34,836 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-02 20:54:34,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:34,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739840483] [2022-11-02 20:54:34,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739840483] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:34,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:34,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:54:34,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611352009] [2022-11-02 20:54:34,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:34,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:54:34,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:34,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:54:34,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:54:34,839 INFO L87 Difference]: Start difference. First operand 305 states and 393 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:54:35,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:35,107 INFO L93 Difference]: Finished difference Result 323 states and 414 transitions. [2022-11-02 20:54:35,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:54:35,108 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2022-11-02 20:54:35,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:35,109 INFO L225 Difference]: With dead ends: 323 [2022-11-02 20:54:35,109 INFO L226 Difference]: Without dead ends: 323 [2022-11-02 20:54:35,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:54:35,110 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 110 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:35,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 353 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:54:35,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-11-02 20:54:35,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 311. [2022-11-02 20:54:35,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 242 states have (on average 1.3388429752066116) internal successors, (324), 270 states have internal predecessors, (324), 35 states have call successors, (35), 14 states have call predecessors, (35), 17 states have return successors, (41), 26 states have call predecessors, (41), 35 states have call successors, (41) [2022-11-02 20:54:35,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 400 transitions. [2022-11-02 20:54:35,117 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 400 transitions. Word has length 30 [2022-11-02 20:54:35,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:35,118 INFO L495 AbstractCegarLoop]: Abstraction has 311 states and 400 transitions. [2022-11-02 20:54:35,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:54:35,118 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 400 transitions. [2022-11-02 20:54:35,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 20:54:35,119 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:35,119 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:35,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-02 20:54:35,120 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-02 20:54:35,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:35,121 INFO L85 PathProgramCache]: Analyzing trace with hash 453625093, now seen corresponding path program 1 times [2022-11-02 20:54:35,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:35,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063376052] [2022-11-02 20:54:35,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:35,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:35,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:35,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:54:35,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:35,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:54:35,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:35,277 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-02 20:54:35,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:35,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063376052] [2022-11-02 20:54:35,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063376052] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:35,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:35,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:54:35,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230491419] [2022-11-02 20:54:35,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:35,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:54:35,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:35,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:54:35,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:54:35,279 INFO L87 Difference]: Start difference. First operand 311 states and 400 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:54:35,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:35,544 INFO L93 Difference]: Finished difference Result 348 states and 445 transitions. [2022-11-02 20:54:35,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:54:35,545 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2022-11-02 20:54:35,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:35,547 INFO L225 Difference]: With dead ends: 348 [2022-11-02 20:54:35,547 INFO L226 Difference]: Without dead ends: 348 [2022-11-02 20:54:35,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:54:35,547 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 83 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:35,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 365 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:54:35,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-11-02 20:54:35,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 330. [2022-11-02 20:54:35,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 257 states have (on average 1.3307392996108949) internal successors, (342), 286 states have internal predecessors, (342), 39 states have call successors, (39), 14 states have call predecessors, (39), 17 states have return successors, (45), 29 states have call predecessors, (45), 39 states have call successors, (45) [2022-11-02 20:54:35,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 426 transitions. [2022-11-02 20:54:35,558 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 426 transitions. Word has length 32 [2022-11-02 20:54:35,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:35,558 INFO L495 AbstractCegarLoop]: Abstraction has 330 states and 426 transitions. [2022-11-02 20:54:35,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:54:35,559 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 426 transitions. [2022-11-02 20:54:35,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-02 20:54:35,559 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:35,560 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:35,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-02 20:54:35,560 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-02 20:54:35,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:35,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1579548114, now seen corresponding path program 1 times [2022-11-02 20:54:35,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:35,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350521827] [2022-11-02 20:54:35,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:35,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:36,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:54:36,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:36,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:36,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:36,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350521827] [2022-11-02 20:54:36,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350521827] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:54:36,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453657177] [2022-11-02 20:54:36,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:36,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:54:36,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:54:36,506 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:54:36,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-02 20:54:36,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:36,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-02 20:54:36,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:54:36,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:54:36,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:54:36,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:36,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 20 [2022-11-02 20:54:36,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:36,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 20 [2022-11-02 20:54:36,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:36,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02 20:54:36,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:36,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02 20:54:36,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:36,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02 20:54:36,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:36,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02 20:54:36,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-02 20:54:36,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-02 20:54:37,323 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:54:37,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 40 [2022-11-02 20:54:37,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:37,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-02 20:54:37,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:54:37,363 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:54:37,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 12 [2022-11-02 20:54:37,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:37,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:54:37,391 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1075 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_remove_#t~mem4#1.base| v_ArrVal_1075) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) 0)) (forall ((v_ArrVal_1074 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_#t~mem4#1.base| v_ArrVal_1074) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) 0))) is different from false [2022-11-02 20:54:37,408 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_~x#1.base|) (+ |c_ULTIMATE.start_remove_~x#1.offset| 4)))) (and (forall ((v_ArrVal_1075 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1075) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) 0)) (forall ((v_ArrVal_1074 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1074) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) 0)))) is different from false [2022-11-02 20:54:37,432 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)))) (and (forall ((v_ArrVal_1074 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1074) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (forall ((v_ArrVal_1075 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1075) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 0)))) is different from false [2022-11-02 20:54:37,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453657177] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:54:37,455 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:54:37,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2022-11-02 20:54:37,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622392247] [2022-11-02 20:54:37,456 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:54:37,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-02 20:54:37,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:37,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-02 20:54:37,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=323, Unknown=3, NotChecked=114, Total=506 [2022-11-02 20:54:37,457 INFO L87 Difference]: Start difference. First operand 330 states and 426 transitions. Second operand has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:54:38,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:38,767 INFO L93 Difference]: Finished difference Result 384 states and 487 transitions. [2022-11-02 20:54:38,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:54:38,767 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2022-11-02 20:54:38,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:38,769 INFO L225 Difference]: With dead ends: 384 [2022-11-02 20:54:38,769 INFO L226 Difference]: Without dead ends: 384 [2022-11-02 20:54:38,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=182, Invalid=757, Unknown=3, NotChecked=180, Total=1122 [2022-11-02 20:54:38,770 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 329 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:38,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 878 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 634 Invalid, 0 Unknown, 84 Unchecked, 0.7s Time] [2022-11-02 20:54:38,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2022-11-02 20:54:38,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 320. [2022-11-02 20:54:38,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 248 states have (on average 1.3266129032258065) internal successors, (329), 277 states have internal predecessors, (329), 38 states have call successors, (38), 14 states have call predecessors, (38), 17 states have return successors, (44), 28 states have call predecessors, (44), 38 states have call successors, (44) [2022-11-02 20:54:38,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 411 transitions. [2022-11-02 20:54:38,779 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 411 transitions. Word has length 31 [2022-11-02 20:54:38,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:38,779 INFO L495 AbstractCegarLoop]: Abstraction has 320 states and 411 transitions. [2022-11-02 20:54:38,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:54:38,779 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 411 transitions. [2022-11-02 20:54:38,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 20:54:38,780 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:38,780 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:38,818 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-02 20:54:39,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-02 20:54:39,002 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-02 20:54:39,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:39,002 INFO L85 PathProgramCache]: Analyzing trace with hash -575773780, now seen corresponding path program 1 times [2022-11-02 20:54:39,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:39,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370977907] [2022-11-02 20:54:39,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:39,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:39,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:40,201 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:40,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:40,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370977907] [2022-11-02 20:54:40,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370977907] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:54:40,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803005957] [2022-11-02 20:54:40,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:40,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:54:40,202 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:54:40,203 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:54:40,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-02 20:54:40,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:40,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 89 conjunts are in the unsatisfiable core [2022-11-02 20:54:40,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:54:40,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:54:40,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:54:40,549 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:54:40,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 22 [2022-11-02 20:54:40,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-02 20:54:40,576 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:54:40,576 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 22 [2022-11-02 20:54:40,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-02 20:54:40,655 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:54:40,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 26 [2022-11-02 20:54:40,676 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:54:40,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 26 [2022-11-02 20:54:40,717 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-02 20:54:40,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 30 [2022-11-02 20:54:40,761 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-02 20:54:40,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 30 [2022-11-02 20:54:40,935 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:54:40,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:54:41,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 23 treesize of output 25 [2022-11-02 20:54:41,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 23 treesize of output 25 [2022-11-02 20:54:41,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 30 treesize of output 29 [2022-11-02 20:54:41,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 30 treesize of output 29 [2022-11-02 20:54:41,254 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-02 20:54:41,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 1 case distinctions, treesize of input 37 treesize of output 43 [2022-11-02 20:54:41,276 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-02 20:54:41,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 1 case distinctions, treesize of input 43 treesize of output 49 [2022-11-02 20:54:45,376 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:54:45,388 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-11-02 20:54:45,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 41 [2022-11-02 20:54:45,398 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 20:54:45,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2022-11-02 20:54:45,444 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:45,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:54:46,457 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:54:46,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 271 treesize of output 239 [2022-11-02 20:54:46,466 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:54:46,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 231 treesize of output 199 [2022-11-02 20:54:54,518 WARN L234 SmtUtils]: Spent 7.35s on a formula simplification that was a NOOP. DAG size: 65 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:55:00,794 WARN L234 SmtUtils]: Spent 5.36s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:55:06,754 WARN L234 SmtUtils]: Spent 5.27s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:55:07,346 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:55:07,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 780 treesize of output 850 [2022-11-02 20:55:36,234 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (and (or (= |c_ULTIMATE.start_main_~n~0#1.offset| |c_ULTIMATE.start_main_~#list~0#1.offset|) (and (forall ((v_arrayElimArr_6 (Array Int Int)) (|v_ULTIMATE.start_main_~n~0#1.base_24| Int) (v_ArrVal_1194 Int) (v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_1192 Int)) (let ((.cse4 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse1 (select (select (let ((.cse6 (store (let ((.cse7 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse7 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse4 v_ArrVal_1192))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_6))) (store .cse6 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse4 |v_ULTIMATE.start_main_~n~0#1.base_24|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2))) (or (= (let ((.cse0 (let ((.cse3 (store (let ((.cse5 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse5 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse4 v_ArrVal_1194))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_7))) (store .cse3 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse4 0))))) (select (select .cse0 .cse1) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2) 4))) 0) (not (= 0 (select v_arrayElimArr_7 4))) (not (= (select v_arrayElimArr_6 4) 0)) (= .cse1 0) (= |v_ULTIMATE.start_main_~n~0#1.base_24| |c_ULTIMATE.start_main_~tail~0#1.base|))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_24| Int) (v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_1194 Int) (v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_1192 Int)) (let ((.cse11 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse9 (select (select (let ((.cse13 (store (let ((.cse14 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse14 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse11 v_ArrVal_1192))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_6))) (store .cse13 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse11 |v_ULTIMATE.start_main_~n~0#1.base_24|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2))) (or (= (let ((.cse8 (let ((.cse10 (store (let ((.cse12 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse12 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse11 v_ArrVal_1194))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_7))) (store .cse10 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse11 0))))) (select (select .cse8 .cse9) (+ (select (select .cse8 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2) 4))) 0) (not (= 0 (select v_arrayElimArr_7 4))) (not (= (select v_arrayElimArr_6 4) 0)) (= .cse9 0) (= |v_ULTIMATE.start_main_~n~0#1.base_24| |c_ULTIMATE.start_main_~tail~0#1.base|))))) (forall ((v_prenex_38 Int) (v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (v_prenex_42 Int) (v_prenex_39 (Array Int Int))) (let ((.cse17 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse19 (select (select (let ((.cse20 (store (let ((.cse21 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse21 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse21 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse17 v_prenex_40))) v_prenex_38 v_prenex_41))) (store .cse20 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse20 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse17 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2))) (or (not (= (select v_prenex_41 4) 0)) (= 0 (select (let ((.cse15 (let ((.cse16 (store (let ((.cse18 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse18 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse18 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse17 v_prenex_42))) v_prenex_38 v_prenex_39))) (store .cse16 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse16 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse17 v_prenex_38))))) (select .cse15 (select (select .cse15 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2))) (+ .cse19 4))) (= .cse19 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_38) (not (= (select v_prenex_39 4) 0)))))) (forall ((v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (v_prenex_45 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_47 Int) (v_prenex_46 (Array Int Int)) (v_prenex_43 Int) (v_prenex_44 (Array Int Int))) (let ((.cse25 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse22 (let ((.cse27 (store (let ((.cse28 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse28 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse28 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse25 v_prenex_47))) v_prenex_43 v_prenex_44))) (store .cse27 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse27 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse25 v_prenex_43))))) (let ((.cse23 (select (select .cse22 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2))) (or (not (= (select v_prenex_46 4) 0)) (= (select (select .cse22 .cse23) (+ (select (select (let ((.cse24 (store (let ((.cse26 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse26 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse26 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse25 v_prenex_45))) v_prenex_43 v_prenex_46))) (store .cse24 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse24 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse25 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2) 4)) 0) (not (= (select v_prenex_44 4) 0)) (= .cse23 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_43)))))) (forall ((v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_37 Int) (v_ArrVal_1190 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_33 Int) (v_prenex_35 Int) (v_prenex_36 (Array Int Int)) (v_prenex_34 (Array Int Int))) (let ((.cse32 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse30 (let ((.cse34 (store (let ((.cse35 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse35 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse35 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse32 v_prenex_35))) v_prenex_33 v_prenex_36))) (store .cse34 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse34 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse32 0))))) (let ((.cse29 (select (select .cse30 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2))) (or (not (= (select v_prenex_34 4) 0)) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_33) (= .cse29 0) (= (select (select .cse30 (select (select (let ((.cse31 (store (let ((.cse33 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse33 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse33 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse32 v_prenex_37))) v_prenex_33 v_prenex_34))) (store .cse31 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse31 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse32 v_prenex_33))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2)) (+ .cse29 4)) 0) (not (= (select v_prenex_36 4) 0))))))))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (v_prenex_45 Int) (v_prenex_47 Int) (v_prenex_46 (Array Int Int)) (v_prenex_43 Int) (v_prenex_44 (Array Int Int))) (let ((.cse39 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse36 (let ((.cse41 (store (let ((.cse42 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse42 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse42 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse39 v_prenex_47))) v_prenex_43 v_prenex_44))) (store .cse41 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse41 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse39 v_prenex_43))))) (let ((.cse37 (select (select .cse36 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2))) (or (not (= (select v_prenex_46 4) 0)) (= (select (select .cse36 .cse37) (+ (select (select (let ((.cse38 (store (let ((.cse40 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse40 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse40 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse39 v_prenex_45))) v_prenex_43 v_prenex_46))) (store .cse38 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse38 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse39 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2) 4)) 0) (not (= (select v_prenex_44 4) 0)) (= .cse37 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_43)))))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((v_prenex_38 Int) (v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (v_prenex_42 Int) (v_prenex_39 (Array Int Int))) (let ((.cse45 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse47 (select (select (let ((.cse48 (store (let ((.cse49 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse49 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse49 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse45 v_prenex_40))) v_prenex_38 v_prenex_41))) (store .cse48 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse48 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse45 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2))) (or (not (= (select v_prenex_41 4) 0)) (= 0 (select (let ((.cse43 (let ((.cse44 (store (let ((.cse46 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse46 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse46 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse45 v_prenex_42))) v_prenex_38 v_prenex_39))) (store .cse44 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse44 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse45 v_prenex_38))))) (select .cse43 (select (select .cse43 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2))) (+ .cse47 4))) (= .cse47 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_38) (not (= (select v_prenex_39 4) 0)))))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_37 Int) (v_ArrVal_1190 (Array Int Int)) (v_prenex_33 Int) (v_prenex_35 Int) (v_prenex_36 (Array Int Int)) (v_prenex_34 (Array Int Int))) (let ((.cse53 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse51 (let ((.cse55 (store (let ((.cse56 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse56 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse56 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse53 v_prenex_35))) v_prenex_33 v_prenex_36))) (store .cse55 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse55 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse53 0))))) (let ((.cse50 (select (select .cse51 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2))) (or (not (= (select v_prenex_34 4) 0)) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_33) (= .cse50 0) (= (select (select .cse51 (select (select (let ((.cse52 (store (let ((.cse54 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse54 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse54 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse53 v_prenex_37))) v_prenex_33 v_prenex_34))) (store .cse52 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse52 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse53 v_prenex_33))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2)) (+ .cse50 4)) 0) (not (= (select v_prenex_36 4) 0))))))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (|v_ULTIMATE.start_main_~n~0#1.base_24| Int) (v_ArrVal_1194 Int) (v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_1192 Int)) (let ((.cse60 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse58 (select (select (let ((.cse62 (store (let ((.cse63 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse63 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse63 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse60 v_ArrVal_1192))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_6))) (store .cse62 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse62 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse60 |v_ULTIMATE.start_main_~n~0#1.base_24|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2))) (or (= (let ((.cse57 (let ((.cse59 (store (let ((.cse61 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse61 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse61 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse60 v_ArrVal_1194))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_7))) (store .cse59 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse59 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse60 0))))) (select (select .cse57 .cse58) (+ (select (select .cse57 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2) 4))) 0) (not (= 0 (select v_arrayElimArr_7 4))) (not (= (select v_arrayElimArr_6 4) 0)) (= .cse58 0) (= |v_ULTIMATE.start_main_~n~0#1.base_24| |c_ULTIMATE.start_main_~tail~0#1.base|))))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|v_ULTIMATE.start_main_~n~0#1.base_24| Int) (v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_1194 Int) (v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_1192 Int)) (let ((.cse67 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse65 (select (select (let ((.cse69 (store (let ((.cse70 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse70 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse70 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse67 v_ArrVal_1192))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_6))) (store .cse69 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse69 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse67 |v_ULTIMATE.start_main_~n~0#1.base_24|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2))) (or (= (let ((.cse64 (let ((.cse66 (store (let ((.cse68 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse68 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse68 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse67 v_ArrVal_1194))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_7))) (store .cse66 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse66 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse67 0))))) (select (select .cse64 .cse65) (+ (select (select .cse64 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2) 4))) 0) (not (= 0 (select v_arrayElimArr_7 4))) (not (= (select v_arrayElimArr_6 4) 0)) (= .cse65 0) (= |v_ULTIMATE.start_main_~n~0#1.base_24| |c_ULTIMATE.start_main_~tail~0#1.base|))))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))))) is different from false [2022-11-02 20:55:38,127 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (and (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (v_prenex_45 Int) (v_prenex_47 Int) (v_prenex_46 (Array Int Int)) (v_prenex_43 Int) (v_prenex_44 (Array Int Int))) (let ((.cse3 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse0 (let ((.cse6 (store (let ((.cse7 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse7 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse3 v_prenex_47))) v_prenex_43 v_prenex_44))) (store .cse6 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse3 v_prenex_43))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5))) (or (not (= (select v_prenex_46 4) 0)) (= (select (select .cse0 .cse1) (+ (select (select (let ((.cse2 (store (let ((.cse4 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse4 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse3 v_prenex_45))) v_prenex_43 v_prenex_46))) (store .cse2 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse3 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5) 4)) 0) (not (= (select v_prenex_44 4) 0)) (= .cse1 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_43)))))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (or (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0) (and (forall ((v_arrayElimArr_6 (Array Int Int)) (|v_ULTIMATE.start_main_~n~0#1.base_24| Int) (v_ArrVal_1194 Int) (v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_1192 Int)) (let ((.cse11 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse9 (select (select (let ((.cse13 (store (let ((.cse14 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse14 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse11 v_ArrVal_1192))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_6))) (store .cse13 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse11 |v_ULTIMATE.start_main_~n~0#1.base_24|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5))) (or (= (let ((.cse8 (let ((.cse10 (store (let ((.cse12 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse12 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse11 v_ArrVal_1194))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_7))) (store .cse10 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse11 0))))) (select (select .cse8 .cse9) (+ (select (select .cse8 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5) 4))) 0) (not (= 0 (select v_arrayElimArr_7 4))) (not (= (select v_arrayElimArr_6 4) 0)) (= .cse9 0) (= |v_ULTIMATE.start_main_~n~0#1.base_24| |c_ULTIMATE.start_main_~tail~0#1.base|))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_24| Int) (v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_1194 Int) (v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_1192 Int)) (let ((.cse18 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse16 (select (select (let ((.cse20 (store (let ((.cse21 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse21 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse21 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse18 v_ArrVal_1192))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_6))) (store .cse20 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse20 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse18 |v_ULTIMATE.start_main_~n~0#1.base_24|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5))) (or (= (let ((.cse15 (let ((.cse17 (store (let ((.cse19 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse19 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse19 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse18 v_ArrVal_1194))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_7))) (store .cse17 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse18 0))))) (select (select .cse15 .cse16) (+ (select (select .cse15 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5) 4))) 0) (not (= 0 (select v_arrayElimArr_7 4))) (not (= (select v_arrayElimArr_6 4) 0)) (= .cse16 0) (= |v_ULTIMATE.start_main_~n~0#1.base_24| |c_ULTIMATE.start_main_~tail~0#1.base|))))) (forall ((v_prenex_38 Int) (v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (v_prenex_42 Int) (v_prenex_39 (Array Int Int))) (let ((.cse24 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse26 (select (select (let ((.cse27 (store (let ((.cse28 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse28 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse28 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse24 v_prenex_40))) v_prenex_38 v_prenex_41))) (store .cse27 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse27 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse24 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5))) (or (not (= (select v_prenex_41 4) 0)) (= 0 (select (let ((.cse22 (let ((.cse23 (store (let ((.cse25 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse25 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse25 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse24 v_prenex_42))) v_prenex_38 v_prenex_39))) (store .cse23 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse23 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse24 v_prenex_38))))) (select .cse22 (select (select .cse22 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5))) (+ .cse26 4))) (= .cse26 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_38) (not (= (select v_prenex_39 4) 0)))))) (forall ((v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (v_prenex_45 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_47 Int) (v_prenex_46 (Array Int Int)) (v_prenex_43 Int) (v_prenex_44 (Array Int Int))) (let ((.cse32 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse29 (let ((.cse34 (store (let ((.cse35 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse35 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse35 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse32 v_prenex_47))) v_prenex_43 v_prenex_44))) (store .cse34 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse34 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse32 v_prenex_43))))) (let ((.cse30 (select (select .cse29 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5))) (or (not (= (select v_prenex_46 4) 0)) (= (select (select .cse29 .cse30) (+ (select (select (let ((.cse31 (store (let ((.cse33 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse33 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse33 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse32 v_prenex_45))) v_prenex_43 v_prenex_46))) (store .cse31 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse31 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse32 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5) 4)) 0) (not (= (select v_prenex_44 4) 0)) (= .cse30 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_43)))))) (forall ((v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_37 Int) (v_ArrVal_1190 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_33 Int) (v_prenex_35 Int) (v_prenex_36 (Array Int Int)) (v_prenex_34 (Array Int Int))) (let ((.cse39 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse37 (let ((.cse41 (store (let ((.cse42 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse42 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse42 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse39 v_prenex_35))) v_prenex_33 v_prenex_36))) (store .cse41 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse41 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse39 0))))) (let ((.cse36 (select (select .cse37 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5))) (or (not (= (select v_prenex_34 4) 0)) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_33) (= .cse36 0) (= (select (select .cse37 (select (select (let ((.cse38 (store (let ((.cse40 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse40 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse40 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse39 v_prenex_37))) v_prenex_33 v_prenex_34))) (store .cse38 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse38 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse39 v_prenex_33))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5)) (+ .cse36 4)) 0) (not (= (select v_prenex_36 4) 0))))))))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((v_prenex_38 Int) (v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (v_prenex_42 Int) (v_prenex_39 (Array Int Int))) (let ((.cse45 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse47 (select (select (let ((.cse48 (store (let ((.cse49 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse49 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse49 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse45 v_prenex_40))) v_prenex_38 v_prenex_41))) (store .cse48 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse48 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse45 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5))) (or (not (= (select v_prenex_41 4) 0)) (= 0 (select (let ((.cse43 (let ((.cse44 (store (let ((.cse46 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse46 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse46 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse45 v_prenex_42))) v_prenex_38 v_prenex_39))) (store .cse44 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse44 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse45 v_prenex_38))))) (select .cse43 (select (select .cse43 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5))) (+ .cse47 4))) (= .cse47 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_38) (not (= (select v_prenex_39 4) 0)))))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_37 Int) (v_ArrVal_1190 (Array Int Int)) (v_prenex_33 Int) (v_prenex_35 Int) (v_prenex_36 (Array Int Int)) (v_prenex_34 (Array Int Int))) (let ((.cse53 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse51 (let ((.cse55 (store (let ((.cse56 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse56 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse56 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse53 v_prenex_35))) v_prenex_33 v_prenex_36))) (store .cse55 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse55 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse53 0))))) (let ((.cse50 (select (select .cse51 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5))) (or (not (= (select v_prenex_34 4) 0)) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_33) (= .cse50 0) (= (select (select .cse51 (select (select (let ((.cse52 (store (let ((.cse54 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse54 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse54 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse53 v_prenex_37))) v_prenex_33 v_prenex_34))) (store .cse52 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse52 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse53 v_prenex_33))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5)) (+ .cse50 4)) 0) (not (= (select v_prenex_36 4) 0))))))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (|v_ULTIMATE.start_main_~n~0#1.base_24| Int) (v_ArrVal_1194 Int) (v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_1192 Int)) (let ((.cse60 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse58 (select (select (let ((.cse62 (store (let ((.cse63 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse63 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse63 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse60 v_ArrVal_1192))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_6))) (store .cse62 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse62 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse60 |v_ULTIMATE.start_main_~n~0#1.base_24|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5))) (or (= (let ((.cse57 (let ((.cse59 (store (let ((.cse61 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse61 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse61 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse60 v_ArrVal_1194))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_7))) (store .cse59 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse59 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse60 0))))) (select (select .cse57 .cse58) (+ (select (select .cse57 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5) 4))) 0) (not (= 0 (select v_arrayElimArr_7 4))) (not (= (select v_arrayElimArr_6 4) 0)) (= .cse58 0) (= |v_ULTIMATE.start_main_~n~0#1.base_24| |c_ULTIMATE.start_main_~tail~0#1.base|))))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|v_ULTIMATE.start_main_~n~0#1.base_24| Int) (v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_1194 Int) (v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_1192 Int)) (let ((.cse67 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse65 (select (select (let ((.cse69 (store (let ((.cse70 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse70 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse70 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse67 v_ArrVal_1192))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_6))) (store .cse69 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse69 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse67 |v_ULTIMATE.start_main_~n~0#1.base_24|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5))) (or (= (let ((.cse64 (let ((.cse66 (store (let ((.cse68 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse68 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse68 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse67 v_ArrVal_1194))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_7))) (store .cse66 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse66 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse67 0))))) (select (select .cse64 .cse65) (+ (select (select .cse64 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5) 4))) 0) (not (= 0 (select v_arrayElimArr_7 4))) (not (= (select v_arrayElimArr_6 4) 0)) (= .cse65 0) (= |v_ULTIMATE.start_main_~n~0#1.base_24| |c_ULTIMATE.start_main_~tail~0#1.base|))))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))))) is different from false [2022-11-02 20:55:39,854 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (and (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((v_prenex_38 Int) (v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (v_prenex_42 Int) (v_prenex_39 (Array Int Int))) (let ((.cse3 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse5 (select (store (select (store (let ((.cse6 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse6 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3 v_prenex_40))) v_prenex_38 v_prenex_41) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3 0) .cse2))) (or (= (select (let ((.cse0 (store (let ((.cse4 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse4 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3 v_prenex_42))) v_prenex_38 v_prenex_39))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3 v_prenex_38))) (select (store .cse0 |c_ULTIMATE.start_main_~#list~0#1.base| .cse1) (select .cse1 .cse2)))) (+ .cse5 4)) 0) (not (= (select v_prenex_41 4) 0)) (= v_prenex_38 |c_ULTIMATE.start_main_~#list~0#1.base|) (not (= (select v_prenex_39 4) 0)) (= .cse5 0))))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_37 Int) (v_ArrVal_1190 (Array Int Int)) (v_prenex_33 Int) (v_prenex_35 Int) (v_prenex_36 (Array Int Int)) (v_prenex_34 (Array Int Int))) (let ((.cse10 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse7 (store (let ((.cse12 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse12 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse10 v_prenex_35))) v_prenex_33 v_prenex_36))) (let ((.cse8 (store (select .cse7 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse10 0))) (let ((.cse11 (select .cse8 .cse2))) (or (not (= (select v_prenex_34 4) 0)) (= v_prenex_33 |c_ULTIMATE.start_main_~#list~0#1.base|) (= (select (select (store .cse7 |c_ULTIMATE.start_main_~#list~0#1.base| .cse8) (select (store (select (store (let ((.cse9 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse9 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse10 v_prenex_37))) v_prenex_33 v_prenex_34) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse10 v_prenex_33) .cse2)) (+ .cse11 4)) 0) (= .cse11 0) (not (= (select v_prenex_36 4) 0)))))))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (v_prenex_45 Int) (v_prenex_47 Int) (v_prenex_46 (Array Int Int)) (v_prenex_43 Int) (v_prenex_44 (Array Int Int))) (let ((.cse17 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse14 (store (let ((.cse18 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse18 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse18 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse17 v_prenex_47))) v_prenex_43 v_prenex_44))) (let ((.cse15 (store (select .cse14 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse17 v_prenex_43))) (let ((.cse13 (select .cse15 .cse2))) (or (not (= (select v_prenex_46 4) 0)) (= .cse13 0) (= v_prenex_43 |c_ULTIMATE.start_main_~#list~0#1.base|) (not (= (select v_prenex_44 4) 0)) (= (select (select (store .cse14 |c_ULTIMATE.start_main_~#list~0#1.base| .cse15) .cse13) (+ (select (store (select (store (let ((.cse16 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse16 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse16 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse17 v_prenex_45))) v_prenex_43 v_prenex_46) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse17 0) .cse2) 4)) 0))))))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|v_ULTIMATE.start_main_~n~0#1.base_24| Int) (v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_1194 Int) (v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_1192 Int)) (let ((.cse22 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse19 (select (store (select (store (let ((.cse24 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse24 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse24 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse22 v_ArrVal_1192))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse22 |v_ULTIMATE.start_main_~n~0#1.base_24|) .cse2))) (or (= .cse19 0) (not (= 0 (select v_arrayElimArr_7 4))) (not (= (select v_arrayElimArr_6 4) 0)) (= (let ((.cse20 (store (let ((.cse23 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse23 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse23 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse22 v_ArrVal_1194))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_7))) (let ((.cse21 (store (select .cse20 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse22 0))) (select (select (store .cse20 |c_ULTIMATE.start_main_~#list~0#1.base| .cse21) .cse19) (+ (select .cse21 .cse2) 4)))) 0) (= |v_ULTIMATE.start_main_~n~0#1.base_24| |c_ULTIMATE.start_main_~#list~0#1.base|))))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (|v_ULTIMATE.start_main_~n~0#1.base_24| Int) (v_ArrVal_1194 Int) (v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_1192 Int)) (let ((.cse28 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse25 (select (store (select (store (let ((.cse30 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse30 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse30 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse28 v_ArrVal_1192))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse28 |v_ULTIMATE.start_main_~n~0#1.base_24|) .cse2))) (or (= .cse25 0) (not (= 0 (select v_arrayElimArr_7 4))) (not (= (select v_arrayElimArr_6 4) 0)) (= (let ((.cse26 (store (let ((.cse29 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse29 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse29 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse28 v_ArrVal_1194))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_7))) (let ((.cse27 (store (select .cse26 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse28 0))) (select (select (store .cse26 |c_ULTIMATE.start_main_~#list~0#1.base| .cse27) .cse25) (+ (select .cse27 .cse2) 4)))) 0) (= |v_ULTIMATE.start_main_~n~0#1.base_24| |c_ULTIMATE.start_main_~#list~0#1.base|))))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (or (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0) (and (forall ((v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (v_prenex_45 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_47 Int) (v_prenex_46 (Array Int Int)) (v_prenex_43 Int) (v_prenex_44 (Array Int Int))) (let ((.cse35 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse32 (store (let ((.cse36 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse36 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse36 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse35 v_prenex_47))) v_prenex_43 v_prenex_44))) (let ((.cse33 (store (select .cse32 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse35 v_prenex_43))) (let ((.cse31 (select .cse33 .cse2))) (or (not (= (select v_prenex_46 4) 0)) (= .cse31 0) (= v_prenex_43 |c_ULTIMATE.start_main_~#list~0#1.base|) (not (= (select v_prenex_44 4) 0)) (= (select (select (store .cse32 |c_ULTIMATE.start_main_~#list~0#1.base| .cse33) .cse31) (+ (select (store (select (store (let ((.cse34 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse34 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse34 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse35 v_prenex_45))) v_prenex_43 v_prenex_46) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse35 0) .cse2) 4)) 0))))))) (forall ((v_arrayElimArr_6 (Array Int Int)) (|v_ULTIMATE.start_main_~n~0#1.base_24| Int) (v_ArrVal_1194 Int) (v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_1192 Int)) (let ((.cse40 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse37 (select (store (select (store (let ((.cse42 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse42 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse42 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse40 v_ArrVal_1192))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse40 |v_ULTIMATE.start_main_~n~0#1.base_24|) .cse2))) (or (= .cse37 0) (not (= 0 (select v_arrayElimArr_7 4))) (not (= (select v_arrayElimArr_6 4) 0)) (= (let ((.cse38 (store (let ((.cse41 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse41 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse41 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse40 v_ArrVal_1194))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_7))) (let ((.cse39 (store (select .cse38 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse40 0))) (select (select (store .cse38 |c_ULTIMATE.start_main_~#list~0#1.base| .cse39) .cse37) (+ (select .cse39 .cse2) 4)))) 0) (= |v_ULTIMATE.start_main_~n~0#1.base_24| |c_ULTIMATE.start_main_~#list~0#1.base|))))) (forall ((v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_37 Int) (v_ArrVal_1190 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_33 Int) (v_prenex_35 Int) (v_prenex_36 (Array Int Int)) (v_prenex_34 (Array Int Int))) (let ((.cse46 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse43 (store (let ((.cse48 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse48 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse48 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse46 v_prenex_35))) v_prenex_33 v_prenex_36))) (let ((.cse44 (store (select .cse43 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse46 0))) (let ((.cse47 (select .cse44 .cse2))) (or (not (= (select v_prenex_34 4) 0)) (= v_prenex_33 |c_ULTIMATE.start_main_~#list~0#1.base|) (= (select (select (store .cse43 |c_ULTIMATE.start_main_~#list~0#1.base| .cse44) (select (store (select (store (let ((.cse45 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse45 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse45 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse46 v_prenex_37))) v_prenex_33 v_prenex_34) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse46 v_prenex_33) .cse2)) (+ .cse47 4)) 0) (= .cse47 0) (not (= (select v_prenex_36 4) 0)))))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_24| Int) (v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_1194 Int) (v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_1192 Int)) (let ((.cse52 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse49 (select (store (select (store (let ((.cse54 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse54 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse54 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse52 v_ArrVal_1192))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse52 |v_ULTIMATE.start_main_~n~0#1.base_24|) .cse2))) (or (= .cse49 0) (not (= 0 (select v_arrayElimArr_7 4))) (not (= (select v_arrayElimArr_6 4) 0)) (= (let ((.cse50 (store (let ((.cse53 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse53 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse53 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse52 v_ArrVal_1194))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_7))) (let ((.cse51 (store (select .cse50 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse52 0))) (select (select (store .cse50 |c_ULTIMATE.start_main_~#list~0#1.base| .cse51) .cse49) (+ (select .cse51 .cse2) 4)))) 0) (= |v_ULTIMATE.start_main_~n~0#1.base_24| |c_ULTIMATE.start_main_~#list~0#1.base|))))) (forall ((v_prenex_38 Int) (v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (v_prenex_42 Int) (v_prenex_39 (Array Int Int))) (let ((.cse57 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse59 (select (store (select (store (let ((.cse60 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse60 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse60 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse57 v_prenex_40))) v_prenex_38 v_prenex_41) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse57 0) .cse2))) (or (= (select (let ((.cse55 (store (let ((.cse58 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse58 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse58 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse57 v_prenex_42))) v_prenex_38 v_prenex_39))) (let ((.cse56 (store (select .cse55 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse57 v_prenex_38))) (select (store .cse55 |c_ULTIMATE.start_main_~#list~0#1.base| .cse56) (select .cse56 .cse2)))) (+ .cse59 4)) 0) (not (= (select v_prenex_41 4) 0)) (= v_prenex_38 |c_ULTIMATE.start_main_~#list~0#1.base|) (not (= (select v_prenex_39 4) 0)) (= .cse59 0))))))))) is different from false [2022-11-02 20:55:40,275 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 20:55:40,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 197 treesize of output 1 [2022-11-02 20:55:40,290 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 20:55:40,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 197 treesize of output 1 [2022-11-02 20:55:40,310 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:55:40,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 197 treesize of output 148 [2022-11-02 20:55:40,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:55:40,319 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:55:40,349 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:55:40,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5666 treesize of output 5470 [2022-11-02 20:55:40,387 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:55:40,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 5519 treesize of output 4289 [2022-11-02 20:55:40,406 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:55:40,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4914 treesize of output 4788 [2022-11-02 20:55:40,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5575 treesize of output 5327 [2022-11-02 20:55:40,531 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:55:40,562 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:55:40,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:55:40,567 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:55:40,594 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:55:40,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 6356 treesize of output 5020 [2022-11-02 20:55:40,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5849 treesize of output 5453 [2022-11-02 20:55:40,808 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:55:40,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2744 treesize of output 2646 [2022-11-02 20:55:41,683 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 20:55:41,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 251 treesize of output 1 [2022-11-02 20:55:41,690 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-11-02 20:55:41,703 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 20:55:41,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 251 treesize of output 1 [2022-11-02 20:55:41,709 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-02 20:55:41,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803005957] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:55:41,710 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:55:41,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21, 23] total 53 [2022-11-02 20:55:41,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156674510] [2022-11-02 20:55:41,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:55:41,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-11-02 20:55:41,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:41,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-11-02 20:55:41,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2244, Unknown=11, NotChecked=294, Total=2756 [2022-11-02 20:55:41,712 INFO L87 Difference]: Start difference. First operand 320 states and 411 transitions. Second operand has 53 states, 50 states have (on average 1.56) internal successors, (78), 47 states have internal predecessors, (78), 7 states have call successors, (7), 7 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:41,835 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse25 (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0)) (.cse0 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (and (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0)) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((v_prenex_38 Int) (v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (v_prenex_42 Int) (v_prenex_39 (Array Int Int))) (let ((.cse3 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse5 (select (store (select (store (let ((.cse6 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse6 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3 v_prenex_40))) v_prenex_38 v_prenex_41) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3 0) .cse0))) (or (= (select (let ((.cse1 (store (let ((.cse4 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse4 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3 v_prenex_42))) v_prenex_38 v_prenex_39))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3 v_prenex_38))) (select (store .cse1 |c_ULTIMATE.start_main_~#list~0#1.base| .cse2) (select .cse2 .cse0)))) (+ .cse5 4)) 0) (not (= (select v_prenex_41 4) 0)) (= v_prenex_38 |c_ULTIMATE.start_main_~#list~0#1.base|) (not (= (select v_prenex_39 4) 0)) (= .cse5 0))))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_37 Int) (v_ArrVal_1190 (Array Int Int)) (v_prenex_33 Int) (v_prenex_35 Int) (v_prenex_36 (Array Int Int)) (v_prenex_34 (Array Int Int))) (let ((.cse10 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse7 (store (let ((.cse12 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse12 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse10 v_prenex_35))) v_prenex_33 v_prenex_36))) (let ((.cse8 (store (select .cse7 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse10 0))) (let ((.cse11 (select .cse8 .cse0))) (or (not (= (select v_prenex_34 4) 0)) (= v_prenex_33 |c_ULTIMATE.start_main_~#list~0#1.base|) (= (select (select (store .cse7 |c_ULTIMATE.start_main_~#list~0#1.base| .cse8) (select (store (select (store (let ((.cse9 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse9 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse10 v_prenex_37))) v_prenex_33 v_prenex_34) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse10 v_prenex_33) .cse0)) (+ .cse11 4)) 0) (= .cse11 0) (not (= (select v_prenex_36 4) 0)))))))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (v_prenex_45 Int) (v_prenex_47 Int) (v_prenex_46 (Array Int Int)) (v_prenex_43 Int) (v_prenex_44 (Array Int Int))) (let ((.cse17 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse14 (store (let ((.cse18 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse18 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse18 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse17 v_prenex_47))) v_prenex_43 v_prenex_44))) (let ((.cse15 (store (select .cse14 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse17 v_prenex_43))) (let ((.cse13 (select .cse15 .cse0))) (or (not (= (select v_prenex_46 4) 0)) (= .cse13 0) (= v_prenex_43 |c_ULTIMATE.start_main_~#list~0#1.base|) (not (= (select v_prenex_44 4) 0)) (= (select (select (store .cse14 |c_ULTIMATE.start_main_~#list~0#1.base| .cse15) .cse13) (+ (select (store (select (store (let ((.cse16 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse16 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse16 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse17 v_prenex_45))) v_prenex_43 v_prenex_46) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse17 0) .cse0) 4)) 0))))))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) 0) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|v_ULTIMATE.start_main_~n~0#1.base_24| Int) (v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_1194 Int) (v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_1192 Int)) (let ((.cse22 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse19 (select (store (select (store (let ((.cse24 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse24 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse24 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse22 v_ArrVal_1192))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse22 |v_ULTIMATE.start_main_~n~0#1.base_24|) .cse0))) (or (= .cse19 0) (not (= 0 (select v_arrayElimArr_7 4))) (not (= (select v_arrayElimArr_6 4) 0)) (= (let ((.cse20 (store (let ((.cse23 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse23 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse23 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse22 v_ArrVal_1194))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_7))) (let ((.cse21 (store (select .cse20 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse22 0))) (select (select (store .cse20 |c_ULTIMATE.start_main_~#list~0#1.base| .cse21) .cse19) (+ (select .cse21 .cse0) 4)))) 0) (= |v_ULTIMATE.start_main_~n~0#1.base_24| |c_ULTIMATE.start_main_~#list~0#1.base|))))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) .cse25 (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (|v_ULTIMATE.start_main_~n~0#1.base_24| Int) (v_ArrVal_1194 Int) (v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_1192 Int)) (let ((.cse29 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse26 (select (store (select (store (let ((.cse31 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse31 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse31 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse29 v_ArrVal_1192))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse29 |v_ULTIMATE.start_main_~n~0#1.base_24|) .cse0))) (or (= .cse26 0) (not (= 0 (select v_arrayElimArr_7 4))) (not (= (select v_arrayElimArr_6 4) 0)) (= (let ((.cse27 (store (let ((.cse30 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse30 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse30 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse29 v_ArrVal_1194))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_7))) (let ((.cse28 (store (select .cse27 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse29 0))) (select (select (store .cse27 |c_ULTIMATE.start_main_~#list~0#1.base| .cse28) .cse26) (+ (select .cse28 .cse0) 4)))) 0) (= |v_ULTIMATE.start_main_~n~0#1.base_24| |c_ULTIMATE.start_main_~#list~0#1.base|))))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (or .cse25 (and (forall ((v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (v_prenex_45 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_47 Int) (v_prenex_46 (Array Int Int)) (v_prenex_43 Int) (v_prenex_44 (Array Int Int))) (let ((.cse36 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse33 (store (let ((.cse37 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse37 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse37 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse36 v_prenex_47))) v_prenex_43 v_prenex_44))) (let ((.cse34 (store (select .cse33 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse36 v_prenex_43))) (let ((.cse32 (select .cse34 .cse0))) (or (not (= (select v_prenex_46 4) 0)) (= .cse32 0) (= v_prenex_43 |c_ULTIMATE.start_main_~#list~0#1.base|) (not (= (select v_prenex_44 4) 0)) (= (select (select (store .cse33 |c_ULTIMATE.start_main_~#list~0#1.base| .cse34) .cse32) (+ (select (store (select (store (let ((.cse35 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse35 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse35 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse36 v_prenex_45))) v_prenex_43 v_prenex_46) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse36 0) .cse0) 4)) 0))))))) (forall ((v_arrayElimArr_6 (Array Int Int)) (|v_ULTIMATE.start_main_~n~0#1.base_24| Int) (v_ArrVal_1194 Int) (v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_1192 Int)) (let ((.cse41 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse38 (select (store (select (store (let ((.cse43 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse43 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse43 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse41 v_ArrVal_1192))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse41 |v_ULTIMATE.start_main_~n~0#1.base_24|) .cse0))) (or (= .cse38 0) (not (= 0 (select v_arrayElimArr_7 4))) (not (= (select v_arrayElimArr_6 4) 0)) (= (let ((.cse39 (store (let ((.cse42 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse42 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse42 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse41 v_ArrVal_1194))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_7))) (let ((.cse40 (store (select .cse39 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse41 0))) (select (select (store .cse39 |c_ULTIMATE.start_main_~#list~0#1.base| .cse40) .cse38) (+ (select .cse40 .cse0) 4)))) 0) (= |v_ULTIMATE.start_main_~n~0#1.base_24| |c_ULTIMATE.start_main_~#list~0#1.base|))))) (forall ((v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_37 Int) (v_ArrVal_1190 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_33 Int) (v_prenex_35 Int) (v_prenex_36 (Array Int Int)) (v_prenex_34 (Array Int Int))) (let ((.cse47 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse44 (store (let ((.cse49 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse49 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse49 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse47 v_prenex_35))) v_prenex_33 v_prenex_36))) (let ((.cse45 (store (select .cse44 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse47 0))) (let ((.cse48 (select .cse45 .cse0))) (or (not (= (select v_prenex_34 4) 0)) (= v_prenex_33 |c_ULTIMATE.start_main_~#list~0#1.base|) (= (select (select (store .cse44 |c_ULTIMATE.start_main_~#list~0#1.base| .cse45) (select (store (select (store (let ((.cse46 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse46 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse46 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse47 v_prenex_37))) v_prenex_33 v_prenex_34) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse47 v_prenex_33) .cse0)) (+ .cse48 4)) 0) (= .cse48 0) (not (= (select v_prenex_36 4) 0)))))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_24| Int) (v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_1194 Int) (v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_1192 Int)) (let ((.cse53 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse50 (select (store (select (store (let ((.cse55 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse55 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse55 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse53 v_ArrVal_1192))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse53 |v_ULTIMATE.start_main_~n~0#1.base_24|) .cse0))) (or (= .cse50 0) (not (= 0 (select v_arrayElimArr_7 4))) (not (= (select v_arrayElimArr_6 4) 0)) (= (let ((.cse51 (store (let ((.cse54 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse54 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse54 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse53 v_ArrVal_1194))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_7))) (let ((.cse52 (store (select .cse51 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse53 0))) (select (select (store .cse51 |c_ULTIMATE.start_main_~#list~0#1.base| .cse52) .cse50) (+ (select .cse52 .cse0) 4)))) 0) (= |v_ULTIMATE.start_main_~n~0#1.base_24| |c_ULTIMATE.start_main_~#list~0#1.base|))))) (forall ((v_prenex_38 Int) (v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (v_prenex_42 Int) (v_prenex_39 (Array Int Int))) (let ((.cse58 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse60 (select (store (select (store (let ((.cse61 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse61 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse61 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse58 v_prenex_40))) v_prenex_38 v_prenex_41) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse58 0) .cse0))) (or (= (select (let ((.cse56 (store (let ((.cse59 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse59 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse59 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse58 v_prenex_42))) v_prenex_38 v_prenex_39))) (let ((.cse57 (store (select .cse56 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse58 v_prenex_38))) (select (store .cse56 |c_ULTIMATE.start_main_~#list~0#1.base| .cse57) (select .cse57 .cse0)))) (+ .cse60 4)) 0) (not (= (select v_prenex_41 4) 0)) (= v_prenex_38 |c_ULTIMATE.start_main_~#list~0#1.base|) (not (= (select v_prenex_39 4) 0)) (= .cse60 0))))))))) is different from false [2022-11-02 20:55:41,960 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0)) (.cse0 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (and (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0)) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (v_prenex_45 Int) (v_prenex_47 Int) (v_prenex_46 (Array Int Int)) (v_prenex_43 Int) (v_prenex_44 (Array Int Int))) (let ((.cse4 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse1 (let ((.cse6 (store (let ((.cse7 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse7 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse4 v_prenex_47))) v_prenex_43 v_prenex_44))) (store .cse6 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse4 v_prenex_43))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0))) (or (not (= (select v_prenex_46 4) 0)) (= (select (select .cse1 .cse2) (+ (select (select (let ((.cse3 (store (let ((.cse5 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse5 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse4 v_prenex_45))) v_prenex_43 v_prenex_46))) (store .cse3 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse4 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) 4)) 0) (not (= (select v_prenex_44 4) 0)) (= .cse2 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_43)))))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (or .cse8 (and (forall ((v_arrayElimArr_6 (Array Int Int)) (|v_ULTIMATE.start_main_~n~0#1.base_24| Int) (v_ArrVal_1194 Int) (v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_1192 Int)) (let ((.cse12 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse10 (select (select (let ((.cse14 (store (let ((.cse15 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse15 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse15 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse12 v_ArrVal_1192))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_6))) (store .cse14 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse12 |v_ULTIMATE.start_main_~n~0#1.base_24|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0))) (or (= (let ((.cse9 (let ((.cse11 (store (let ((.cse13 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse13 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse12 v_ArrVal_1194))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_7))) (store .cse11 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse12 0))))) (select (select .cse9 .cse10) (+ (select (select .cse9 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) 4))) 0) (not (= 0 (select v_arrayElimArr_7 4))) (not (= (select v_arrayElimArr_6 4) 0)) (= .cse10 0) (= |v_ULTIMATE.start_main_~n~0#1.base_24| |c_ULTIMATE.start_main_~tail~0#1.base|))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_24| Int) (v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_1194 Int) (v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_1192 Int)) (let ((.cse19 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse17 (select (select (let ((.cse21 (store (let ((.cse22 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse22 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse22 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse19 v_ArrVal_1192))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_6))) (store .cse21 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse21 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse19 |v_ULTIMATE.start_main_~n~0#1.base_24|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0))) (or (= (let ((.cse16 (let ((.cse18 (store (let ((.cse20 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse20 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse20 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse19 v_ArrVal_1194))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_7))) (store .cse18 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse18 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse19 0))))) (select (select .cse16 .cse17) (+ (select (select .cse16 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) 4))) 0) (not (= 0 (select v_arrayElimArr_7 4))) (not (= (select v_arrayElimArr_6 4) 0)) (= .cse17 0) (= |v_ULTIMATE.start_main_~n~0#1.base_24| |c_ULTIMATE.start_main_~tail~0#1.base|))))) (forall ((v_prenex_38 Int) (v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (v_prenex_42 Int) (v_prenex_39 (Array Int Int))) (let ((.cse25 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse27 (select (select (let ((.cse28 (store (let ((.cse29 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse29 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse29 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse25 v_prenex_40))) v_prenex_38 v_prenex_41))) (store .cse28 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse28 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse25 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0))) (or (not (= (select v_prenex_41 4) 0)) (= 0 (select (let ((.cse23 (let ((.cse24 (store (let ((.cse26 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse26 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse26 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse25 v_prenex_42))) v_prenex_38 v_prenex_39))) (store .cse24 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse24 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse25 v_prenex_38))))) (select .cse23 (select (select .cse23 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0))) (+ .cse27 4))) (= .cse27 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_38) (not (= (select v_prenex_39 4) 0)))))) (forall ((v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (v_prenex_45 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_47 Int) (v_prenex_46 (Array Int Int)) (v_prenex_43 Int) (v_prenex_44 (Array Int Int))) (let ((.cse33 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse30 (let ((.cse35 (store (let ((.cse36 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse36 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse36 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse33 v_prenex_47))) v_prenex_43 v_prenex_44))) (store .cse35 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse35 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse33 v_prenex_43))))) (let ((.cse31 (select (select .cse30 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0))) (or (not (= (select v_prenex_46 4) 0)) (= (select (select .cse30 .cse31) (+ (select (select (let ((.cse32 (store (let ((.cse34 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse34 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse34 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse33 v_prenex_45))) v_prenex_43 v_prenex_46))) (store .cse32 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse32 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse33 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) 4)) 0) (not (= (select v_prenex_44 4) 0)) (= .cse31 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_43)))))) (forall ((v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_37 Int) (v_ArrVal_1190 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_33 Int) (v_prenex_35 Int) (v_prenex_36 (Array Int Int)) (v_prenex_34 (Array Int Int))) (let ((.cse40 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse38 (let ((.cse42 (store (let ((.cse43 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse43 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse43 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse40 v_prenex_35))) v_prenex_33 v_prenex_36))) (store .cse42 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse42 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse40 0))))) (let ((.cse37 (select (select .cse38 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0))) (or (not (= (select v_prenex_34 4) 0)) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_33) (= .cse37 0) (= (select (select .cse38 (select (select (let ((.cse39 (store (let ((.cse41 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse41 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse41 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse40 v_prenex_37))) v_prenex_33 v_prenex_34))) (store .cse39 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse39 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse40 v_prenex_33))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0)) (+ .cse37 4)) 0) (not (= (select v_prenex_36 4) 0))))))))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((v_prenex_38 Int) (v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (v_prenex_42 Int) (v_prenex_39 (Array Int Int))) (let ((.cse46 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse48 (select (select (let ((.cse49 (store (let ((.cse50 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse50 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse50 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse46 v_prenex_40))) v_prenex_38 v_prenex_41))) (store .cse49 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse49 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse46 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0))) (or (not (= (select v_prenex_41 4) 0)) (= 0 (select (let ((.cse44 (let ((.cse45 (store (let ((.cse47 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse47 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse47 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse46 v_prenex_42))) v_prenex_38 v_prenex_39))) (store .cse45 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse45 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse46 v_prenex_38))))) (select .cse44 (select (select .cse44 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0))) (+ .cse48 4))) (= .cse48 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_38) (not (= (select v_prenex_39 4) 0)))))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) 0) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_37 Int) (v_ArrVal_1190 (Array Int Int)) (v_prenex_33 Int) (v_prenex_35 Int) (v_prenex_36 (Array Int Int)) (v_prenex_34 (Array Int Int))) (let ((.cse54 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse52 (let ((.cse56 (store (let ((.cse57 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse57 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse57 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse54 v_prenex_35))) v_prenex_33 v_prenex_36))) (store .cse56 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse56 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse54 0))))) (let ((.cse51 (select (select .cse52 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0))) (or (not (= (select v_prenex_34 4) 0)) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_33) (= .cse51 0) (= (select (select .cse52 (select (select (let ((.cse53 (store (let ((.cse55 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse55 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse55 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse54 v_prenex_37))) v_prenex_33 v_prenex_34))) (store .cse53 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse53 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse54 v_prenex_33))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0)) (+ .cse51 4)) 0) (not (= (select v_prenex_36 4) 0))))))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (= |c_ULTIMATE.start_main_~tail~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (|v_ULTIMATE.start_main_~n~0#1.base_24| Int) (v_ArrVal_1194 Int) (v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_1192 Int)) (let ((.cse61 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse59 (select (select (let ((.cse63 (store (let ((.cse64 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse64 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse64 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse61 v_ArrVal_1192))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_6))) (store .cse63 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse63 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse61 |v_ULTIMATE.start_main_~n~0#1.base_24|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0))) (or (= (let ((.cse58 (let ((.cse60 (store (let ((.cse62 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse62 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse62 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse61 v_ArrVal_1194))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_7))) (store .cse60 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse60 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse61 0))))) (select (select .cse58 .cse59) (+ (select (select .cse58 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) 4))) 0) (not (= 0 (select v_arrayElimArr_7 4))) (not (= (select v_arrayElimArr_6 4) 0)) (= .cse59 0) (= |v_ULTIMATE.start_main_~n~0#1.base_24| |c_ULTIMATE.start_main_~tail~0#1.base|))))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (= |c_ULTIMATE.start_main_~tail~0#1.offset| |c_ULTIMATE.start_main_~#list~0#1.offset|) .cse8 (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|v_ULTIMATE.start_main_~n~0#1.base_24| Int) (v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_1194 Int) (v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_1192 Int)) (let ((.cse68 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse66 (select (select (let ((.cse70 (store (let ((.cse71 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse71 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse71 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse68 v_ArrVal_1192))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_6))) (store .cse70 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse70 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse68 |v_ULTIMATE.start_main_~n~0#1.base_24|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0))) (or (= (let ((.cse65 (let ((.cse67 (store (let ((.cse69 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse69 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse69 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse68 v_ArrVal_1194))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_7))) (store .cse67 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse67 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse68 0))))) (select (select .cse65 .cse66) (+ (select (select .cse65 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) 4))) 0) (not (= 0 (select v_arrayElimArr_7 4))) (not (= (select v_arrayElimArr_6 4) 0)) (= .cse66 0) (= |v_ULTIMATE.start_main_~n~0#1.base_24| |c_ULTIMATE.start_main_~tail~0#1.base|))))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))))) is different from false [2022-11-02 20:55:42,101 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (and (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0)) (or (= |c_ULTIMATE.start_main_~n~0#1.offset| |c_ULTIMATE.start_main_~#list~0#1.offset|) (and (forall ((v_arrayElimArr_6 (Array Int Int)) (|v_ULTIMATE.start_main_~n~0#1.base_24| Int) (v_ArrVal_1194 Int) (v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_1192 Int)) (let ((.cse4 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse2 (select (select (let ((.cse6 (store (let ((.cse7 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse7 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse4 v_ArrVal_1192))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_6))) (store .cse6 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse4 |v_ULTIMATE.start_main_~n~0#1.base_24|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0))) (or (= (let ((.cse1 (let ((.cse3 (store (let ((.cse5 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse5 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse4 v_ArrVal_1194))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_7))) (store .cse3 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse4 0))))) (select (select .cse1 .cse2) (+ (select (select .cse1 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) 4))) 0) (not (= 0 (select v_arrayElimArr_7 4))) (not (= (select v_arrayElimArr_6 4) 0)) (= .cse2 0) (= |v_ULTIMATE.start_main_~n~0#1.base_24| |c_ULTIMATE.start_main_~tail~0#1.base|))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_24| Int) (v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_1194 Int) (v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_1192 Int)) (let ((.cse11 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse9 (select (select (let ((.cse13 (store (let ((.cse14 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse14 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse11 v_ArrVal_1192))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_6))) (store .cse13 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse11 |v_ULTIMATE.start_main_~n~0#1.base_24|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0))) (or (= (let ((.cse8 (let ((.cse10 (store (let ((.cse12 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse12 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse11 v_ArrVal_1194))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_7))) (store .cse10 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse11 0))))) (select (select .cse8 .cse9) (+ (select (select .cse8 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) 4))) 0) (not (= 0 (select v_arrayElimArr_7 4))) (not (= (select v_arrayElimArr_6 4) 0)) (= .cse9 0) (= |v_ULTIMATE.start_main_~n~0#1.base_24| |c_ULTIMATE.start_main_~tail~0#1.base|))))) (forall ((v_prenex_38 Int) (v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (v_prenex_42 Int) (v_prenex_39 (Array Int Int))) (let ((.cse17 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse19 (select (select (let ((.cse20 (store (let ((.cse21 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse21 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse21 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse17 v_prenex_40))) v_prenex_38 v_prenex_41))) (store .cse20 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse20 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse17 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0))) (or (not (= (select v_prenex_41 4) 0)) (= 0 (select (let ((.cse15 (let ((.cse16 (store (let ((.cse18 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse18 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse18 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse17 v_prenex_42))) v_prenex_38 v_prenex_39))) (store .cse16 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse16 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse17 v_prenex_38))))) (select .cse15 (select (select .cse15 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0))) (+ .cse19 4))) (= .cse19 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_38) (not (= (select v_prenex_39 4) 0)))))) (forall ((v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (v_prenex_45 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_47 Int) (v_prenex_46 (Array Int Int)) (v_prenex_43 Int) (v_prenex_44 (Array Int Int))) (let ((.cse25 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse22 (let ((.cse27 (store (let ((.cse28 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse28 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse28 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse25 v_prenex_47))) v_prenex_43 v_prenex_44))) (store .cse27 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse27 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse25 v_prenex_43))))) (let ((.cse23 (select (select .cse22 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0))) (or (not (= (select v_prenex_46 4) 0)) (= (select (select .cse22 .cse23) (+ (select (select (let ((.cse24 (store (let ((.cse26 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse26 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse26 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse25 v_prenex_45))) v_prenex_43 v_prenex_46))) (store .cse24 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse24 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse25 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) 4)) 0) (not (= (select v_prenex_44 4) 0)) (= .cse23 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_43)))))) (forall ((v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_37 Int) (v_ArrVal_1190 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_33 Int) (v_prenex_35 Int) (v_prenex_36 (Array Int Int)) (v_prenex_34 (Array Int Int))) (let ((.cse32 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse30 (let ((.cse34 (store (let ((.cse35 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse35 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse35 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse32 v_prenex_35))) v_prenex_33 v_prenex_36))) (store .cse34 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse34 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse32 0))))) (let ((.cse29 (select (select .cse30 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0))) (or (not (= (select v_prenex_34 4) 0)) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_33) (= .cse29 0) (= (select (select .cse30 (select (select (let ((.cse31 (store (let ((.cse33 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse33 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse33 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse32 v_prenex_37))) v_prenex_33 v_prenex_34))) (store .cse31 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse31 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse32 v_prenex_33))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0)) (+ .cse29 4)) 0) (not (= (select v_prenex_36 4) 0))))))))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (v_prenex_45 Int) (v_prenex_47 Int) (v_prenex_46 (Array Int Int)) (v_prenex_43 Int) (v_prenex_44 (Array Int Int))) (let ((.cse39 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse36 (let ((.cse41 (store (let ((.cse42 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse42 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse42 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse39 v_prenex_47))) v_prenex_43 v_prenex_44))) (store .cse41 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse41 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse39 v_prenex_43))))) (let ((.cse37 (select (select .cse36 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0))) (or (not (= (select v_prenex_46 4) 0)) (= (select (select .cse36 .cse37) (+ (select (select (let ((.cse38 (store (let ((.cse40 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse40 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse40 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse39 v_prenex_45))) v_prenex_43 v_prenex_46))) (store .cse38 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse38 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse39 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) 4)) 0) (not (= (select v_prenex_44 4) 0)) (= .cse37 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_43)))))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((v_prenex_38 Int) (v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (v_prenex_42 Int) (v_prenex_39 (Array Int Int))) (let ((.cse45 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse47 (select (select (let ((.cse48 (store (let ((.cse49 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse49 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse49 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse45 v_prenex_40))) v_prenex_38 v_prenex_41))) (store .cse48 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse48 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse45 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0))) (or (not (= (select v_prenex_41 4) 0)) (= 0 (select (let ((.cse43 (let ((.cse44 (store (let ((.cse46 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse46 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse46 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse45 v_prenex_42))) v_prenex_38 v_prenex_39))) (store .cse44 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse44 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse45 v_prenex_38))))) (select .cse43 (select (select .cse43 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0))) (+ .cse47 4))) (= .cse47 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_38) (not (= (select v_prenex_39 4) 0)))))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) 0) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_37 Int) (v_ArrVal_1190 (Array Int Int)) (v_prenex_33 Int) (v_prenex_35 Int) (v_prenex_36 (Array Int Int)) (v_prenex_34 (Array Int Int))) (let ((.cse53 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse51 (let ((.cse55 (store (let ((.cse56 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse56 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse56 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse53 v_prenex_35))) v_prenex_33 v_prenex_36))) (store .cse55 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse55 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse53 0))))) (let ((.cse50 (select (select .cse51 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0))) (or (not (= (select v_prenex_34 4) 0)) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_33) (= .cse50 0) (= (select (select .cse51 (select (select (let ((.cse52 (store (let ((.cse54 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse54 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse54 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse53 v_prenex_37))) v_prenex_33 v_prenex_34))) (store .cse52 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse52 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse53 v_prenex_33))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0)) (+ .cse50 4)) 0) (not (= (select v_prenex_36 4) 0))))))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (= |c_ULTIMATE.start_main_~tail~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (|v_ULTIMATE.start_main_~n~0#1.base_24| Int) (v_ArrVal_1194 Int) (v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_1192 Int)) (let ((.cse60 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse58 (select (select (let ((.cse62 (store (let ((.cse63 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse63 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse63 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse60 v_ArrVal_1192))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_6))) (store .cse62 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse62 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse60 |v_ULTIMATE.start_main_~n~0#1.base_24|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0))) (or (= (let ((.cse57 (let ((.cse59 (store (let ((.cse61 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse61 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse61 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse60 v_ArrVal_1194))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_7))) (store .cse59 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse59 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse60 0))))) (select (select .cse57 .cse58) (+ (select (select .cse57 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) 4))) 0) (not (= 0 (select v_arrayElimArr_7 4))) (not (= (select v_arrayElimArr_6 4) 0)) (= .cse58 0) (= |v_ULTIMATE.start_main_~n~0#1.base_24| |c_ULTIMATE.start_main_~tail~0#1.base|))))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (= |c_ULTIMATE.start_main_~tail~0#1.offset| |c_ULTIMATE.start_main_~#list~0#1.offset|) (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0) (= |c_ULTIMATE.start_main_~n~0#1.offset| 0) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|v_ULTIMATE.start_main_~n~0#1.base_24| Int) (v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_1194 Int) (v_ArrVal_1191 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_1192 Int)) (let ((.cse67 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse65 (select (select (let ((.cse69 (store (let ((.cse70 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse70 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse70 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse67 v_ArrVal_1192))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_6))) (store .cse69 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse69 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse67 |v_ULTIMATE.start_main_~n~0#1.base_24|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0))) (or (= (let ((.cse64 (let ((.cse66 (store (let ((.cse68 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse68 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse68 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse67 v_ArrVal_1194))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_7))) (store .cse66 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse66 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse67 0))))) (select (select .cse64 .cse65) (+ (select (select .cse64 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) 4))) 0) (not (= 0 (select v_arrayElimArr_7 4))) (not (= (select v_arrayElimArr_6 4) 0)) (= .cse65 0) (= |v_ULTIMATE.start_main_~n~0#1.base_24| |c_ULTIMATE.start_main_~tail~0#1.base|))))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))))) is different from false [2022-11-02 20:55:45,319 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse37 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|)) (.cse40 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (let ((.cse11 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base|)) (.cse36 (select .cse40 .cse5)) (.cse0 (select .cse37 .cse5))) (let ((.cse1 (= |c_ULTIMATE.start_main_~#list~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse2 (= 0 .cse0)) (.cse32 (select |c_#memory_$Pointer$.base| .cse36)) (.cse35 (select |c_#memory_$Pointer$.offset| .cse36)) (.cse3 (select .cse11 (+ |c_ULTIMATE.start_main_~tail~0#1.offset| 4))) (.cse33 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~tail~0#1.base|) 1) (= |c_ULTIMATE.start_main_~x~0#1.offset| .cse0) (= |c_ULTIMATE.start_main_~n~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.offset|) (not (= |c_ULTIMATE.start_main_~tail~0#1.base| |c_ULTIMATE.start_main_~n~0#1.base|)) (or .cse1 .cse2) (= .cse3 0) (or (and (= |c_ULTIMATE.start_main_~n~0#1.offset| |c_ULTIMATE.start_main_~#list~0#1.offset|) (= |c_ULTIMATE.start_main_~#list~0#1.base| |c_ULTIMATE.start_main_~n~0#1.base|)) (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base|))) (and (forall ((v_prenex_38 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (v_prenex_42 Int) (v_prenex_39 (Array Int Int))) (let ((.cse7 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse9 (select (select (let ((.cse10 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse11 .cse7 v_prenex_40)) v_prenex_38 v_prenex_41))) (store .cse10 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse7 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5))) (or (= (select (let ((.cse4 (let ((.cse6 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse8 .cse7 v_prenex_42)) v_prenex_38 v_prenex_39))) (store .cse6 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse7 v_prenex_38))))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5))) (+ .cse9 4)) 0) (not (= (select v_prenex_41 4) 0)) (= .cse9 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_38) (not (= (select v_prenex_39 4) 0)))))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_37 Int) (v_prenex_33 Int) (v_prenex_35 Int) (v_prenex_36 (Array Int Int)) (v_prenex_34 (Array Int Int))) (let ((.cse14 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse12 (let ((.cse16 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse11 .cse14 v_prenex_35)) v_prenex_33 v_prenex_36))) (store .cse16 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse16 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse14 0))))) (let ((.cse15 (select (select .cse12 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5))) (or (not (= (select v_prenex_34 4) 0)) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_33) (= (select (select .cse12 (select (select (let ((.cse13 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse8 .cse14 v_prenex_37)) v_prenex_33 v_prenex_34))) (store .cse13 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse14 v_prenex_33))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5)) (+ .cse15 4)) 0) (= .cse15 0) (not (= (select v_prenex_36 4) 0))))))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_45 Int) (v_prenex_47 Int) (v_prenex_46 (Array Int Int)) (v_prenex_43 Int) (v_prenex_44 (Array Int Int))) (let ((.cse20 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse17 (let ((.cse21 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse8 .cse20 v_prenex_47)) v_prenex_43 v_prenex_44))) (store .cse21 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse21 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse20 v_prenex_43))))) (let ((.cse18 (select (select .cse17 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5))) (or (= 0 (select (select .cse17 .cse18) (+ (select (select (let ((.cse19 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse11 .cse20 v_prenex_45)) v_prenex_43 v_prenex_46))) (store .cse19 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse19 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse20 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5) 4))) (not (= (select v_prenex_46 4) 0)) (= .cse18 0) (not (= (select v_prenex_44 4) 0)) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_43)))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_24| Int) (v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_1194 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_1192 Int)) (let ((.cse25 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse22 (select (select (let ((.cse26 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse8 .cse25 v_ArrVal_1192)) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_6))) (store .cse26 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse26 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse25 |v_ULTIMATE.start_main_~n~0#1.base_24|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5))) (or (= .cse22 0) (= (let ((.cse23 (let ((.cse24 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse11 .cse25 v_ArrVal_1194)) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_7))) (store .cse24 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse24 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse25 0))))) (select (select .cse23 .cse22) (+ (select (select .cse23 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5) 4))) 0) (not (= 0 (select v_arrayElimArr_7 4))) (not (= (select v_arrayElimArr_6 4) 0)) (= |v_ULTIMATE.start_main_~n~0#1.base_24| |c_ULTIMATE.start_main_~tail~0#1.base|))))) (forall ((v_arrayElimArr_6 (Array Int Int)) (|v_ULTIMATE.start_main_~n~0#1.base_24| Int) (v_ArrVal_1194 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_1192 Int)) (let ((.cse30 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse27 (select (select (let ((.cse31 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse8 .cse30 v_ArrVal_1192)) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_6))) (store .cse31 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse31 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse30 |v_ULTIMATE.start_main_~n~0#1.base_24|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5))) (or (= .cse27 0) (= (let ((.cse28 (let ((.cse29 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse11 .cse30 v_ArrVal_1194)) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_7))) (store .cse29 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse29 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse30 0))))) (select (select .cse28 .cse27) (+ (select (select .cse28 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5) 4))) 0) (not (= 0 (select v_arrayElimArr_7 4))) (not (= (select v_arrayElimArr_6 4) 0)) (= |v_ULTIMATE.start_main_~n~0#1.base_24| |c_ULTIMATE.start_main_~tail~0#1.base|)))))))) (= (select .cse32 .cse5) 0) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base|) .cse33) |c_ULTIMATE.start_main_~x~0#1.offset|) (= |c_ULTIMATE.start_main_~tail~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|) (let ((.cse34 (exists ((|ULTIMATE.start_main_~tail~0#1.offset| Int)) (let ((.cse38 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse39 (select .cse40 .cse38))) (and (= (select .cse37 .cse38) 0) (not (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse39)) (= (select (select |c_#memory_$Pointer$.offset| .cse39) 4) 0) (= (select (select |c_#memory_$Pointer$.base| .cse39) 4) 0))))))) (or (and .cse1 .cse34) (and .cse2 (= 0 (select .cse35 4)) (= (select .cse32 4) 0) (not (= .cse36 |c_ULTIMATE.start_main_~#list~0#1.base|))) (and .cse34 (= .cse36 0)))) (= |c_ULTIMATE.start_main_~tail~0#1.offset| |c_ULTIMATE.start_main_~#list~0#1.offset|) (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0) (= |c_ULTIMATE.start_main_~n~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x~0#1.offset| (select .cse35 .cse5)) (= |c_ULTIMATE.start_main_~n~0#1.offset| .cse3) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse33) 0))))) is different from false [2022-11-02 20:55:58,046 WARN L234 SmtUtils]: Spent 6.10s on a formula simplification. DAG size of input: 56 DAG size of output: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:56:08,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:08,258 INFO L93 Difference]: Finished difference Result 462 states and 578 transitions. [2022-11-02 20:56:08,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-02 20:56:08,258 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 50 states have (on average 1.56) internal successors, (78), 47 states have internal predecessors, (78), 7 states have call successors, (7), 7 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-02 20:56:08,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:08,261 INFO L225 Difference]: With dead ends: 462 [2022-11-02 20:56:08,261 INFO L226 Difference]: Without dead ends: 462 [2022-11-02 20:56:08,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 38 SyntacticMatches, 7 SemanticMatches, 77 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1432 ImplicationChecksByTransitivity, 62.9s TimeCoverageRelationStatistics Valid=508, Invalid=4616, Unknown=16, NotChecked=1022, Total=6162 [2022-11-02 20:56:08,265 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 559 mSDsluCounter, 2093 mSDsCounter, 0 mSdLazyCounter, 1229 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 2217 SdHoareTripleChecker+Invalid, 2701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 1229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1310 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:08,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 2217 Invalid, 2701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 1229 Invalid, 0 Unknown, 1310 Unchecked, 3.1s Time] [2022-11-02 20:56:08,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2022-11-02 20:56:08,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 337. [2022-11-02 20:56:08,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 264 states have (on average 1.321969696969697) internal successors, (349), 291 states have internal predecessors, (349), 39 states have call successors, (39), 18 states have call predecessors, (39), 17 states have return successors, (45), 27 states have call predecessors, (45), 39 states have call successors, (45) [2022-11-02 20:56:08,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 433 transitions. [2022-11-02 20:56:08,283 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 433 transitions. Word has length 34 [2022-11-02 20:56:08,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:08,284 INFO L495 AbstractCegarLoop]: Abstraction has 337 states and 433 transitions. [2022-11-02 20:56:08,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 50 states have (on average 1.56) internal successors, (78), 47 states have internal predecessors, (78), 7 states have call successors, (7), 7 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:08,284 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 433 transitions. [2022-11-02 20:56:08,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 20:56:08,285 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:08,285 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:08,326 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-02 20:56:08,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:56:08,510 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-02 20:56:08,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:08,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1173956747, now seen corresponding path program 1 times [2022-11-02 20:56:08,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:08,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828266189] [2022-11-02 20:56:08,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:08,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:08,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:09,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:56:09,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:09,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-02 20:56:09,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:09,568 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:56:09,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:09,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828266189] [2022-11-02 20:56:09,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828266189] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:56:09,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142095427] [2022-11-02 20:56:09,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:09,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:56:09,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:56:09,574 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:56:09,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-02 20:56:09,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:09,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-02 20:56:09,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:56:09,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:09,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:10,007 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:56:10,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 22 [2022-11-02 20:56:10,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-02 20:56:10,074 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:56:10,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 22 [2022-11-02 20:56:10,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-02 20:56:10,959 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:10,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 18 [2022-11-02 20:56:10,988 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:10,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 15 [2022-11-02 20:56:11,198 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:56:11,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:56:12,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142095427] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:56:12,385 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:56:12,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18] total 24 [2022-11-02 20:56:12,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516419232] [2022-11-02 20:56:12,386 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:56:12,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-02 20:56:12,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:12,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-02 20:56:12,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=667, Unknown=0, NotChecked=0, Total=756 [2022-11-02 20:56:12,387 INFO L87 Difference]: Start difference. First operand 337 states and 433 transitions. Second operand has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 24 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-02 20:56:17,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:17,216 INFO L93 Difference]: Finished difference Result 484 states and 632 transitions. [2022-11-02 20:56:17,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-02 20:56:17,217 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 24 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 34 [2022-11-02 20:56:17,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:17,219 INFO L225 Difference]: With dead ends: 484 [2022-11-02 20:56:17,219 INFO L226 Difference]: Without dead ends: 484 [2022-11-02 20:56:17,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=365, Invalid=1987, Unknown=0, NotChecked=0, Total=2352 [2022-11-02 20:56:17,220 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 356 mSDsluCounter, 1483 mSDsCounter, 0 mSdLazyCounter, 1104 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1609 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 268 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:17,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 1609 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1104 Invalid, 0 Unknown, 268 Unchecked, 2.4s Time] [2022-11-02 20:56:17,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2022-11-02 20:56:17,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 326. [2022-11-02 20:56:17,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 255 states have (on average 1.2901960784313726) internal successors, (329), 280 states have internal predecessors, (329), 36 states have call successors, (36), 18 states have call predecessors, (36), 20 states have return successors, (48), 27 states have call predecessors, (48), 36 states have call successors, (48) [2022-11-02 20:56:17,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 413 transitions. [2022-11-02 20:56:17,232 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 413 transitions. Word has length 34 [2022-11-02 20:56:17,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:17,233 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 413 transitions. [2022-11-02 20:56:17,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 24 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-02 20:56:17,233 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 413 transitions. [2022-11-02 20:56:17,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 20:56:17,234 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:17,234 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:17,261 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-02 20:56:17,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-11-02 20:56:17,446 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-02 20:56:17,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:17,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1121383677, now seen corresponding path program 2 times [2022-11-02 20:56:17,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:17,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267830262] [2022-11-02 20:56:17,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:17,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:18,335 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-02 20:56:18,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:18,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267830262] [2022-11-02 20:56:18,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267830262] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:56:18,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355970417] [2022-11-02 20:56:18,336 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:56:18,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:56:18,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:56:18,342 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:56:18,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a17b51b9-e1ac-40c2-a52f-0279bf5d9ab2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-02 20:56:18,529 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:56:18,529 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:56:18,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 92 conjunts are in the unsatisfiable core [2022-11-02 20:56:18,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:56:18,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:18,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:18,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:56:18,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:56:18,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:56:18,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:56:18,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:56:18,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:56:18,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:56:18,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:56:19,077 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-02 20:56:19,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 26 [2022-11-02 20:56:19,130 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-02 20:56:19,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 26 [2022-11-02 20:56:19,454 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:56:19,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 26 [2022-11-02 20:56:19,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-02 20:56:19,521 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:56:19,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 26 [2022-11-02 20:56:19,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-02 20:56:19,729 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:56:19,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 29 [2022-11-02 20:56:19,792 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:56:19,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 29 [2022-11-02 20:56:19,858 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-02 20:56:19,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 33 [2022-11-02 20:56:19,925 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-02 20:56:19,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 33 [2022-11-02 20:56:20,318 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:56:20,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:20,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 32 treesize of output 32 [2022-11-02 20:56:20,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 23 treesize of output 25 [2022-11-02 20:56:20,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 32 treesize of output 32 [2022-11-02 20:56:20,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 23 treesize of output 25 [2022-11-02 20:56:21,042 INFO L356 Elim1Store]: treesize reduction 14, result has 61.1 percent of original size [2022-11-02 20:56:21,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 39 treesize of output 44 [2022-11-02 20:56:21,086 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-02 20:56:21,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 33 [2022-11-02 20:56:22,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 17 [2022-11-02 20:56:22,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:56:22,992 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:56:22,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:56:24,597 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:24,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 88 treesize of output 92 [2022-11-02 20:56:30,461 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:30,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 308 treesize of output 378 [2022-11-02 20:56:37,463 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~tail~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (and (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((v_ArrVal_1443 (Array Int Int)) (v_prenex_61 Int) (v_prenex_60 Int) (v_prenex_59 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_61) (<= 0 (+ (select (select (let ((.cse0 (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1443))) (store .cse2 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 v_prenex_60))) v_prenex_61 v_prenex_59))) (store .cse0 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) 4)))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((v_ArrVal_1444 (Array Int Int)) (v_prenex_62 Int)) (or (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_62) (forall ((v_ArrVal_1452 (Array Int Int))) (let ((.cse4 (select (select (let ((.cse5 (store (let ((.cse6 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1444))) (store .cse6 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 |ULTIMATE.start_main_~n~0#1.base|))) v_prenex_62 v_ArrVal_1452))) (store .cse5 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 v_prenex_62))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3))) (or (= v_prenex_62 .cse4) (= .cse4 0)))))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((v_prenex_66 Int) (v_prenex_64 (Array Int Int)) (v_ArrVal_1444 (Array Int Int)) (v_prenex_63 (Array Int Int)) (v_ArrVal_1443 (Array Int Int)) (v_prenex_65 Int)) (or (= (select (select (let ((.cse7 (store (let ((.cse8 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1443))) (store .cse8 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 v_prenex_66))) v_prenex_65 v_prenex_64))) (store .cse7 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_65) (= (select (select (let ((.cse9 (store (let ((.cse10 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1444))) (store .cse10 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 |ULTIMATE.start_main_~n~0#1.base|))) v_prenex_65 v_prenex_63))) (store .cse9 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 v_prenex_65))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) v_prenex_65))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((v_ArrVal_1443 (Array Int Int)) (v_ArrVal_1451 (Array Int Int)) (v_ArrVal_1447 Int) (|v_ULTIMATE.start_main_~n~0#1.base_27| Int)) (or (= |v_ULTIMATE.start_main_~n~0#1.base_27| |c_ULTIMATE.start_main_~tail~0#1.base|) (< (select (select (let ((.cse11 (store (let ((.cse12 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1443))) (store .cse12 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 v_ArrVal_1447))) |v_ULTIMATE.start_main_~n~0#1.base_27| v_ArrVal_1451))) (store .cse11 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) 1))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (or (= |c_ULTIMATE.start_main_~n~0#1.offset| |c_ULTIMATE.start_main_~#list~0#1.offset|) (and (forall ((|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_66 Int) (v_prenex_64 (Array Int Int)) (v_ArrVal_1444 (Array Int Int)) (v_prenex_63 (Array Int Int)) (v_ArrVal_1443 (Array Int Int)) (v_prenex_65 Int)) (or (= (select (select (let ((.cse13 (store (let ((.cse14 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1443))) (store .cse14 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 v_prenex_66))) v_prenex_65 v_prenex_64))) (store .cse13 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_65) (= (select (select (let ((.cse15 (store (let ((.cse16 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1444))) (store .cse16 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse16 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 |ULTIMATE.start_main_~n~0#1.base|))) v_prenex_65 v_prenex_63))) (store .cse15 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse15 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 v_prenex_65))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) v_prenex_65))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_1443 (Array Int Int)) (v_ArrVal_1451 (Array Int Int)) (v_ArrVal_1447 Int) (|v_ULTIMATE.start_main_~n~0#1.base_27| Int)) (or (= |v_ULTIMATE.start_main_~n~0#1.base_27| |c_ULTIMATE.start_main_~tail~0#1.base|) (< (select (select (let ((.cse17 (store (let ((.cse18 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1443))) (store .cse18 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse18 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 v_ArrVal_1447))) |v_ULTIMATE.start_main_~n~0#1.base_27| v_ArrVal_1451))) (store .cse17 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) 1))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_1443 (Array Int Int)) (v_prenex_61 Int) (v_prenex_60 Int) (v_prenex_59 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_61) (<= 0 (+ (select (select (let ((.cse19 (store (let ((.cse20 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1443))) (store .cse20 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse20 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 v_prenex_60))) v_prenex_61 v_prenex_59))) (store .cse19 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse19 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) 4)))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_1444 (Array Int Int)) (v_prenex_62 Int)) (or (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_62) (forall ((v_ArrVal_1452 (Array Int Int))) (let ((.cse21 (select (select (let ((.cse22 (store (let ((.cse23 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1444))) (store .cse23 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse23 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 |ULTIMATE.start_main_~n~0#1.base|))) v_prenex_62 v_ArrVal_1452))) (store .cse22 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse22 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 v_prenex_62))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3))) (or (= v_prenex_62 .cse21) (= .cse21 0)))))))))) is different from false [2022-11-02 20:56:37,896 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~tail~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (and (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((v_ArrVal_1443 (Array Int Int)) (v_prenex_61 Int) (v_prenex_60 Int) (v_prenex_59 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_61) (<= 0 (+ (select (select (let ((.cse0 (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1443))) (store .cse2 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 v_prenex_60))) v_prenex_61 v_prenex_59))) (store .cse0 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) 4)))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((v_ArrVal_1444 (Array Int Int)) (v_prenex_62 Int)) (or (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_62) (forall ((v_ArrVal_1452 (Array Int Int))) (let ((.cse4 (select (select (let ((.cse5 (store (let ((.cse6 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1444))) (store .cse6 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 |ULTIMATE.start_main_~n~0#1.base|))) v_prenex_62 v_ArrVal_1452))) (store .cse5 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 v_prenex_62))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3))) (or (= v_prenex_62 .cse4) (= .cse4 0)))))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((v_prenex_66 Int) (v_prenex_64 (Array Int Int)) (v_ArrVal_1444 (Array Int Int)) (v_prenex_63 (Array Int Int)) (v_ArrVal_1443 (Array Int Int)) (v_prenex_65 Int)) (or (= (select (select (let ((.cse7 (store (let ((.cse8 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1443))) (store .cse8 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 v_prenex_66))) v_prenex_65 v_prenex_64))) (store .cse7 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_65) (= (select (select (let ((.cse9 (store (let ((.cse10 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1444))) (store .cse10 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 |ULTIMATE.start_main_~n~0#1.base|))) v_prenex_65 v_prenex_63))) (store .cse9 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 v_prenex_65))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) v_prenex_65))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((v_ArrVal_1443 (Array Int Int)) (v_ArrVal_1451 (Array Int Int)) (v_ArrVal_1447 Int) (|v_ULTIMATE.start_main_~n~0#1.base_27| Int)) (or (= |v_ULTIMATE.start_main_~n~0#1.base_27| |c_ULTIMATE.start_main_~tail~0#1.base|) (< (select (select (let ((.cse11 (store (let ((.cse12 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1443))) (store .cse12 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 v_ArrVal_1447))) |v_ULTIMATE.start_main_~n~0#1.base_27| v_ArrVal_1451))) (store .cse11 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) 1))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (or (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0) (and (forall ((|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_66 Int) (v_prenex_64 (Array Int Int)) (v_ArrVal_1444 (Array Int Int)) (v_prenex_63 (Array Int Int)) (v_ArrVal_1443 (Array Int Int)) (v_prenex_65 Int)) (or (= (select (select (let ((.cse13 (store (let ((.cse14 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1443))) (store .cse14 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 v_prenex_66))) v_prenex_65 v_prenex_64))) (store .cse13 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_65) (= (select (select (let ((.cse15 (store (let ((.cse16 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1444))) (store .cse16 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse16 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 |ULTIMATE.start_main_~n~0#1.base|))) v_prenex_65 v_prenex_63))) (store .cse15 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse15 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 v_prenex_65))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) v_prenex_65))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_1443 (Array Int Int)) (v_ArrVal_1451 (Array Int Int)) (v_ArrVal_1447 Int) (|v_ULTIMATE.start_main_~n~0#1.base_27| Int)) (or (= |v_ULTIMATE.start_main_~n~0#1.base_27| |c_ULTIMATE.start_main_~tail~0#1.base|) (< (select (select (let ((.cse17 (store (let ((.cse18 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1443))) (store .cse18 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse18 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 v_ArrVal_1447))) |v_ULTIMATE.start_main_~n~0#1.base_27| v_ArrVal_1451))) (store .cse17 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) 1))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_1443 (Array Int Int)) (v_prenex_61 Int) (v_prenex_60 Int) (v_prenex_59 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_61) (<= 0 (+ (select (select (let ((.cse19 (store (let ((.cse20 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1443))) (store .cse20 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse20 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 v_prenex_60))) v_prenex_61 v_prenex_59))) (store .cse19 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse19 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) 4)))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_1444 (Array Int Int)) (v_prenex_62 Int)) (or (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_62) (forall ((v_ArrVal_1452 (Array Int Int))) (let ((.cse21 (select (select (let ((.cse22 (store (let ((.cse23 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1444))) (store .cse23 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse23 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 |ULTIMATE.start_main_~n~0#1.base|))) v_prenex_62 v_ArrVal_1452))) (store .cse22 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse22 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 v_prenex_62))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3))) (or (= v_prenex_62 .cse21) (= .cse21 0)))))))))) is different from false [2022-11-02 20:56:52,675 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (and (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1436 (Array Int Int)) (v_subst_6 Int) (v_ArrVal_1437 Int)) (or (forall ((v_ArrVal_1443 (Array Int Int)) (v_prenex_61 Int) (v_prenex_60 Int) (v_prenex_59 (Array Int Int))) (or (<= 0 (+ (select (select (let ((.cse1 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse0 (store (let ((.cse2 (store (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1436))) (store .cse3 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 v_ArrVal_1437))) v_subst_6 v_ArrVal_1443))) (store .cse2 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 v_prenex_60))) v_prenex_61 v_prenex_59))) (store .cse0 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4) 4)) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_61))) (= |c_ULTIMATE.start_main_~#list~0#1.base| v_subst_6))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1435 (Array Int Int)) (v_subst_7 Int) (v_ArrVal_1437 Int) (v_ArrVal_1438 Int)) (or (= |c_ULTIMATE.start_main_~#list~0#1.base| v_subst_7) (forall ((v_prenex_66 Int) (v_prenex_64 (Array Int Int)) (v_ArrVal_1444 (Array Int Int)) (v_prenex_63 (Array Int Int)) (v_ArrVal_1443 (Array Int Int)) (v_prenex_65 Int)) (let ((.cse6 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= (select (select (let ((.cse5 (store (let ((.cse7 (store (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1436))) (store .cse8 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse6 v_ArrVal_1437))) v_subst_7 v_ArrVal_1443))) (store .cse7 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse6 v_prenex_66))) v_prenex_65 v_prenex_64))) (store .cse5 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse6 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4) 0) (= (select (select (let ((.cse9 (store (let ((.cse10 (store (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1435))) (store .cse11 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse6 v_ArrVal_1438))) v_subst_7 v_ArrVal_1444))) (store .cse10 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse6 v_subst_7))) v_prenex_65 v_prenex_63))) (store .cse9 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse6 v_prenex_65))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4) v_prenex_65) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_65)))))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1436 (Array Int Int)) (v_subst_8 Int) (v_ArrVal_1437 Int)) (or (forall ((v_ArrVal_1443 (Array Int Int)) (v_ArrVal_1451 (Array Int Int)) (v_ArrVal_1447 Int) (|v_ULTIMATE.start_main_~n~0#1.base_27| Int)) (or (= |v_ULTIMATE.start_main_~n~0#1.base_27| |c_ULTIMATE.start_main_~tail~0#1.base|) (< (select (select (let ((.cse13 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse12 (store (let ((.cse14 (store (let ((.cse15 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1436))) (store .cse15 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse15 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse13 v_ArrVal_1437))) v_subst_8 v_ArrVal_1443))) (store .cse14 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse13 v_ArrVal_1447))) |v_ULTIMATE.start_main_~n~0#1.base_27| v_ArrVal_1451))) (store .cse12 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse13 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4) 1))) (= |c_ULTIMATE.start_main_~#list~0#1.base| v_subst_8))) (or (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0) (and (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1435 (Array Int Int)) (v_ArrVal_1444 (Array Int Int)) (v_prenex_62 Int) (v_subst_2 Int) (v_ArrVal_1438 Int)) (or (forall ((v_ArrVal_1452 (Array Int Int))) (let ((.cse16 (select (select (let ((.cse18 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse17 (store (let ((.cse19 (store (let ((.cse20 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1435))) (store .cse20 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse20 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse18 v_ArrVal_1438))) v_subst_2 v_ArrVal_1444))) (store .cse19 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse19 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse18 v_subst_2))) v_prenex_62 v_ArrVal_1452))) (store .cse17 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse18 v_prenex_62)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4))) (or (= .cse16 v_prenex_62) (= .cse16 0)))) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_62))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1443 (Array Int Int)) (v_ArrVal_1451 (Array Int Int)) (v_subst_3 Int) (v_ArrVal_1437 Int) (v_ArrVal_1447 Int) (|v_ULTIMATE.start_main_~n~0#1.base_27| Int)) (or (= |v_ULTIMATE.start_main_~n~0#1.base_27| |c_ULTIMATE.start_main_~tail~0#1.base|) (< (select (select (let ((.cse22 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse21 (store (let ((.cse23 (store (let ((.cse24 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1436))) (store .cse24 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse24 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse22 v_ArrVal_1437))) v_subst_3 v_ArrVal_1443))) (store .cse23 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse23 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse22 v_ArrVal_1447))) |v_ULTIMATE.start_main_~n~0#1.base_27| v_ArrVal_1451))) (store .cse21 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse21 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse22 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4) 1))) (forall ((v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1435 (Array Int Int)) (v_prenex_66 Int) (v_ArrVal_1444 (Array Int Int)) (v_ArrVal_1443 (Array Int Int)) (v_subst_5 Int) (v_prenex_65 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_64 (Array Int Int)) (v_prenex_63 (Array Int Int)) (v_ArrVal_1437 Int) (v_ArrVal_1438 Int)) (let ((.cse26 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_65) (= v_prenex_65 (select (select (let ((.cse25 (store (let ((.cse27 (store (let ((.cse28 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1435))) (store .cse28 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse28 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse26 v_ArrVal_1438))) v_subst_5 v_ArrVal_1444))) (store .cse27 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse27 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse26 v_subst_5))) v_prenex_65 v_prenex_63))) (store .cse25 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse25 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse26 v_prenex_65))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4)) (= (select (select (let ((.cse29 (store (let ((.cse30 (store (let ((.cse31 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1436))) (store .cse31 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse31 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse26 v_ArrVal_1437))) v_subst_5 v_ArrVal_1443))) (store .cse30 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse30 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse26 v_prenex_66))) v_prenex_65 v_prenex_64))) (store .cse29 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse29 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse26 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4) 0)))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1443 (Array Int Int)) (v_subst_4 Int) (v_ArrVal_1437 Int) (v_prenex_61 Int) (v_prenex_60 Int) (v_prenex_59 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_61) (<= 0 (+ (select (select (let ((.cse33 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse32 (store (let ((.cse34 (store (let ((.cse35 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1436))) (store .cse35 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse35 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse33 v_ArrVal_1437))) v_subst_4 v_ArrVal_1443))) (store .cse34 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse34 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse33 v_prenex_60))) v_prenex_61 v_prenex_59))) (store .cse32 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse32 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse33 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4) 4)))))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1435 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_1438 Int)) (or (forall ((v_ArrVal_1444 (Array Int Int)) (v_prenex_62 Int)) (or (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_62) (forall ((v_ArrVal_1452 (Array Int Int))) (let ((.cse36 (select (select (let ((.cse38 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse37 (store (let ((.cse39 (store (let ((.cse40 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1435))) (store .cse40 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse40 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse38 v_ArrVal_1438))) v_subst_1 v_ArrVal_1444))) (store .cse39 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse39 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse38 v_subst_1))) v_prenex_62 v_ArrVal_1452))) (store .cse37 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse37 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse38 v_prenex_62)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4))) (or (= v_prenex_62 .cse36) (= 0 .cse36)))))) (= |c_ULTIMATE.start_main_~#list~0#1.base| v_subst_1))))) is different from false [2022-11-02 20:56:53,431 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_main_~n~0#1.base_29| Int)) (or (not (< |v_ULTIMATE.start_main_~n~0#1.base_29| |c_#StackHeapBarrier|)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1435 (Array Int Int)) (v_subst_7 Int) (v_ArrVal_1437 Int) (v_ArrVal_1438 Int)) (or (forall ((v_prenex_66 Int) (v_prenex_64 (Array Int Int)) (v_ArrVal_1444 (Array Int Int)) (v_prenex_63 (Array Int Int)) (v_ArrVal_1443 (Array Int Int)) (v_prenex_65 Int)) (let ((.cse1 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_65) (= (select (select (let ((.cse0 (store (let ((.cse2 (store (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_29| v_ArrVal_1436))) (store .cse3 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 v_ArrVal_1437))) v_subst_7 v_ArrVal_1443))) (store .cse2 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 v_prenex_66))) v_prenex_65 v_prenex_64))) (store .cse0 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4) 0) (= (select (select (let ((.cse5 (store (let ((.cse6 (store (let ((.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_29| v_ArrVal_1435))) (store .cse7 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 v_ArrVal_1438))) v_subst_7 v_ArrVal_1444))) (store .cse6 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 v_subst_7))) v_prenex_65 v_prenex_63))) (store .cse5 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 v_prenex_65))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4) v_prenex_65)))) (= |c_ULTIMATE.start_main_~#list~0#1.base| v_subst_7))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_29| Int)) (or (not (< |v_ULTIMATE.start_main_~n~0#1.base_29| |c_#StackHeapBarrier|)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1436 (Array Int Int)) (v_subst_8 Int) (v_ArrVal_1437 Int)) (or (= |c_ULTIMATE.start_main_~#list~0#1.base| v_subst_8) (forall ((v_ArrVal_1443 (Array Int Int)) (v_ArrVal_1451 (Array Int Int)) (v_ArrVal_1447 Int) (|v_ULTIMATE.start_main_~n~0#1.base_27| Int)) (or (< (select (select (let ((.cse9 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse8 (store (let ((.cse10 (store (let ((.cse11 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_29| v_ArrVal_1436))) (store .cse11 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse9 v_ArrVal_1437))) v_subst_8 v_ArrVal_1443))) (store .cse10 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse9 v_ArrVal_1447))) |v_ULTIMATE.start_main_~n~0#1.base_27| v_ArrVal_1451))) (store .cse8 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse9 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4) 1) (= |v_ULTIMATE.start_main_~n~0#1.base_27| |c_ULTIMATE.start_main_~tail~0#1.base|))))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_29| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1436 (Array Int Int)) (v_subst_6 Int) (v_ArrVal_1437 Int)) (or (forall ((v_ArrVal_1443 (Array Int Int)) (v_prenex_61 Int) (v_prenex_60 Int) (v_prenex_59 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_61) (<= 0 (+ (select (select (let ((.cse13 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse12 (store (let ((.cse14 (store (let ((.cse15 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_29| v_ArrVal_1436))) (store .cse15 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse15 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse13 v_ArrVal_1437))) v_subst_6 v_ArrVal_1443))) (store .cse14 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse13 v_prenex_60))) v_prenex_61 v_prenex_59))) (store .cse12 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse13 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4) 4)))) (= |c_ULTIMATE.start_main_~#list~0#1.base| v_subst_6))) (not (< |v_ULTIMATE.start_main_~n~0#1.base_29| |c_#StackHeapBarrier|)))) (or (and (forall ((|v_ULTIMATE.start_main_~n~0#1.base_29| Int)) (or (not (< |v_ULTIMATE.start_main_~n~0#1.base_29| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1435 (Array Int Int)) (v_prenex_66 Int) (v_ArrVal_1444 (Array Int Int)) (v_ArrVal_1443 (Array Int Int)) (v_subst_5 Int) (v_prenex_65 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_64 (Array Int Int)) (v_prenex_63 (Array Int Int)) (v_ArrVal_1437 Int) (v_ArrVal_1438 Int)) (let ((.cse17 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= 0 (select (select (let ((.cse16 (store (let ((.cse18 (store (let ((.cse19 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_29| v_ArrVal_1436))) (store .cse19 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse19 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse17 v_ArrVal_1437))) v_subst_5 v_ArrVal_1443))) (store .cse18 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse18 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse17 v_prenex_66))) v_prenex_65 v_prenex_64))) (store .cse16 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse16 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse17 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4)) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_65) (= v_prenex_65 (select (select (let ((.cse20 (store (let ((.cse21 (store (let ((.cse22 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_29| v_ArrVal_1435))) (store .cse22 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse22 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse17 v_ArrVal_1438))) v_subst_5 v_ArrVal_1444))) (store .cse21 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse21 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse17 v_subst_5))) v_prenex_65 v_prenex_63))) (store .cse20 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse20 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse17 v_prenex_65))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4))))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_29| Int)) (or (not (< |v_ULTIMATE.start_main_~n~0#1.base_29| |c_#StackHeapBarrier|)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1443 (Array Int Int)) (v_subst_4 Int) (v_ArrVal_1437 Int) (v_prenex_61 Int) (v_prenex_60 Int) (v_prenex_59 (Array Int Int))) (or (<= 0 (+ (select (select (let ((.cse24 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse23 (store (let ((.cse25 (store (let ((.cse26 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_29| v_ArrVal_1436))) (store .cse26 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse26 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse24 v_ArrVal_1437))) v_subst_4 v_ArrVal_1443))) (store .cse25 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse25 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse24 v_prenex_60))) v_prenex_61 v_prenex_59))) (store .cse23 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse23 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse24 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4) 4)) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_61))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_29| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1443 (Array Int Int)) (v_ArrVal_1451 (Array Int Int)) (v_subst_3 Int) (v_ArrVal_1437 Int) (v_ArrVal_1447 Int) (|v_ULTIMATE.start_main_~n~0#1.base_27| Int)) (or (= |v_ULTIMATE.start_main_~n~0#1.base_27| |c_ULTIMATE.start_main_~tail~0#1.base|) (< (select (select (let ((.cse28 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse27 (store (let ((.cse29 (store (let ((.cse30 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_29| v_ArrVal_1436))) (store .cse30 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse30 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse28 v_ArrVal_1437))) v_subst_3 v_ArrVal_1443))) (store .cse29 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse29 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse28 v_ArrVal_1447))) |v_ULTIMATE.start_main_~n~0#1.base_27| v_ArrVal_1451))) (store .cse27 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse27 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse28 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4) 1))) (not (< |v_ULTIMATE.start_main_~n~0#1.base_29| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_29| Int)) (or (not (< |v_ULTIMATE.start_main_~n~0#1.base_29| |c_#StackHeapBarrier|)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1435 (Array Int Int)) (v_ArrVal_1444 (Array Int Int)) (v_prenex_62 Int) (v_subst_2 Int) (v_ArrVal_1438 Int)) (or (forall ((v_ArrVal_1452 (Array Int Int))) (let ((.cse31 (select (select (let ((.cse33 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse32 (store (let ((.cse34 (store (let ((.cse35 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_29| v_ArrVal_1435))) (store .cse35 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse35 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse33 v_ArrVal_1438))) v_subst_2 v_ArrVal_1444))) (store .cse34 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse34 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse33 v_subst_2))) v_prenex_62 v_ArrVal_1452))) (store .cse32 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse32 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse33 v_prenex_62)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4))) (or (= .cse31 0) (= .cse31 v_prenex_62)))) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_62)))))) (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0)) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_29| Int)) (or (not (< |v_ULTIMATE.start_main_~n~0#1.base_29| |c_#StackHeapBarrier|)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1435 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_1438 Int)) (or (forall ((v_ArrVal_1444 (Array Int Int)) (v_prenex_62 Int)) (or (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_62) (forall ((v_ArrVal_1452 (Array Int Int))) (let ((.cse36 (select (select (let ((.cse38 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse37 (store (let ((.cse39 (store (let ((.cse40 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_29| v_ArrVal_1435))) (store .cse40 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse40 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse38 v_ArrVal_1438))) v_subst_1 v_ArrVal_1444))) (store .cse39 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse39 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse38 v_subst_1))) v_prenex_62 v_ArrVal_1452))) (store .cse37 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse37 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse38 v_prenex_62)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4))) (or (= .cse36 0) (= .cse36 v_prenex_62)))))) (= |c_ULTIMATE.start_main_~#list~0#1.base| v_subst_1))))))) is different from false [2022-11-02 20:56:53,816 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_main_~n~0#1.base_29| Int)) (or (not (< |v_ULTIMATE.start_main_~n~0#1.base_29| |c_#StackHeapBarrier|)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1435 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_1438 Int)) (or (forall ((v_ArrVal_1444 (Array Int Int)) (v_prenex_62 Int)) (or (forall ((v_ArrVal_1452 (Array Int Int))) (let ((.cse0 (select (let ((.cse2 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (store (select (store (let ((.cse1 (store (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_29| v_ArrVal_1435))) (store .cse3 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2 v_ArrVal_1438))) v_subst_1 v_ArrVal_1444))) (store .cse1 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2 v_subst_1))) v_prenex_62 v_ArrVal_1452) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2 v_prenex_62)) .cse4))) (or (= .cse0 0) (= .cse0 v_prenex_62)))) (= v_prenex_62 |c_ULTIMATE.start_main_~#list~0#1.base|))) (= |c_ULTIMATE.start_main_~#list~0#1.base| v_subst_1))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_29| Int)) (or (not (< |v_ULTIMATE.start_main_~n~0#1.base_29| |c_#StackHeapBarrier|)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1435 (Array Int Int)) (v_subst_7 Int) (v_ArrVal_1437 Int) (v_ArrVal_1438 Int)) (or (= |c_ULTIMATE.start_main_~#list~0#1.base| v_subst_7) (forall ((v_prenex_66 Int) (v_prenex_64 (Array Int Int)) (v_ArrVal_1444 (Array Int Int)) (v_prenex_63 (Array Int Int)) (v_ArrVal_1443 (Array Int Int)) (v_prenex_65 Int)) (let ((.cse6 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= (select (store (select (store (let ((.cse5 (store (let ((.cse7 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_29| v_ArrVal_1436))) (store .cse7 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse6 v_ArrVal_1437))) v_subst_7 v_ArrVal_1443))) (store .cse5 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse6 v_prenex_66))) v_prenex_65 v_prenex_64) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse6 0) .cse4) 0) (= v_prenex_65 |c_ULTIMATE.start_main_~#list~0#1.base|) (= v_prenex_65 (select (store (select (store (let ((.cse8 (store (let ((.cse9 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_29| v_ArrVal_1435))) (store .cse9 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse6 v_ArrVal_1438))) v_subst_7 v_ArrVal_1444))) (store .cse8 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse6 v_subst_7))) v_prenex_65 v_prenex_63) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse6 v_prenex_65) .cse4))))))))) (or (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0) (and (forall ((|v_ULTIMATE.start_main_~n~0#1.base_29| Int)) (or (not (< |v_ULTIMATE.start_main_~n~0#1.base_29| |c_#StackHeapBarrier|)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1435 (Array Int Int)) (v_ArrVal_1444 (Array Int Int)) (v_prenex_62 Int) (v_subst_2 Int) (v_ArrVal_1438 Int)) (or (forall ((v_ArrVal_1452 (Array Int Int))) (let ((.cse10 (select (let ((.cse12 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (store (select (store (let ((.cse11 (store (let ((.cse13 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_29| v_ArrVal_1435))) (store .cse13 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse12 v_ArrVal_1438))) v_subst_2 v_ArrVal_1444))) (store .cse11 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse12 v_subst_2))) v_prenex_62 v_ArrVal_1452) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse12 v_prenex_62)) .cse4))) (or (= 0 .cse10) (= v_prenex_62 .cse10)))) (= v_prenex_62 |c_ULTIMATE.start_main_~#list~0#1.base|))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_29| Int)) (or (not (< |v_ULTIMATE.start_main_~n~0#1.base_29| |c_#StackHeapBarrier|)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1443 (Array Int Int)) (v_subst_4 Int) (v_ArrVal_1437 Int) (v_prenex_61 Int) (v_prenex_60 Int) (v_prenex_59 (Array Int Int))) (or (<= 0 (+ (select (let ((.cse15 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (store (select (store (let ((.cse14 (store (let ((.cse16 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_29| v_ArrVal_1436))) (store .cse16 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse16 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse15 v_ArrVal_1437))) v_subst_4 v_ArrVal_1443))) (store .cse14 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse15 v_prenex_60))) v_prenex_61 v_prenex_59) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse15 0)) .cse4) 4)) (= v_prenex_61 |c_ULTIMATE.start_main_~#list~0#1.base|))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_29| Int)) (or (not (< |v_ULTIMATE.start_main_~n~0#1.base_29| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1435 (Array Int Int)) (v_prenex_66 Int) (v_ArrVal_1444 (Array Int Int)) (v_ArrVal_1443 (Array Int Int)) (v_subst_5 Int) (v_prenex_65 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_64 (Array Int Int)) (v_prenex_63 (Array Int Int)) (v_ArrVal_1437 Int) (v_ArrVal_1438 Int)) (let ((.cse18 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= v_prenex_65 (select (store (select (store (let ((.cse17 (store (let ((.cse19 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_29| v_ArrVal_1435))) (store .cse19 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse19 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse18 v_ArrVal_1438))) v_subst_5 v_ArrVal_1444))) (store .cse17 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse18 v_subst_5))) v_prenex_65 v_prenex_63) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse18 v_prenex_65) .cse4)) (= 0 (select (store (select (store (let ((.cse20 (store (let ((.cse21 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_29| v_ArrVal_1436))) (store .cse21 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse21 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse18 v_ArrVal_1437))) v_subst_5 v_ArrVal_1443))) (store .cse20 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse20 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse18 v_prenex_66))) v_prenex_65 v_prenex_64) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse18 0) .cse4)) (= v_prenex_65 |c_ULTIMATE.start_main_~#list~0#1.base|)))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_29| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1443 (Array Int Int)) (v_ArrVal_1451 (Array Int Int)) (v_subst_3 Int) (v_ArrVal_1437 Int) (v_ArrVal_1447 Int) (|v_ULTIMATE.start_main_~n~0#1.base_27| Int)) (or (= |v_ULTIMATE.start_main_~n~0#1.base_27| |c_ULTIMATE.start_main_~#list~0#1.base|) (< (select (let ((.cse23 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (store (select (store (let ((.cse22 (store (let ((.cse24 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_29| v_ArrVal_1436))) (store .cse24 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse24 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse23 v_ArrVal_1437))) v_subst_3 v_ArrVal_1443))) (store .cse22 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse22 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse23 v_ArrVal_1447))) |v_ULTIMATE.start_main_~n~0#1.base_27| v_ArrVal_1451) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse23 0)) .cse4) 1))) (not (< |v_ULTIMATE.start_main_~n~0#1.base_29| |c_#StackHeapBarrier|)))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_29| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1436 (Array Int Int)) (v_subst_8 Int) (v_ArrVal_1437 Int)) (or (forall ((v_ArrVal_1443 (Array Int Int)) (v_ArrVal_1451 (Array Int Int)) (v_ArrVal_1447 Int) (|v_ULTIMATE.start_main_~n~0#1.base_27| Int)) (or (= |v_ULTIMATE.start_main_~n~0#1.base_27| |c_ULTIMATE.start_main_~#list~0#1.base|) (< (select (let ((.cse26 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (store (select (store (let ((.cse25 (store (let ((.cse27 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_29| v_ArrVal_1436))) (store .cse27 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse27 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse26 v_ArrVal_1437))) v_subst_8 v_ArrVal_1443))) (store .cse25 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse25 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse26 v_ArrVal_1447))) |v_ULTIMATE.start_main_~n~0#1.base_27| v_ArrVal_1451) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse26 0)) .cse4) 1))) (= |c_ULTIMATE.start_main_~#list~0#1.base| v_subst_8))) (not (< |v_ULTIMATE.start_main_~n~0#1.base_29| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_29| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1436 (Array Int Int)) (v_subst_6 Int) (v_ArrVal_1437 Int)) (or (= |c_ULTIMATE.start_main_~#list~0#1.base| v_subst_6) (forall ((v_ArrVal_1443 (Array Int Int)) (v_prenex_61 Int) (v_prenex_60 Int) (v_prenex_59 (Array Int Int))) (or (= v_prenex_61 |c_ULTIMATE.start_main_~#list~0#1.base|) (<= 0 (+ (select (let ((.cse29 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (store (select (store (let ((.cse28 (store (let ((.cse30 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_29| v_ArrVal_1436))) (store .cse30 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse30 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse29 v_ArrVal_1437))) v_subst_6 v_ArrVal_1443))) (store .cse28 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse28 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse29 v_prenex_60))) v_prenex_61 v_prenex_59) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse29 0)) .cse4) 4)))))) (not (< |v_ULTIMATE.start_main_~n~0#1.base_29| |c_#StackHeapBarrier|)))))) is different from false [2022-11-02 20:56:53,923 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:53,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 107 treesize of output 78 [2022-11-02 20:56:53,931 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:56:53,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 98 treesize of output 94 [2022-11-02 20:56:53,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2022-11-02 20:56:53,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 81 [2022-11-02 20:56:53,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2022-11-02 20:56:54,021 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:54,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 76 [2022-11-02 20:56:54,030 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:56:54,030 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:56:54,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 46 treesize of output 42 [2022-11-02 20:56:54,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2022-11-02 20:56:54,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-11-02 20:56:54,085 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 20:56:54,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 211 treesize of output 1 [2022-11-02 20:56:54,096 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 20:56:54,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 1 [2022-11-02 20:56:54,112 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 20:56:54,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 1 [2022-11-02 20:56:54,278 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2022-11-02 20:56:54,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355970417] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:56:54,278 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:56:54,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 22, 23] total 54 [2022-11-02 20:56:54,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374290044] [2022-11-02 20:56:54,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:56:54,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-11-02 20:56:54,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:54,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-11-02 20:56:54,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=2208, Unknown=50, NotChecked=500, Total=2970 [2022-11-02 20:56:54,281 INFO L87 Difference]: Start difference. First operand 326 states and 413 transitions. Second operand has 55 states, 51 states have (on average 1.7450980392156863) internal successors, (89), 49 states have internal predecessors, (89), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:56,412 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0)) (.cse0 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (and (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0)) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_29| Int)) (or (not (< |v_ULTIMATE.start_main_~n~0#1.base_29| |c_#StackHeapBarrier|)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1435 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_1438 Int)) (or (forall ((v_ArrVal_1444 (Array Int Int)) (v_prenex_62 Int)) (or (forall ((v_ArrVal_1452 (Array Int Int))) (let ((.cse1 (select (let ((.cse3 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (store (select (store (let ((.cse2 (store (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_29| v_ArrVal_1435))) (store .cse4 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3 v_ArrVal_1438))) v_subst_1 v_ArrVal_1444))) (store .cse2 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3 v_subst_1))) v_prenex_62 v_ArrVal_1452) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3 v_prenex_62)) .cse0))) (or (= .cse1 0) (= .cse1 v_prenex_62)))) (= v_prenex_62 |c_ULTIMATE.start_main_~#list~0#1.base|))) (= |c_ULTIMATE.start_main_~#list~0#1.base| v_subst_1))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_29| Int)) (or (not (< |v_ULTIMATE.start_main_~n~0#1.base_29| |c_#StackHeapBarrier|)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1435 (Array Int Int)) (v_subst_7 Int) (v_ArrVal_1437 Int) (v_ArrVal_1438 Int)) (or (= |c_ULTIMATE.start_main_~#list~0#1.base| v_subst_7) (forall ((v_prenex_66 Int) (v_prenex_64 (Array Int Int)) (v_ArrVal_1444 (Array Int Int)) (v_prenex_63 (Array Int Int)) (v_ArrVal_1443 (Array Int Int)) (v_prenex_65 Int)) (let ((.cse6 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= (select (store (select (store (let ((.cse5 (store (let ((.cse7 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_29| v_ArrVal_1436))) (store .cse7 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse6 v_ArrVal_1437))) v_subst_7 v_ArrVal_1443))) (store .cse5 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse6 v_prenex_66))) v_prenex_65 v_prenex_64) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse6 0) .cse0) 0) (= v_prenex_65 |c_ULTIMATE.start_main_~#list~0#1.base|) (= v_prenex_65 (select (store (select (store (let ((.cse8 (store (let ((.cse9 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_29| v_ArrVal_1435))) (store .cse9 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse6 v_ArrVal_1438))) v_subst_7 v_ArrVal_1444))) (store .cse8 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse6 v_subst_7))) v_prenex_65 v_prenex_63) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse6 v_prenex_65) .cse0))))))))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#list~0#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) 0) (or .cse10 (and (forall ((|v_ULTIMATE.start_main_~n~0#1.base_29| Int)) (or (not (< |v_ULTIMATE.start_main_~n~0#1.base_29| |c_#StackHeapBarrier|)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1435 (Array Int Int)) (v_ArrVal_1444 (Array Int Int)) (v_prenex_62 Int) (v_subst_2 Int) (v_ArrVal_1438 Int)) (or (forall ((v_ArrVal_1452 (Array Int Int))) (let ((.cse11 (select (let ((.cse13 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (store (select (store (let ((.cse12 (store (let ((.cse14 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_29| v_ArrVal_1435))) (store .cse14 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse13 v_ArrVal_1438))) v_subst_2 v_ArrVal_1444))) (store .cse12 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse13 v_subst_2))) v_prenex_62 v_ArrVal_1452) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse13 v_prenex_62)) .cse0))) (or (= 0 .cse11) (= v_prenex_62 .cse11)))) (= v_prenex_62 |c_ULTIMATE.start_main_~#list~0#1.base|))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_29| Int)) (or (not (< |v_ULTIMATE.start_main_~n~0#1.base_29| |c_#StackHeapBarrier|)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1443 (Array Int Int)) (v_subst_4 Int) (v_ArrVal_1437 Int) (v_prenex_61 Int) (v_prenex_60 Int) (v_prenex_59 (Array Int Int))) (or (<= 0 (+ (select (let ((.cse16 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (store (select (store (let ((.cse15 (store (let ((.cse17 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_29| v_ArrVal_1436))) (store .cse17 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse16 v_ArrVal_1437))) v_subst_4 v_ArrVal_1443))) (store .cse15 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse15 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse16 v_prenex_60))) v_prenex_61 v_prenex_59) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse16 0)) .cse0) 4)) (= v_prenex_61 |c_ULTIMATE.start_main_~#list~0#1.base|))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_29| Int)) (or (not (< |v_ULTIMATE.start_main_~n~0#1.base_29| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1435 (Array Int Int)) (v_prenex_66 Int) (v_ArrVal_1444 (Array Int Int)) (v_ArrVal_1443 (Array Int Int)) (v_subst_5 Int) (v_prenex_65 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_64 (Array Int Int)) (v_prenex_63 (Array Int Int)) (v_ArrVal_1437 Int) (v_ArrVal_1438 Int)) (let ((.cse19 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= v_prenex_65 (select (store (select (store (let ((.cse18 (store (let ((.cse20 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_29| v_ArrVal_1435))) (store .cse20 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse20 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse19 v_ArrVal_1438))) v_subst_5 v_ArrVal_1444))) (store .cse18 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse18 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse19 v_subst_5))) v_prenex_65 v_prenex_63) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse19 v_prenex_65) .cse0)) (= 0 (select (store (select (store (let ((.cse21 (store (let ((.cse22 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_29| v_ArrVal_1436))) (store .cse22 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse22 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse19 v_ArrVal_1437))) v_subst_5 v_ArrVal_1443))) (store .cse21 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse21 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse19 v_prenex_66))) v_prenex_65 v_prenex_64) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse19 0) .cse0)) (= v_prenex_65 |c_ULTIMATE.start_main_~#list~0#1.base|)))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_29| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1443 (Array Int Int)) (v_ArrVal_1451 (Array Int Int)) (v_subst_3 Int) (v_ArrVal_1437 Int) (v_ArrVal_1447 Int) (|v_ULTIMATE.start_main_~n~0#1.base_27| Int)) (or (= |v_ULTIMATE.start_main_~n~0#1.base_27| |c_ULTIMATE.start_main_~#list~0#1.base|) (< (select (let ((.cse24 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (store (select (store (let ((.cse23 (store (let ((.cse25 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_29| v_ArrVal_1436))) (store .cse25 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse25 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse24 v_ArrVal_1437))) v_subst_3 v_ArrVal_1443))) (store .cse23 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse23 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse24 v_ArrVal_1447))) |v_ULTIMATE.start_main_~n~0#1.base_27| v_ArrVal_1451) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse24 0)) .cse0) 1))) (not (< |v_ULTIMATE.start_main_~n~0#1.base_29| |c_#StackHeapBarrier|)))))) .cse10 (forall ((|v_ULTIMATE.start_main_~n~0#1.base_29| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1436 (Array Int Int)) (v_subst_8 Int) (v_ArrVal_1437 Int)) (or (forall ((v_ArrVal_1443 (Array Int Int)) (v_ArrVal_1451 (Array Int Int)) (v_ArrVal_1447 Int) (|v_ULTIMATE.start_main_~n~0#1.base_27| Int)) (or (= |v_ULTIMATE.start_main_~n~0#1.base_27| |c_ULTIMATE.start_main_~#list~0#1.base|) (< (select (let ((.cse27 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (store (select (store (let ((.cse26 (store (let ((.cse28 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_29| v_ArrVal_1436))) (store .cse28 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse28 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse27 v_ArrVal_1437))) v_subst_8 v_ArrVal_1443))) (store .cse26 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse26 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse27 v_ArrVal_1447))) |v_ULTIMATE.start_main_~n~0#1.base_27| v_ArrVal_1451) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse27 0)) .cse0) 1))) (= |c_ULTIMATE.start_main_~#list~0#1.base| v_subst_8))) (not (< |v_ULTIMATE.start_main_~n~0#1.base_29| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_29| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1436 (Array Int Int)) (v_subst_6 Int) (v_ArrVal_1437 Int)) (or (= |c_ULTIMATE.start_main_~#list~0#1.base| v_subst_6) (forall ((v_ArrVal_1443 (Array Int Int)) (v_prenex_61 Int) (v_prenex_60 Int) (v_prenex_59 (Array Int Int))) (or (= v_prenex_61 |c_ULTIMATE.start_main_~#list~0#1.base|) (<= 0 (+ (select (let ((.cse30 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (store (select (store (let ((.cse29 (store (let ((.cse31 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_29| v_ArrVal_1436))) (store .cse31 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse31 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse30 v_ArrVal_1437))) v_subst_6 v_ArrVal_1443))) (store .cse29 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse29 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse30 v_prenex_60))) v_prenex_61 v_prenex_59) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse30 0)) .cse0) 4)))))) (not (< |v_ULTIMATE.start_main_~n~0#1.base_29| |c_#StackHeapBarrier|)))))) is different from false [2022-11-02 20:56:58,427 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse36 (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0)) (.cse0 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (and (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#list~0#1.base|) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_29| Int)) (or (not (< |v_ULTIMATE.start_main_~n~0#1.base_29| |c_#StackHeapBarrier|)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1435 (Array Int Int)) (v_subst_7 Int) (v_ArrVal_1437 Int) (v_ArrVal_1438 Int)) (or (forall ((v_prenex_66 Int) (v_prenex_64 (Array Int Int)) (v_ArrVal_1444 (Array Int Int)) (v_prenex_63 (Array Int Int)) (v_ArrVal_1443 (Array Int Int)) (v_prenex_65 Int)) (let ((.cse2 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_65) (= (select (select (let ((.cse1 (store (let ((.cse3 (store (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_29| v_ArrVal_1436))) (store .cse4 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse2 v_ArrVal_1437))) v_subst_7 v_ArrVal_1443))) (store .cse3 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse2 v_prenex_66))) v_prenex_65 v_prenex_64))) (store .cse1 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse2 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) 0) (= (select (select (let ((.cse5 (store (let ((.cse6 (store (let ((.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_29| v_ArrVal_1435))) (store .cse7 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse2 v_ArrVal_1438))) v_subst_7 v_ArrVal_1444))) (store .cse6 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse2 v_subst_7))) v_prenex_65 v_prenex_63))) (store .cse5 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse2 v_prenex_65))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) v_prenex_65)))) (= |c_ULTIMATE.start_main_~#list~0#1.base| v_subst_7))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_29| Int)) (or (not (< |v_ULTIMATE.start_main_~n~0#1.base_29| |c_#StackHeapBarrier|)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1436 (Array Int Int)) (v_subst_8 Int) (v_ArrVal_1437 Int)) (or (= |c_ULTIMATE.start_main_~#list~0#1.base| v_subst_8) (forall ((v_ArrVal_1443 (Array Int Int)) (v_ArrVal_1451 (Array Int Int)) (v_ArrVal_1447 Int) (|v_ULTIMATE.start_main_~n~0#1.base_27| Int)) (or (< (select (select (let ((.cse9 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse8 (store (let ((.cse10 (store (let ((.cse11 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_29| v_ArrVal_1436))) (store .cse11 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse9 v_ArrVal_1437))) v_subst_8 v_ArrVal_1443))) (store .cse10 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse9 v_ArrVal_1447))) |v_ULTIMATE.start_main_~n~0#1.base_27| v_ArrVal_1451))) (store .cse8 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse9 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) 1) (= |v_ULTIMATE.start_main_~n~0#1.base_27| |c_ULTIMATE.start_main_~tail~0#1.base|))))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) 0) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_29| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1436 (Array Int Int)) (v_subst_6 Int) (v_ArrVal_1437 Int)) (or (forall ((v_ArrVal_1443 (Array Int Int)) (v_prenex_61 Int) (v_prenex_60 Int) (v_prenex_59 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_61) (<= 0 (+ (select (select (let ((.cse13 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse12 (store (let ((.cse14 (store (let ((.cse15 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_29| v_ArrVal_1436))) (store .cse15 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse15 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse13 v_ArrVal_1437))) v_subst_6 v_ArrVal_1443))) (store .cse14 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse13 v_prenex_60))) v_prenex_61 v_prenex_59))) (store .cse12 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse13 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) 4)))) (= |c_ULTIMATE.start_main_~#list~0#1.base| v_subst_6))) (not (< |v_ULTIMATE.start_main_~n~0#1.base_29| |c_#StackHeapBarrier|)))) (or (and (forall ((|v_ULTIMATE.start_main_~n~0#1.base_29| Int)) (or (not (< |v_ULTIMATE.start_main_~n~0#1.base_29| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1435 (Array Int Int)) (v_prenex_66 Int) (v_ArrVal_1444 (Array Int Int)) (v_ArrVal_1443 (Array Int Int)) (v_subst_5 Int) (v_prenex_65 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_64 (Array Int Int)) (v_prenex_63 (Array Int Int)) (v_ArrVal_1437 Int) (v_ArrVal_1438 Int)) (let ((.cse17 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= 0 (select (select (let ((.cse16 (store (let ((.cse18 (store (let ((.cse19 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_29| v_ArrVal_1436))) (store .cse19 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse19 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse17 v_ArrVal_1437))) v_subst_5 v_ArrVal_1443))) (store .cse18 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse18 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse17 v_prenex_66))) v_prenex_65 v_prenex_64))) (store .cse16 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse16 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse17 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0)) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_65) (= v_prenex_65 (select (select (let ((.cse20 (store (let ((.cse21 (store (let ((.cse22 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_29| v_ArrVal_1435))) (store .cse22 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse22 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse17 v_ArrVal_1438))) v_subst_5 v_ArrVal_1444))) (store .cse21 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse21 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse17 v_subst_5))) v_prenex_65 v_prenex_63))) (store .cse20 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse20 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse17 v_prenex_65))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0))))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_29| Int)) (or (not (< |v_ULTIMATE.start_main_~n~0#1.base_29| |c_#StackHeapBarrier|)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1443 (Array Int Int)) (v_subst_4 Int) (v_ArrVal_1437 Int) (v_prenex_61 Int) (v_prenex_60 Int) (v_prenex_59 (Array Int Int))) (or (<= 0 (+ (select (select (let ((.cse24 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse23 (store (let ((.cse25 (store (let ((.cse26 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_29| v_ArrVal_1436))) (store .cse26 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse26 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse24 v_ArrVal_1437))) v_subst_4 v_ArrVal_1443))) (store .cse25 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse25 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse24 v_prenex_60))) v_prenex_61 v_prenex_59))) (store .cse23 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse23 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse24 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) 4)) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_61))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_29| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1443 (Array Int Int)) (v_ArrVal_1451 (Array Int Int)) (v_subst_3 Int) (v_ArrVal_1437 Int) (v_ArrVal_1447 Int) (|v_ULTIMATE.start_main_~n~0#1.base_27| Int)) (or (= |v_ULTIMATE.start_main_~n~0#1.base_27| |c_ULTIMATE.start_main_~tail~0#1.base|) (< (select (select (let ((.cse28 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse27 (store (let ((.cse29 (store (let ((.cse30 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_29| v_ArrVal_1436))) (store .cse30 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse30 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse28 v_ArrVal_1437))) v_subst_3 v_ArrVal_1443))) (store .cse29 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse29 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse28 v_ArrVal_1447))) |v_ULTIMATE.start_main_~n~0#1.base_27| v_ArrVal_1451))) (store .cse27 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse27 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse28 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) 1))) (not (< |v_ULTIMATE.start_main_~n~0#1.base_29| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_29| Int)) (or (not (< |v_ULTIMATE.start_main_~n~0#1.base_29| |c_#StackHeapBarrier|)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1435 (Array Int Int)) (v_ArrVal_1444 (Array Int Int)) (v_prenex_62 Int) (v_subst_2 Int) (v_ArrVal_1438 Int)) (or (forall ((v_ArrVal_1452 (Array Int Int))) (let ((.cse31 (select (select (let ((.cse33 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse32 (store (let ((.cse34 (store (let ((.cse35 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_29| v_ArrVal_1435))) (store .cse35 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse35 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse33 v_ArrVal_1438))) v_subst_2 v_ArrVal_1444))) (store .cse34 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse34 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse33 v_subst_2))) v_prenex_62 v_ArrVal_1452))) (store .cse32 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse32 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse33 v_prenex_62)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0))) (or (= .cse31 0) (= .cse31 v_prenex_62)))) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_62)))))) .cse36) (= |c_ULTIMATE.start_main_~tail~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|) (= |c_ULTIMATE.start_main_~tail~0#1.offset| |c_ULTIMATE.start_main_~#list~0#1.offset|) .cse36 (forall ((|v_ULTIMATE.start_main_~n~0#1.base_29| Int)) (or (not (< |v_ULTIMATE.start_main_~n~0#1.base_29| |c_#StackHeapBarrier|)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1435 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_1438 Int)) (or (forall ((v_ArrVal_1444 (Array Int Int)) (v_prenex_62 Int)) (or (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_62) (forall ((v_ArrVal_1452 (Array Int Int))) (let ((.cse37 (select (select (let ((.cse39 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse38 (store (let ((.cse40 (store (let ((.cse41 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_29| v_ArrVal_1435))) (store .cse41 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse41 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse39 v_ArrVal_1438))) v_subst_1 v_ArrVal_1444))) (store .cse40 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse40 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse39 v_subst_1))) v_prenex_62 v_ArrVal_1452))) (store .cse38 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse38 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse39 v_prenex_62)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0))) (or (= .cse37 0) (= .cse37 v_prenex_62)))))) (= |c_ULTIMATE.start_main_~#list~0#1.base| v_subst_1))))))) is different from false [2022-11-02 20:57:00,452 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse16 (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0)) (.cse0 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (and (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1436 (Array Int Int)) (v_subst_6 Int) (v_ArrVal_1437 Int)) (or (forall ((v_ArrVal_1443 (Array Int Int)) (v_prenex_61 Int) (v_prenex_60 Int) (v_prenex_59 (Array Int Int))) (or (<= 0 (+ (select (select (let ((.cse2 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse1 (store (let ((.cse3 (store (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1436))) (store .cse4 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse2 v_ArrVal_1437))) v_subst_6 v_ArrVal_1443))) (store .cse3 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse2 v_prenex_60))) v_prenex_61 v_prenex_59))) (store .cse1 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse2 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) 4)) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_61))) (= |c_ULTIMATE.start_main_~#list~0#1.base| v_subst_6))) (<= (+ 2 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.base|) (= (select |c_#length| |c_ULTIMATE.start_main_~n~0#1.base|) 8) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1435 (Array Int Int)) (v_subst_7 Int) (v_ArrVal_1437 Int) (v_ArrVal_1438 Int)) (or (= |c_ULTIMATE.start_main_~#list~0#1.base| v_subst_7) (forall ((v_prenex_66 Int) (v_prenex_64 (Array Int Int)) (v_ArrVal_1444 (Array Int Int)) (v_prenex_63 (Array Int Int)) (v_ArrVal_1443 (Array Int Int)) (v_prenex_65 Int)) (let ((.cse6 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= (select (select (let ((.cse5 (store (let ((.cse7 (store (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1436))) (store .cse8 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse6 v_ArrVal_1437))) v_subst_7 v_ArrVal_1443))) (store .cse7 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse6 v_prenex_66))) v_prenex_65 v_prenex_64))) (store .cse5 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse6 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) 0) (= (select (select (let ((.cse9 (store (let ((.cse10 (store (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1435))) (store .cse11 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse6 v_ArrVal_1438))) v_subst_7 v_ArrVal_1444))) (store .cse10 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse6 v_subst_7))) v_prenex_65 v_prenex_63))) (store .cse9 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse6 v_prenex_65))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) v_prenex_65) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_65)))))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1436 (Array Int Int)) (v_subst_8 Int) (v_ArrVal_1437 Int)) (or (forall ((v_ArrVal_1443 (Array Int Int)) (v_ArrVal_1451 (Array Int Int)) (v_ArrVal_1447 Int) (|v_ULTIMATE.start_main_~n~0#1.base_27| Int)) (or (= |v_ULTIMATE.start_main_~n~0#1.base_27| |c_ULTIMATE.start_main_~tail~0#1.base|) (< (select (select (let ((.cse13 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse12 (store (let ((.cse14 (store (let ((.cse15 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1436))) (store .cse15 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse15 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse13 v_ArrVal_1437))) v_subst_8 v_ArrVal_1443))) (store .cse14 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse13 v_ArrVal_1447))) |v_ULTIMATE.start_main_~n~0#1.base_27| v_ArrVal_1451))) (store .cse12 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse13 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) 1))) (= |c_ULTIMATE.start_main_~#list~0#1.base| v_subst_8))) (or .cse16 (and (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1435 (Array Int Int)) (v_ArrVal_1444 (Array Int Int)) (v_prenex_62 Int) (v_subst_2 Int) (v_ArrVal_1438 Int)) (or (forall ((v_ArrVal_1452 (Array Int Int))) (let ((.cse17 (select (select (let ((.cse19 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse18 (store (let ((.cse20 (store (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1435))) (store .cse21 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse21 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse19 v_ArrVal_1438))) v_subst_2 v_ArrVal_1444))) (store .cse20 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse20 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse19 v_subst_2))) v_prenex_62 v_ArrVal_1452))) (store .cse18 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse18 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse19 v_prenex_62)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0))) (or (= .cse17 v_prenex_62) (= .cse17 0)))) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_62))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1443 (Array Int Int)) (v_ArrVal_1451 (Array Int Int)) (v_subst_3 Int) (v_ArrVal_1437 Int) (v_ArrVal_1447 Int) (|v_ULTIMATE.start_main_~n~0#1.base_27| Int)) (or (= |v_ULTIMATE.start_main_~n~0#1.base_27| |c_ULTIMATE.start_main_~tail~0#1.base|) (< (select (select (let ((.cse23 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse22 (store (let ((.cse24 (store (let ((.cse25 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1436))) (store .cse25 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse25 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse23 v_ArrVal_1437))) v_subst_3 v_ArrVal_1443))) (store .cse24 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse24 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse23 v_ArrVal_1447))) |v_ULTIMATE.start_main_~n~0#1.base_27| v_ArrVal_1451))) (store .cse22 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse22 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse23 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) 1))) (forall ((v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1435 (Array Int Int)) (v_prenex_66 Int) (v_ArrVal_1444 (Array Int Int)) (v_ArrVal_1443 (Array Int Int)) (v_subst_5 Int) (v_prenex_65 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_64 (Array Int Int)) (v_prenex_63 (Array Int Int)) (v_ArrVal_1437 Int) (v_ArrVal_1438 Int)) (let ((.cse27 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_65) (= v_prenex_65 (select (select (let ((.cse26 (store (let ((.cse28 (store (let ((.cse29 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1435))) (store .cse29 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse29 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse27 v_ArrVal_1438))) v_subst_5 v_ArrVal_1444))) (store .cse28 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse28 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse27 v_subst_5))) v_prenex_65 v_prenex_63))) (store .cse26 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse26 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse27 v_prenex_65))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0)) (= (select (select (let ((.cse30 (store (let ((.cse31 (store (let ((.cse32 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1436))) (store .cse32 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse32 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse27 v_ArrVal_1437))) v_subst_5 v_ArrVal_1443))) (store .cse31 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse31 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse27 v_prenex_66))) v_prenex_65 v_prenex_64))) (store .cse30 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse30 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse27 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) 0)))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1443 (Array Int Int)) (v_subst_4 Int) (v_ArrVal_1437 Int) (v_prenex_61 Int) (v_prenex_60 Int) (v_prenex_59 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_61) (<= 0 (+ (select (select (let ((.cse34 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse33 (store (let ((.cse35 (store (let ((.cse36 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1436))) (store .cse36 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse36 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse34 v_ArrVal_1437))) v_subst_4 v_ArrVal_1443))) (store .cse35 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse35 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse34 v_prenex_60))) v_prenex_61 v_prenex_59))) (store .cse33 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse33 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse34 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) 4)))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|) (= |c_ULTIMATE.start_main_~tail~0#1.offset| |c_ULTIMATE.start_main_~#list~0#1.offset|) .cse16 (= |c_ULTIMATE.start_main_~n~0#1.offset| 0) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1435 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_1438 Int)) (or (forall ((v_ArrVal_1444 (Array Int Int)) (v_prenex_62 Int)) (or (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_62) (forall ((v_ArrVal_1452 (Array Int Int))) (let ((.cse37 (select (select (let ((.cse39 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse38 (store (let ((.cse40 (store (let ((.cse41 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1435))) (store .cse41 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse41 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse39 v_ArrVal_1438))) v_subst_1 v_ArrVal_1444))) (store .cse40 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse40 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse39 v_subst_1))) v_prenex_62 v_ArrVal_1452))) (store .cse38 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse38 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse39 v_prenex_62)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0))) (or (= v_prenex_62 .cse37) (= 0 .cse37)))))) (= |c_ULTIMATE.start_main_~#list~0#1.base| v_subst_1))))) is different from false