./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/heap-data/shared_mem2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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_e96f2862-86cc-491a-902e-a83a95c8c0b5/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96f2862-86cc-491a-902e-a83a95c8c0b5/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_e96f2862-86cc-491a-902e-a83a95c8c0b5/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96f2862-86cc-491a-902e-a83a95c8c0b5/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/heap-data/shared_mem2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96f2862-86cc-491a-902e-a83a95c8c0b5/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96f2862-86cc-491a-902e-a83a95c8c0b5/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0f2b1437458922f937e4f63e8c97355790d0c2b77a3c021e76d395c8c90c4257 --- 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 21:00:12,693 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:00:12,695 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:00:12,736 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:00:12,737 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:00:12,741 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:00:12,743 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:00:12,747 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:00:12,749 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:00:12,754 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:00:12,755 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:00:12,758 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:00:12,758 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:00:12,760 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:00:12,762 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:00:12,764 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:00:12,766 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:00:12,766 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:00:12,768 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:00:12,777 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:00:12,779 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:00:12,780 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:00:12,783 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:00:12,784 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:00:12,793 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:00:12,794 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:00:12,794 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:00:12,797 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:00:12,797 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:00:12,798 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:00:12,799 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:00:12,800 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:00:12,801 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:00:12,802 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:00:12,803 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:00:12,803 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:00:12,804 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:00:12,804 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:00:12,804 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:00:12,805 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:00:12,806 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:00:12,807 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96f2862-86cc-491a-902e-a83a95c8c0b5/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 21:00:12,853 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:00:12,853 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:00:12,854 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:00:12,854 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:00:12,855 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:00:12,855 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:00:12,856 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:00:12,856 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:00:12,856 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:00:12,856 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:00:12,857 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 21:00:12,858 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:00:12,858 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 21:00:12,858 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:00:12,858 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 21:00:12,858 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:00:12,858 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 21:00:12,859 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 21:00:12,859 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:00:12,859 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:00:12,859 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 21:00:12,859 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:00:12,859 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:00:12,860 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:00:12,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:00:12,860 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:00:12,861 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:00:12,862 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 21:00:12,862 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:00:12,863 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:00:12,863 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 21:00:12,863 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 21:00:12,863 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 21:00:12,863 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_e96f2862-86cc-491a-902e-a83a95c8c0b5/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_e96f2862-86cc-491a-902e-a83a95c8c0b5/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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0f2b1437458922f937e4f63e8c97355790d0c2b77a3c021e76d395c8c90c4257 [2022-11-02 21:00:13,162 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:00:13,221 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:00:13,224 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:00:13,225 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:00:13,226 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:00:13,227 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96f2862-86cc-491a-902e-a83a95c8c0b5/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/heap-data/shared_mem2.i [2022-11-02 21:00:13,317 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96f2862-86cc-491a-902e-a83a95c8c0b5/bin/uautomizer-Dbtcem3rbc/data/6f1c4462d/cd24b1cf44094064bbe255afa0018e21/FLAG9b063f693 [2022-11-02 21:00:13,939 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:00:13,939 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96f2862-86cc-491a-902e-a83a95c8c0b5/sv-benchmarks/c/heap-data/shared_mem2.i [2022-11-02 21:00:13,954 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96f2862-86cc-491a-902e-a83a95c8c0b5/bin/uautomizer-Dbtcem3rbc/data/6f1c4462d/cd24b1cf44094064bbe255afa0018e21/FLAG9b063f693 [2022-11-02 21:00:14,224 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96f2862-86cc-491a-902e-a83a95c8c0b5/bin/uautomizer-Dbtcem3rbc/data/6f1c4462d/cd24b1cf44094064bbe255afa0018e21 [2022-11-02 21:00:14,227 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:00:14,228 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:00:14,230 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:00:14,230 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:00:14,234 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:00:14,235 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:00:14" (1/1) ... [2022-11-02 21:00:14,236 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4276991f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:14, skipping insertion in model container [2022-11-02 21:00:14,236 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:00:14" (1/1) ... [2022-11-02 21:00:14,250 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:00:14,280 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:00:14,592 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_e96f2862-86cc-491a-902e-a83a95c8c0b5/sv-benchmarks/c/heap-data/shared_mem2.i[23827,23840] [2022-11-02 21:00:14,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:00:14,603 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:00:14,643 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_e96f2862-86cc-491a-902e-a83a95c8c0b5/sv-benchmarks/c/heap-data/shared_mem2.i[23827,23840] [2022-11-02 21:00:14,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:00:14,668 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:00:14,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:14 WrapperNode [2022-11-02 21:00:14,676 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:00:14,677 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:00:14,677 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:00:14,677 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:00:14,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:14" (1/1) ... [2022-11-02 21:00:14,713 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:14" (1/1) ... [2022-11-02 21:00:14,736 INFO L138 Inliner]: procedures = 121, calls = 27, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 71 [2022-11-02 21:00:14,736 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:00:14,737 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:00:14,737 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:00:14,737 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:00:14,746 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:14" (1/1) ... [2022-11-02 21:00:14,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:14" (1/1) ... [2022-11-02 21:00:14,760 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:14" (1/1) ... [2022-11-02 21:00:14,762 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:14" (1/1) ... [2022-11-02 21:00:14,768 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:14" (1/1) ... [2022-11-02 21:00:14,778 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:14" (1/1) ... [2022-11-02 21:00:14,786 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:14" (1/1) ... [2022-11-02 21:00:14,787 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:14" (1/1) ... [2022-11-02 21:00:14,789 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:00:14,796 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:00:14,796 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:00:14,796 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:00:14,797 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:14" (1/1) ... [2022-11-02 21:00:14,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:00:14,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96f2862-86cc-491a-902e-a83a95c8c0b5/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:00:14,831 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96f2862-86cc-491a-902e-a83a95c8c0b5/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:00:14,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96f2862-86cc-491a-902e-a83a95c8c0b5/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:00:14,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 21:00:14,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 21:00:14,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 21:00:14,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:00:14,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 21:00:14,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 21:00:14,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:00:14,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:00:14,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:00:15,084 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:00:15,086 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:00:15,355 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:00:15,361 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:00:15,361 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-02 21:00:15,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:00:15 BoogieIcfgContainer [2022-11-02 21:00:15,363 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:00:15,366 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:00:15,366 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:00:15,370 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:00:15,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:00:14" (1/3) ... [2022-11-02 21:00:15,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@475adee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:00:15, skipping insertion in model container [2022-11-02 21:00:15,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:14" (2/3) ... [2022-11-02 21:00:15,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@475adee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:00:15, skipping insertion in model container [2022-11-02 21:00:15,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:00:15" (3/3) ... [2022-11-02 21:00:15,373 INFO L112 eAbstractionObserver]: Analyzing ICFG shared_mem2.i [2022-11-02 21:00:15,393 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:00:15,393 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 21:00:15,455 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:00:15,462 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1545e569, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:00:15,462 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 21:00:15,467 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 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 21:00:15,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-02 21:00:15,474 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:15,475 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:00:15,475 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:00:15,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:15,481 INFO L85 PathProgramCache]: Analyzing trace with hash 561717608, now seen corresponding path program 1 times [2022-11-02 21:00:15,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:15,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237500070] [2022-11-02 21:00:15,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:15,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:15,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:15,685 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 21:00:15,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:15,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237500070] [2022-11-02 21:00:15,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237500070] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:00:15,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:00:15,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:00:15,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469335010] [2022-11-02 21:00:15,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:00:15,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 21:00:15,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:15,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 21:00:15,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 21:00:15,736 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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 21:00:15,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:15,752 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2022-11-02 21:00:15,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 21:00:15,755 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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 21:00:15,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:00:15,763 INFO L225 Difference]: With dead ends: 29 [2022-11-02 21:00:15,764 INFO L226 Difference]: Without dead ends: 14 [2022-11-02 21:00:15,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 21:00:15,771 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:00:15,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:00:15,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-11-02 21:00:15,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-11-02 21:00:15,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 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 21:00:15,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2022-11-02 21:00:15,801 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 8 [2022-11-02 21:00:15,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:00:15,802 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2022-11-02 21:00:15,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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 21:00:15,802 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2022-11-02 21:00:15,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-02 21:00:15,803 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:15,803 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:00:15,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:00:15,804 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:00:15,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:15,805 INFO L85 PathProgramCache]: Analyzing trace with hash -861307399, now seen corresponding path program 1 times [2022-11-02 21:00:15,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:15,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533234409] [2022-11-02 21:00:15,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:15,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:15,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:16,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 21:00:16,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:16,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533234409] [2022-11-02 21:00:16,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533234409] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:00:16,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:00:16,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:00:16,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128157999] [2022-11-02 21:00:16,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:00:16,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:00:16,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:16,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:00:16,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:00:16,287 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:16,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:16,400 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-11-02 21:00:16,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:00:16,401 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-02 21:00:16,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:00:16,402 INFO L225 Difference]: With dead ends: 26 [2022-11-02 21:00:16,402 INFO L226 Difference]: Without dead ends: 22 [2022-11-02 21:00:16,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:00:16,408 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 8 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:00:16,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 43 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:00:16,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-11-02 21:00:16,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-11-02 21:00:16,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:16,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2022-11-02 21:00:16,416 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 10 [2022-11-02 21:00:16,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:00:16,418 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-11-02 21:00:16,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:16,419 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-11-02 21:00:16,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:00:16,420 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:16,420 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:00:16,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:00:16,420 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:00:16,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:16,420 INFO L85 PathProgramCache]: Analyzing trace with hash 909226845, now seen corresponding path program 1 times [2022-11-02 21:00:16,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:16,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870483936] [2022-11-02 21:00:16,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:16,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:16,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:16,976 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:00:16,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:16,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870483936] [2022-11-02 21:00:16,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870483936] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:00:16,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326776340] [2022-11-02 21:00:16,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:16,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:00:16,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96f2862-86cc-491a-902e-a83a95c8c0b5/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:00:16,984 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96f2862-86cc-491a-902e-a83a95c8c0b5/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:00:17,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96f2862-86cc-491a-902e-a83a95c8c0b5/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 21:00:17,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:17,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-02 21:00:17,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:00:17,193 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:00:17,194 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 19 treesize of output 18 [2022-11-02 21:00:17,205 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 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-02 21:00:17,210 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 21:00:17,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:00:17,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:00:17,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 21:00:17,320 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-02 21:00:17,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 21:00:17,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:00:17,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:00:17,467 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~n~0#1.base_3| Int) (v_ArrVal_181 (Array Int Int)) (v_ArrVal_179 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |v_ULTIMATE.start_main_~n~0#1.base_3| v_ArrVal_181) |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_179) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~n~0#1.base_3|) 0)) (< .cse0 100) (= .cse0 100)))) is different from false [2022-11-02 21:00:17,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-02 21:00:17,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326776340] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:00:17,527 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:00:17,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 13 [2022-11-02 21:00:17,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838501925] [2022-11-02 21:00:17,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:00:17,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 21:00:17,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:17,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 21:00:17,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=98, Unknown=1, NotChecked=20, Total=156 [2022-11-02 21:00:17,530 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 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 21:00:17,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:17,780 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-11-02 21:00:17,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:00:17,781 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-02 21:00:17,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:00:17,783 INFO L225 Difference]: With dead ends: 38 [2022-11-02 21:00:17,783 INFO L226 Difference]: Without dead ends: 34 [2022-11-02 21:00:17,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=151, Unknown=1, NotChecked=26, Total=240 [2022-11-02 21:00:17,784 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:00:17,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 55 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 51 Invalid, 0 Unknown, 16 Unchecked, 0.1s Time] [2022-11-02 21:00:17,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-02 21:00:17,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 18. [2022-11-02 21:00:17,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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 21:00:17,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-11-02 21:00:17,790 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 13 [2022-11-02 21:00:17,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:00:17,790 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-11-02 21:00:17,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 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 21:00:17,791 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-11-02 21:00:17,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 21:00:17,791 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:17,792 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:00:17,850 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96f2862-86cc-491a-902e-a83a95c8c0b5/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 21:00:17,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96f2862-86cc-491a-902e-a83a95c8c0b5/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:00:17,993 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:00:17,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:17,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1525342480, now seen corresponding path program 1 times [2022-11-02 21:00:17,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:17,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159762972] [2022-11-02 21:00:17,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:17,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:18,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:00:18,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:18,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159762972] [2022-11-02 21:00:18,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159762972] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:00:18,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195893849] [2022-11-02 21:00:18,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:18,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:00:18,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96f2862-86cc-491a-902e-a83a95c8c0b5/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:00:18,591 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96f2862-86cc-491a-902e-a83a95c8c0b5/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:00:18,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96f2862-86cc-491a-902e-a83a95c8c0b5/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 21:00:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:18,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-02 21:00:18,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:00:18,736 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 18 treesize of output 19 [2022-11-02 21:00:18,754 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 18 treesize of output 19 [2022-11-02 21:00:18,929 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 89 treesize of output 59 [2022-11-02 21:00:18,944 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 65 treesize of output 41 [2022-11-02 21:00:19,003 INFO L356 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-02 21:00:19,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 45 [2022-11-02 21:00:19,158 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 22 treesize of output 10 [2022-11-02 21:00:19,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:00:19,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:00:19,385 INFO L356 Elim1Store]: treesize reduction 23, result has 60.3 percent of original size [2022-11-02 21:00:19,386 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 93 [2022-11-02 21:00:19,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:00:19,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195893849] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:00:19,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:00:19,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 20 [2022-11-02 21:00:19,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630281072] [2022-11-02 21:00:19,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:00:19,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-02 21:00:19,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:19,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-02 21:00:19,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2022-11-02 21:00:19,619 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:20,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:20,192 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2022-11-02 21:00:20,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:00:20,194 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-02 21:00:20,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:00:20,194 INFO L225 Difference]: With dead ends: 41 [2022-11-02 21:00:20,194 INFO L226 Difference]: Without dead ends: 29 [2022-11-02 21:00:20,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2022-11-02 21:00:20,196 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 39 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:00:20,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 123 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 107 Invalid, 0 Unknown, 15 Unchecked, 0.3s Time] [2022-11-02 21:00:20,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-02 21:00:20,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2022-11-02 21:00:20,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:20,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2022-11-02 21:00:20,202 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 14 [2022-11-02 21:00:20,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:00:20,202 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2022-11-02 21:00:20,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:20,202 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-11-02 21:00:20,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 21:00:20,208 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:20,209 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:00:20,244 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96f2862-86cc-491a-902e-a83a95c8c0b5/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 21:00:20,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96f2862-86cc-491a-902e-a83a95c8c0b5/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:00:20,427 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:00:20,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:20,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1328429964, now seen corresponding path program 1 times [2022-11-02 21:00:20,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:20,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648452577] [2022-11-02 21:00:20,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:20,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:20,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:21,326 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 21:00:21,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:21,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648452577] [2022-11-02 21:00:21,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648452577] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:00:21,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170730254] [2022-11-02 21:00:21,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:21,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:00:21,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96f2862-86cc-491a-902e-a83a95c8c0b5/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:00:21,331 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96f2862-86cc-491a-902e-a83a95c8c0b5/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:00:21,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96f2862-86cc-491a-902e-a83a95c8c0b5/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 21:00:21,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:21,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-02 21:00:21,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:00:21,482 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 18 treesize of output 19 [2022-11-02 21:00:21,498 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 21:00:21,499 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-02 21:00:21,513 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 18 treesize of output 19 [2022-11-02 21:00:21,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:00:21,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:00:21,604 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 26 treesize of output 23 [2022-11-02 21:00:21,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:00:21,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:00:21,616 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 26 treesize of output 23 [2022-11-02 21:00:21,624 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:00:21,625 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 21:00:21,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:00:21,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2022-11-02 21:00:21,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:00:21,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2022-11-02 21:00:21,782 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 89 treesize of output 59 [2022-11-02 21:00:21,787 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 65 treesize of output 41 [2022-11-02 21:00:21,822 INFO L356 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-02 21:00:21,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 45 [2022-11-02 21:00:21,945 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 22 treesize of output 10 [2022-11-02 21:00:21,973 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 21:00:21,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:00:22,180 INFO L356 Elim1Store]: treesize reduction 23, result has 60.3 percent of original size [2022-11-02 21:00:22,180 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 93 [2022-11-02 21:00:22,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:00:22,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170730254] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:00:22,671 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:00:22,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 24 [2022-11-02 21:00:22,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401793853] [2022-11-02 21:00:22,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:00:22,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-02 21:00:22,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:22,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-02 21:00:22,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2022-11-02 21:00:22,673 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 24 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:23,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:23,403 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2022-11-02 21:00:23,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 21:00:23,405 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 24 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-02 21:00:23,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:00:23,406 INFO L225 Difference]: With dead ends: 46 [2022-11-02 21:00:23,406 INFO L226 Difference]: Without dead ends: 34 [2022-11-02 21:00:23,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=164, Invalid=706, Unknown=0, NotChecked=0, Total=870 [2022-11-02 21:00:23,408 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 51 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:00:23,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 83 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 93 Invalid, 0 Unknown, 26 Unchecked, 0.2s Time] [2022-11-02 21:00:23,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-02 21:00:23,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 21. [2022-11-02 21:00:23,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:23,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-11-02 21:00:23,414 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 17 [2022-11-02 21:00:23,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:00:23,414 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-11-02 21:00:23,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 24 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:23,415 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-11-02 21:00:23,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 21:00:23,416 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:23,416 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:00:23,457 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96f2862-86cc-491a-902e-a83a95c8c0b5/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 21:00:23,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96f2862-86cc-491a-902e-a83a95c8c0b5/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:00:23,639 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:00:23,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:23,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1426514087, now seen corresponding path program 2 times [2022-11-02 21:00:23,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:23,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314977758] [2022-11-02 21:00:23,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:23,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:23,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:25,008 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:00:25,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:25,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314977758] [2022-11-02 21:00:25,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314977758] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:00:25,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942679658] [2022-11-02 21:00:25,009 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:00:25,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:00:25,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96f2862-86cc-491a-902e-a83a95c8c0b5/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:00:25,011 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96f2862-86cc-491a-902e-a83a95c8c0b5/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:00:25,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96f2862-86cc-491a-902e-a83a95c8c0b5/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 21:00:25,155 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 21:00:25,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:00:25,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-02 21:00:25,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:00:25,183 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 18 treesize of output 19 [2022-11-02 21:00:25,190 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 10 treesize of output 8 [2022-11-02 21:00:25,200 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-02 21:00:25,392 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:00:25,392 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 42 [2022-11-02 21:00:25,400 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 31 treesize of output 31 [2022-11-02 21:00:25,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 56 [2022-11-02 21:00:25,577 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 0 case distinctions, treesize of input 50 treesize of output 29 [2022-11-02 21:00:25,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-02 21:00:25,684 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 22 treesize of output 10 [2022-11-02 21:00:25,702 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 21:00:25,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:00:25,853 INFO L356 Elim1Store]: treesize reduction 23, result has 60.3 percent of original size [2022-11-02 21:00:25,854 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 154 treesize of output 140 [2022-11-02 21:00:26,147 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (.cse2 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((v_ArrVal_492 (Array Int Int)) (v_ArrVal_493 (Array Int Int))) (= |c_ULTIMATE.start_main_~m~0#1.offset| (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_492))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_493) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (+ (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 4))))) (forall ((v_ArrVal_492 (Array Int Int)) (v_ArrVal_493 (Array Int Int))) (= |c_ULTIMATE.start_main_~m~0#1.base| (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_493))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))) (+ (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_492) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 4)))))) is different from false [2022-11-02 21:00:26,175 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_492 (Array Int Int)) (v_ArrVal_493 (Array Int Int))) (= |c_ULTIMATE.start_main_~m~0#1.offset| (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_492))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_493) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (+ (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 4))))) (forall ((v_ArrVal_492 (Array Int Int)) (v_ArrVal_493 (Array Int Int))) (= |c_ULTIMATE.start_main_~m~0#1.base| (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_493))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (+ (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_492) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 4)))))) is different from false [2022-11-02 21:00:26,206 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-02 21:00:26,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942679658] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:00:26,206 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:00:26,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 11] total 23 [2022-11-02 21:00:26,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378287726] [2022-11-02 21:00:26,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:00:26,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-02 21:00:26,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:26,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-02 21:00:26,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=356, Unknown=2, NotChecked=78, Total=506 [2022-11-02 21:00:26,209 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 23 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:27,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:27,737 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-11-02 21:00:27,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 21:00:27,737 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 23 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-02 21:00:27,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:00:27,738 INFO L225 Difference]: With dead ends: 53 [2022-11-02 21:00:27,738 INFO L226 Difference]: Without dead ends: 49 [2022-11-02 21:00:27,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 22 SyntacticMatches, 8 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=218, Invalid=780, Unknown=2, NotChecked=122, Total=1122 [2022-11-02 21:00:27,740 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 77 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:00:27,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 143 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 127 Invalid, 0 Unknown, 56 Unchecked, 0.5s Time] [2022-11-02 21:00:27,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-02 21:00:27,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 39. [2022-11-02 21:00:27,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:27,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2022-11-02 21:00:27,754 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 18 [2022-11-02 21:00:27,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:00:27,754 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2022-11-02 21:00:27,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 23 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:27,755 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2022-11-02 21:00:27,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-02 21:00:27,757 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:27,757 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:00:27,797 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96f2862-86cc-491a-902e-a83a95c8c0b5/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 21:00:27,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96f2862-86cc-491a-902e-a83a95c8c0b5/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:00:27,971 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:00:27,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:27,972 INFO L85 PathProgramCache]: Analyzing trace with hash -867864053, now seen corresponding path program 2 times [2022-11-02 21:00:27,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:27,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977346815] [2022-11-02 21:00:27,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:27,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:28,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:29,805 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:00:29,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:29,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977346815] [2022-11-02 21:00:29,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977346815] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:00:29,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937035949] [2022-11-02 21:00:29,806 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:00:29,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:00:29,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96f2862-86cc-491a-902e-a83a95c8c0b5/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:00:29,808 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96f2862-86cc-491a-902e-a83a95c8c0b5/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:00:29,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96f2862-86cc-491a-902e-a83a95c8c0b5/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 21:00:29,968 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 21:00:29,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:00:29,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 86 conjunts are in the unsatisfiable core [2022-11-02 21:00:29,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:00:29,992 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 18 treesize of output 19 [2022-11-02 21:00:30,003 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 18 treesize of output 19 [2022-11-02 21:00:30,027 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:00:30,028 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 19 treesize of output 18 [2022-11-02 21:00:30,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:00:30,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:00:30,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2022-11-02 21:00:30,181 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2022-11-02 21:00:30,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:00:30,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:00:30,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2022-11-02 21:00:30,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2022-11-02 21:00:30,258 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-02 21:00:30,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 30 [2022-11-02 21:00:30,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-02 21:00:30,665 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:00:30,665 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 144 [2022-11-02 21:00:30,682 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 0 case distinctions, treesize of input 80 treesize of output 37 [2022-11-02 21:00:30,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 69 [2022-11-02 21:00:31,078 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:00:31,082 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 21:00:31,082 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 2 case distinctions, treesize of input 212 treesize of output 115 [2022-11-02 21:00:31,098 INFO L356 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-11-02 21:00:31,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 115 treesize of output 65 [2022-11-02 21:00:31,148 INFO L356 Elim1Store]: treesize reduction 24, result has 61.9 percent of original size [2022-11-02 21:00:31,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 59 [2022-11-02 21:00:32,846 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 22 treesize of output 10 [2022-11-02 21:00:32,865 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:00:32,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:00:33,518 INFO L356 Elim1Store]: treesize reduction 124, result has 80.6 percent of original size [2022-11-02 21:00:33,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 3045 treesize of output 2991 [2022-11-02 21:04:03,032 WARN L234 SmtUtils]: Spent 1.39m on a formula simplification. DAG size of input: 971 DAG size of output: 100 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 21:04:09,306 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:04:09,307 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 7363 treesize of output 6488 [2022-11-02 21:04:14,687 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse9 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) (.cse10 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((v_ArrVal_645 Int)) (or (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse8 (let ((.cse11 (store |c_#memory_$Pointer$.offset| v_ArrVal_645 v_arrayElimArr_3))) (store .cse11 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 0))))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~head~0#1.base|) .cse9))) (or (= |c_ULTIMATE.start_main_~m~0#1.offset| .cse0) (not (= (select v_arrayElimArr_3 8) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_prenex_375 (Array Int Int)) (v_prenex_376 (Array Int Int)) (v_ArrVal_651 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_$Pointer$.base| v_ArrVal_645 v_ArrVal_651) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_645 v_ArrVal_653) |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 v_ArrVal_645)))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) .cse9))) (let ((.cse4 (store .cse8 .cse7 v_prenex_375)) (.cse1 (store .cse6 .cse7 v_prenex_376))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) .cse5)) (.cse3 (+ (select (select .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) .cse5) 4))) (or (= |c_ULTIMATE.start_main_~m~0#1.base| (select (select .cse1 .cse2) .cse3)) (= .cse0 (select (select .cse4 .cse2) .cse3)))))))) (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_3 4))))))) (not (= (select |c_#valid| v_ArrVal_645) 0)))) (forall ((v_ArrVal_645 Int)) (or (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse12 (let ((.cse18 (store |c_#memory_$Pointer$.offset| v_ArrVal_645 v_arrayElimArr_3))) (store .cse18 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse18 |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 0))))) (or (= |c_ULTIMATE.start_main_~m~0#1.offset| (select (select .cse12 |c_ULTIMATE.start_main_~head~0#1.base|) .cse9)) (not (= (select v_arrayElimArr_3 8) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_prenex_373 (Array Int Int)) (v_prenex_374 (Array Int Int)) (v_ArrVal_651 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (let ((.cse17 (store (store |c_#memory_$Pointer$.base| v_ArrVal_645 v_ArrVal_651) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_645 v_ArrVal_653) |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 v_ArrVal_645)))) (let ((.cse15 (select (select .cse17 |c_ULTIMATE.start_main_~head~0#1.base|) .cse9))) (let ((.cse16 (store .cse17 .cse15 v_prenex_374))) (let ((.cse14 (select (select .cse16 |c_ULTIMATE.start_main_~head~0#1.base|) .cse5))) (let ((.cse13 (select (select .cse16 .cse14) (+ (select (select (store .cse12 .cse15 v_prenex_373) |c_ULTIMATE.start_main_~head~0#1.base|) .cse5) 4)))) (or (= .cse13 |c_ULTIMATE.start_main_~head~0#1.base|) (= |c_ULTIMATE.start_main_~m~0#1.base| .cse13) (= .cse14 .cse13) (= .cse14 .cse15)))))))) (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_3 4)))))) (not (= (select |c_#valid| v_ArrVal_645) 0)))) (forall ((v_ArrVal_645 Int)) (or (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse19 (let ((.cse24 (store |c_#memory_$Pointer$.offset| v_ArrVal_645 v_arrayElimArr_3))) (store .cse24 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse24 |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 0))))) (or (= |c_ULTIMATE.start_main_~m~0#1.offset| (select (select .cse19 |c_ULTIMATE.start_main_~head~0#1.base|) .cse9)) (not (= (select v_arrayElimArr_3 8) |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_3 4))) (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_659 (Array Int Int)) (v_ArrVal_651 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (let ((.cse23 (store (store |c_#memory_$Pointer$.base| v_ArrVal_645 v_ArrVal_651) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_645 v_ArrVal_653) |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 v_ArrVal_645)))) (let ((.cse22 (select (select .cse23 |c_ULTIMATE.start_main_~head~0#1.base|) .cse9))) (let ((.cse21 (store .cse23 .cse22 v_ArrVal_659))) (let ((.cse20 (select (select .cse21 |c_ULTIMATE.start_main_~head~0#1.base|) .cse5))) (or (= |c_ULTIMATE.start_main_~m~0#1.base| .cse20) (= |c_ULTIMATE.start_main_~m~0#1.base| (select (select .cse21 .cse20) (+ (select (select (store .cse19 .cse22 v_ArrVal_658) |c_ULTIMATE.start_main_~head~0#1.base|) .cse5) 4)))))))))))) (not (= (select |c_#valid| v_ArrVal_645) 0)))) (forall ((v_ArrVal_645 Int)) (or (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse31 (let ((.cse32 (store |c_#memory_$Pointer$.offset| v_ArrVal_645 v_arrayElimArr_3))) (store .cse32 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse32 |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 0))))) (let ((.cse25 (select (select .cse31 |c_ULTIMATE.start_main_~head~0#1.base|) .cse9))) (or (= |c_ULTIMATE.start_main_~m~0#1.offset| .cse25) (not (= (select v_arrayElimArr_3 8) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_prenex_371 (Array Int Int)) (v_prenex_372 (Array Int Int)) (v_ArrVal_651 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (let ((.cse29 (store (store |c_#memory_$Pointer$.base| v_ArrVal_645 v_ArrVal_651) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_645 v_ArrVal_653) |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 v_ArrVal_645)))) (let ((.cse30 (select (select .cse29 |c_ULTIMATE.start_main_~head~0#1.base|) .cse9))) (let ((.cse28 (store .cse31 .cse30 v_prenex_371))) (let ((.cse27 (select (select .cse28 |c_ULTIMATE.start_main_~head~0#1.base|) .cse5))) (let ((.cse26 (select (select .cse28 (select (select (store .cse29 .cse30 v_prenex_372) |c_ULTIMATE.start_main_~head~0#1.base|) .cse5)) (+ .cse27 4)))) (or (= .cse26 .cse27) (= .cse25 .cse27) (= .cse26 |c_ULTIMATE.start_main_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~m~0#1.offset| .cse26)))))))) (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_3 4))))))) (not (= (select |c_#valid| v_ArrVal_645) 0)))) (forall ((v_ArrVal_645 Int)) (or (not (= (select |c_#valid| v_ArrVal_645) 0)) (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse38 (let ((.cse41 (store |c_#memory_$Pointer$.offset| v_ArrVal_645 v_arrayElimArr_3))) (store .cse41 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse41 |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 0))))) (let ((.cse33 (select (select .cse38 |c_ULTIMATE.start_main_~head~0#1.base|) .cse9))) (or (= |c_ULTIMATE.start_main_~m~0#1.offset| .cse33) (not (= (select v_arrayElimArr_3 8) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_prenex_385 (Array Int Int)) (v_prenex_386 (Array Int Int)) (v_ArrVal_651 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (let ((.cse40 (store (store |c_#memory_$Pointer$.base| v_ArrVal_645 v_ArrVal_651) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_645 v_ArrVal_653) |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 v_ArrVal_645)))) (let ((.cse39 (select (select .cse40 |c_ULTIMATE.start_main_~head~0#1.base|) .cse9))) (let ((.cse37 (store .cse40 .cse39 v_prenex_386))) (let ((.cse36 (select (select .cse37 |c_ULTIMATE.start_main_~head~0#1.base|) .cse5)) (.cse34 (select (select (store .cse38 .cse39 v_prenex_385) |c_ULTIMATE.start_main_~head~0#1.base|) .cse5))) (let ((.cse35 (select (select .cse37 .cse36) (+ .cse34 4)))) (or (= .cse34 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse35 .cse36) (= .cse34 .cse33) (= .cse35 |c_ULTIMATE.start_main_~head~0#1.base|) (= |c_ULTIMATE.start_main_~m~0#1.base| .cse35)))))))) (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_3 4))))))))) (forall ((v_ArrVal_645 Int)) (or (forall ((v_arrayElimArr_3 (Array Int Int))) (or (forall ((v_ArrVal_651 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (let ((.cse47 (store (store |c_#memory_$Pointer$.base| v_ArrVal_645 v_ArrVal_651) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_645 v_ArrVal_653) |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 v_ArrVal_645)))) (let ((.cse42 (select (select .cse47 |c_ULTIMATE.start_main_~head~0#1.base|) .cse9))) (or (= |c_ULTIMATE.start_main_~m~0#1.base| .cse42) (forall ((v_prenex_371 (Array Int Int)) (v_prenex_372 (Array Int Int))) (let ((.cse45 (let ((.cse48 (store |c_#memory_$Pointer$.offset| v_ArrVal_645 v_arrayElimArr_3))) (store .cse48 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse48 |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 0))))) (let ((.cse46 (store .cse45 .cse42 v_prenex_371))) (let ((.cse44 (select (select .cse46 |c_ULTIMATE.start_main_~head~0#1.base|) .cse5))) (let ((.cse43 (select (select .cse46 (select (select (store .cse47 .cse42 v_prenex_372) |c_ULTIMATE.start_main_~head~0#1.base|) .cse5)) (+ .cse44 4)))) (or (= .cse43 .cse44) (= (select (select .cse45 |c_ULTIMATE.start_main_~head~0#1.base|) .cse9) .cse44) (= .cse43 |c_ULTIMATE.start_main_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~m~0#1.offset| .cse43))))))))))) (not (= (select v_arrayElimArr_3 8) |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_3 4))))) (not (= (select |c_#valid| v_ArrVal_645) 0)))) (forall ((v_ArrVal_645 Int)) (or (forall ((v_arrayElimArr_3 (Array Int Int))) (or (not (= (select v_arrayElimArr_3 8) |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_3 4))) (forall ((v_ArrVal_651 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (let ((.cse53 (store (store |c_#memory_$Pointer$.base| v_ArrVal_645 v_ArrVal_651) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_645 v_ArrVal_653) |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 v_ArrVal_645)))) (let ((.cse49 (select (select .cse53 |c_ULTIMATE.start_main_~head~0#1.base|) .cse9))) (or (= |c_ULTIMATE.start_main_~m~0#1.base| .cse49) (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_659 (Array Int Int))) (let ((.cse51 (store .cse53 .cse49 v_ArrVal_659))) (let ((.cse50 (select (select .cse51 |c_ULTIMATE.start_main_~head~0#1.base|) .cse5))) (or (= |c_ULTIMATE.start_main_~m~0#1.base| .cse50) (= |c_ULTIMATE.start_main_~m~0#1.base| (select (select .cse51 .cse50) (+ (select (select (store (let ((.cse52 (store |c_#memory_$Pointer$.offset| v_ArrVal_645 v_arrayElimArr_3))) (store .cse52 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse52 |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 0))) .cse49 v_ArrVal_658) |c_ULTIMATE.start_main_~head~0#1.base|) .cse5) 4))))))))))))) (not (= (select |c_#valid| v_ArrVal_645) 0)))) (forall ((v_ArrVal_645 Int)) (or (forall ((v_arrayElimArr_3 (Array Int Int))) (or (not (= (select v_arrayElimArr_3 8) |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_3 4))) (forall ((v_prenex_393 (Array Int Int)) (v_prenex_394 (Array Int Int)) (v_ArrVal_651 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (let ((.cse60 (store (store |c_#memory_$Pointer$.base| v_ArrVal_645 v_ArrVal_651) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_645 v_ArrVal_653) |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 v_ArrVal_645)))) (let ((.cse55 (select (select .cse60 |c_ULTIMATE.start_main_~head~0#1.base|) .cse9))) (let ((.cse57 (store (let ((.cse61 (store |c_#memory_$Pointer$.offset| v_ArrVal_645 v_arrayElimArr_3))) (store .cse61 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse61 |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 0))) .cse55 v_prenex_393)) (.cse59 (store .cse60 .cse55 v_prenex_394))) (let ((.cse54 (select (select .cse59 |c_ULTIMATE.start_main_~head~0#1.base|) .cse5)) (.cse58 (+ 4 (select (select .cse57 |c_ULTIMATE.start_main_~head~0#1.base|) .cse5)))) (let ((.cse56 (select (select .cse59 .cse54) .cse58))) (or (= .cse54 |c_ULTIMATE.start_main_~head~0#1.base|) (= |c_ULTIMATE.start_main_~m~0#1.base| .cse55) (= .cse56 .cse55) (= .cse54 .cse55) (= .cse56 |c_ULTIMATE.start_main_~head~0#1.base|) (= |c_ULTIMATE.start_main_~m~0#1.offset| (select (select .cse57 .cse54) .cse58))))))))))) (not (= (select |c_#valid| v_ArrVal_645) 0)))) (forall ((v_ArrVal_645 Int)) (or (forall ((v_arrayElimArr_3 (Array Int Int))) (or (not (= (select v_arrayElimArr_3 8) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_prenex_380 (Array Int Int)) (v_ArrVal_651 (Array Int Int)) (v_prenex_379 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (let ((.cse67 (store (store |c_#memory_$Pointer$.base| v_ArrVal_645 v_ArrVal_651) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_645 v_ArrVal_653) |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 v_ArrVal_645)))) (let ((.cse62 (select (select .cse67 |c_ULTIMATE.start_main_~head~0#1.base|) .cse9))) (let ((.cse65 (store .cse67 .cse62 v_prenex_380))) (let ((.cse63 (select (select .cse65 |c_ULTIMATE.start_main_~head~0#1.base|) .cse5))) (let ((.cse64 (select (select .cse65 .cse63) (+ (select (select (store (let ((.cse66 (store |c_#memory_$Pointer$.offset| v_ArrVal_645 v_arrayElimArr_3))) (store .cse66 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse66 |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 0))) .cse62 v_prenex_379) |c_ULTIMATE.start_main_~head~0#1.base|) .cse5) 4)))) (or (= |c_ULTIMATE.start_main_~m~0#1.base| .cse62) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse63) (= |c_ULTIMATE.start_main_~m~0#1.base| .cse64) (= .cse64 .cse63)))))))) (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_3 4))))) (not (= (select |c_#valid| v_ArrVal_645) 0)))) (forall ((v_ArrVal_645 Int)) (or (forall ((v_arrayElimArr_3 (Array Int Int))) (or (not (= (select v_arrayElimArr_3 8) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_651 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (let ((.cse72 (store (store |c_#memory_$Pointer$.base| v_ArrVal_645 v_ArrVal_651) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_645 v_ArrVal_653) |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 v_ArrVal_645)))) (let ((.cse68 (select (select .cse72 |c_ULTIMATE.start_main_~head~0#1.base|) .cse9))) (or (= |c_ULTIMATE.start_main_~m~0#1.base| .cse68) (forall ((v_prenex_377 (Array Int Int)) (v_prenex_378 (Array Int Int))) (let ((.cse71 (store (let ((.cse73 (store |c_#memory_$Pointer$.offset| v_ArrVal_645 v_arrayElimArr_3))) (store .cse73 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse73 |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 0))) .cse68 v_prenex_377))) (let ((.cse69 (select (select .cse71 |c_ULTIMATE.start_main_~head~0#1.base|) .cse5))) (let ((.cse70 (select (select .cse71 (select (select (store .cse72 .cse68 v_prenex_378) |c_ULTIMATE.start_main_~head~0#1.base|) .cse5)) (+ .cse69 4)))) (or (= |c_ULTIMATE.start_main_~head~0#1.offset| .cse69) (= .cse70 |c_ULTIMATE.start_main_~m~0#1.offset|) (= |c_ULTIMATE.start_main_~m~0#1.offset| .cse69) (= .cse70 |c_ULTIMATE.start_main_~head~0#1.offset|)))))))))) (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_3 4))))) (not (= (select |c_#valid| v_ArrVal_645) 0)))) (forall ((v_ArrVal_645 Int)) (or (forall ((v_arrayElimArr_3 (Array Int Int))) (or (not (= (select v_arrayElimArr_3 8) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_651 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (let ((.cse78 (store (store |c_#memory_$Pointer$.base| v_ArrVal_645 v_ArrVal_651) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_645 v_ArrVal_653) |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 v_ArrVal_645)))) (let ((.cse74 (select (select .cse78 |c_ULTIMATE.start_main_~head~0#1.base|) .cse9))) (or (= |c_ULTIMATE.start_main_~m~0#1.base| .cse74) (forall ((v_prenex_370 (Array Int Int)) (v_prenex_369 (Array Int Int))) (let ((.cse75 (select (select (store .cse78 .cse74 v_prenex_370) |c_ULTIMATE.start_main_~head~0#1.base|) .cse5))) (or (= |c_ULTIMATE.start_main_~m~0#1.base| .cse75) (= |c_ULTIMATE.start_main_~m~0#1.offset| (let ((.cse76 (store (let ((.cse77 (store |c_#memory_$Pointer$.offset| v_ArrVal_645 v_arrayElimArr_3))) (store .cse77 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse77 |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 0))) .cse74 v_prenex_369))) (select (select .cse76 .cse75) (+ (select (select .cse76 |c_ULTIMATE.start_main_~head~0#1.base|) .cse5) 4))))))))))) (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_3 4))))) (not (= (select |c_#valid| v_ArrVal_645) 0)))) (forall ((v_ArrVal_645 Int)) (or (forall ((v_arrayElimArr_3 (Array Int Int))) (or (not (= (select v_arrayElimArr_3 8) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_prenex_381 (Array Int Int)) (v_prenex_382 (Array Int Int)) (v_ArrVal_651 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (let ((.cse84 (store (store |c_#memory_$Pointer$.base| v_ArrVal_645 v_ArrVal_651) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_645 v_ArrVal_653) |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 v_ArrVal_645)))) (let ((.cse79 (select (select .cse84 |c_ULTIMATE.start_main_~head~0#1.base|) .cse9))) (let ((.cse83 (store (let ((.cse85 (store |c_#memory_$Pointer$.offset| v_ArrVal_645 v_arrayElimArr_3))) (store .cse85 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse85 |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 0))) .cse79 v_prenex_381))) (let ((.cse80 (select (select (store .cse84 .cse79 v_prenex_382) |c_ULTIMATE.start_main_~head~0#1.base|) .cse5)) (.cse82 (select (select .cse83 |c_ULTIMATE.start_main_~head~0#1.base|) .cse5))) (let ((.cse81 (select (select .cse83 .cse80) (+ .cse82 4)))) (or (= |c_ULTIMATE.start_main_~m~0#1.base| .cse79) (= .cse80 .cse79) (= |c_ULTIMATE.start_main_~m~0#1.offset| .cse81) (= .cse81 .cse82) (= .cse82 |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_3 4))))) (not (= (select |c_#valid| v_ArrVal_645) 0)))) (forall ((v_ArrVal_645 Int)) (or (forall ((v_arrayElimArr_3 (Array Int Int))) (or (not (= (select v_arrayElimArr_3 8) |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_3 4))) (forall ((v_prenex_383 (Array Int Int)) (v_prenex_384 (Array Int Int)) (v_ArrVal_651 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (let ((.cse94 (store (store |c_#memory_$Pointer$.base| v_ArrVal_645 v_ArrVal_651) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_645 v_ArrVal_653) |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 v_ArrVal_645)))) (let ((.cse92 (let ((.cse95 (store |c_#memory_$Pointer$.offset| v_ArrVal_645 v_arrayElimArr_3))) (store .cse95 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse95 |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 0)))) (.cse90 (select (select .cse94 |c_ULTIMATE.start_main_~head~0#1.base|) .cse9))) (let ((.cse93 (store .cse92 .cse90 v_prenex_383))) (let ((.cse86 (select (select .cse93 |c_ULTIMATE.start_main_~head~0#1.base|) .cse5)) (.cse87 (store .cse94 .cse90 v_prenex_384))) (let ((.cse88 (select (select .cse87 |c_ULTIMATE.start_main_~head~0#1.base|) .cse5)) (.cse89 (+ .cse86 4))) (let ((.cse91 (select (select .cse93 .cse88) .cse89))) (or (= |c_ULTIMATE.start_main_~m~0#1.offset| .cse86) (not (= (select (select .cse87 .cse88) .cse89) .cse90)) (= |c_ULTIMATE.start_main_~m~0#1.offset| .cse91) (not (= (select (select .cse92 |c_ULTIMATE.start_main_~head~0#1.base|) .cse9) .cse91)))))))))))) (not (= (select |c_#valid| v_ArrVal_645) 0)))) (forall ((v_ArrVal_645 Int)) (or (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse96 (let ((.cse102 (store |c_#memory_$Pointer$.offset| v_ArrVal_645 v_arrayElimArr_3))) (store .cse102 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse102 |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 0))))) (or (= |c_ULTIMATE.start_main_~m~0#1.offset| (select (select .cse96 |c_ULTIMATE.start_main_~head~0#1.base|) .cse9)) (not (= (select v_arrayElimArr_3 8) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_prenex_380 (Array Int Int)) (v_ArrVal_651 (Array Int Int)) (v_prenex_379 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (let ((.cse101 (store (store |c_#memory_$Pointer$.base| v_ArrVal_645 v_ArrVal_651) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_645 v_ArrVal_653) |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 v_ArrVal_645)))) (let ((.cse100 (select (select .cse101 |c_ULTIMATE.start_main_~head~0#1.base|) .cse9))) (let ((.cse99 (store .cse101 .cse100 v_prenex_380))) (let ((.cse97 (select (select .cse99 |c_ULTIMATE.start_main_~head~0#1.base|) .cse5))) (let ((.cse98 (select (select .cse99 .cse97) (+ (select (select (store .cse96 .cse100 v_prenex_379) |c_ULTIMATE.start_main_~head~0#1.base|) .cse5) 4)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse97) (= |c_ULTIMATE.start_main_~m~0#1.base| .cse98) (= .cse98 .cse97)))))))) (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_3 4)))))) (not (= (select |c_#valid| v_ArrVal_645) 0)))) (forall ((v_ArrVal_645 Int)) (or (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse103 (let ((.cse108 (store |c_#memory_$Pointer$.offset| v_ArrVal_645 v_arrayElimArr_3))) (store .cse108 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse108 |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 0))))) (or (= |c_ULTIMATE.start_main_~m~0#1.offset| (select (select .cse103 |c_ULTIMATE.start_main_~head~0#1.base|) .cse9)) (not (= (select v_arrayElimArr_3 8) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_prenex_370 (Array Int Int)) (v_ArrVal_651 (Array Int Int)) (v_prenex_369 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (let ((.cse107 (store (store |c_#memory_$Pointer$.base| v_ArrVal_645 v_ArrVal_651) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_645 v_ArrVal_653) |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 v_ArrVal_645)))) (let ((.cse106 (select (select .cse107 |c_ULTIMATE.start_main_~head~0#1.base|) .cse9))) (let ((.cse104 (select (select (store .cse107 .cse106 v_prenex_370) |c_ULTIMATE.start_main_~head~0#1.base|) .cse5))) (or (= |c_ULTIMATE.start_main_~m~0#1.base| .cse104) (= |c_ULTIMATE.start_main_~m~0#1.offset| (let ((.cse105 (store .cse103 .cse106 v_prenex_369))) (select (select .cse105 .cse104) (+ (select (select .cse105 |c_ULTIMATE.start_main_~head~0#1.base|) .cse5) 4))))))))) (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_3 4)))))) (not (= (select |c_#valid| v_ArrVal_645) 0)))) (forall ((v_ArrVal_645 Int)) (or (forall ((v_arrayElimArr_3 (Array Int Int))) (or (forall ((v_ArrVal_651 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (let ((.cse115 (store (store |c_#memory_$Pointer$.base| v_ArrVal_645 v_ArrVal_651) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_645 v_ArrVal_653) |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 v_ArrVal_645)))) (let ((.cse109 (select (select .cse115 |c_ULTIMATE.start_main_~head~0#1.base|) .cse9))) (or (= |c_ULTIMATE.start_main_~m~0#1.base| .cse109) (forall ((v_prenex_375 (Array Int Int)) (v_prenex_376 (Array Int Int))) (let ((.cse113 (let ((.cse116 (store |c_#memory_$Pointer$.offset| v_ArrVal_645 v_arrayElimArr_3))) (store .cse116 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse116 |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 0))))) (let ((.cse114 (store .cse113 .cse109 v_prenex_375)) (.cse110 (store .cse115 .cse109 v_prenex_376))) (let ((.cse111 (select (select .cse110 |c_ULTIMATE.start_main_~head~0#1.base|) .cse5)) (.cse112 (+ (select (select .cse114 |c_ULTIMATE.start_main_~head~0#1.base|) .cse5) 4))) (or (= |c_ULTIMATE.start_main_~m~0#1.base| (select (select .cse110 .cse111) .cse112)) (= (select (select .cse113 |c_ULTIMATE.start_main_~head~0#1.base|) .cse9) (select (select .cse114 .cse111) .cse112))))))))))) (not (= (select v_arrayElimArr_3 8) |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_3 4))))) (not (= (select |c_#valid| v_ArrVal_645) 0)))) (forall ((v_ArrVal_645 Int)) (or (forall ((v_arrayElimArr_3 (Array Int Int))) (or (forall ((v_ArrVal_651 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (let ((.cse121 (store (store |c_#memory_$Pointer$.base| v_ArrVal_645 v_ArrVal_651) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_645 v_ArrVal_653) |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 v_ArrVal_645)))) (let ((.cse117 (select (select .cse121 |c_ULTIMATE.start_main_~head~0#1.base|) .cse9))) (or (= |c_ULTIMATE.start_main_~m~0#1.base| .cse117) (forall ((v_prenex_390 (Array Int Int)) (v_prenex_389 (Array Int Int))) (let ((.cse119 (let ((.cse122 (store |c_#memory_$Pointer$.offset| v_ArrVal_645 v_arrayElimArr_3))) (store .cse122 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse122 |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 0))))) (let ((.cse118 (let ((.cse120 (store .cse119 .cse117 v_prenex_389))) (select (select .cse120 (select (select (store .cse121 .cse117 v_prenex_390) |c_ULTIMATE.start_main_~head~0#1.base|) .cse5)) (+ (select (select .cse120 |c_ULTIMATE.start_main_~head~0#1.base|) .cse5) 4))))) (or (= |c_ULTIMATE.start_main_~m~0#1.offset| .cse118) (= (select (select .cse119 |c_ULTIMATE.start_main_~head~0#1.base|) .cse9) .cse118))))))))) (not (= (select v_arrayElimArr_3 8) |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_3 4))))) (not (= (select |c_#valid| v_ArrVal_645) 0)))) (forall ((v_ArrVal_645 Int)) (or (forall ((v_arrayElimArr_3 (Array Int Int))) (or (not (= (select v_arrayElimArr_3 8) |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_3 4))) (forall ((v_prenex_387 (Array Int Int)) (v_prenex_388 (Array Int Int)) (v_ArrVal_651 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (let ((.cse131 (store (store |c_#memory_$Pointer$.base| v_ArrVal_645 v_ArrVal_651) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_645 v_ArrVal_653) |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 v_ArrVal_645)))) (let ((.cse124 (let ((.cse132 (store |c_#memory_$Pointer$.offset| v_ArrVal_645 v_arrayElimArr_3))) (store .cse132 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse132 |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 0)))) (.cse129 (select (select .cse131 |c_ULTIMATE.start_main_~head~0#1.base|) .cse9))) (let ((.cse130 (store .cse124 .cse129 v_prenex_387))) (let ((.cse125 (select (select .cse130 |c_ULTIMATE.start_main_~head~0#1.base|) .cse5)) (.cse126 (store .cse131 .cse129 v_prenex_388))) (let ((.cse127 (select (select .cse126 |c_ULTIMATE.start_main_~head~0#1.base|) .cse5)) (.cse128 (+ .cse125 4))) (let ((.cse123 (select (select .cse130 .cse127) .cse128))) (or (not (= .cse123 (select (select .cse124 |c_ULTIMATE.start_main_~head~0#1.base|) .cse9))) (= |c_ULTIMATE.start_main_~m~0#1.offset| .cse123) (= |c_ULTIMATE.start_main_~head~0#1.offset| .cse125) (not (= (select (select .cse126 .cse127) .cse128) .cse129)))))))))))) (not (= (select |c_#valid| v_ArrVal_645) 0)))) (forall ((v_ArrVal_645 Int)) (or (forall ((v_arrayElimArr_3 (Array Int Int))) (or (not (= (select v_arrayElimArr_3 8) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_651 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (let ((.cse138 (store (store |c_#memory_$Pointer$.base| v_ArrVal_645 v_ArrVal_651) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_645 v_ArrVal_653) |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 v_ArrVal_645)))) (let ((.cse133 (select (select .cse138 |c_ULTIMATE.start_main_~head~0#1.base|) .cse9))) (or (= |c_ULTIMATE.start_main_~m~0#1.base| .cse133) (forall ((v_prenex_373 (Array Int Int)) (v_prenex_374 (Array Int Int))) (let ((.cse136 (store .cse138 .cse133 v_prenex_374))) (let ((.cse135 (select (select .cse136 |c_ULTIMATE.start_main_~head~0#1.base|) .cse5))) (let ((.cse134 (select (select .cse136 .cse135) (+ (select (select (store (let ((.cse137 (store |c_#memory_$Pointer$.offset| v_ArrVal_645 v_arrayElimArr_3))) (store .cse137 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse137 |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 0))) .cse133 v_prenex_373) |c_ULTIMATE.start_main_~head~0#1.base|) .cse5) 4)))) (or (= .cse134 |c_ULTIMATE.start_main_~head~0#1.base|) (= |c_ULTIMATE.start_main_~m~0#1.base| .cse134) (= .cse135 .cse134) (= .cse135 .cse133)))))))))) (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_3 4))))) (not (= (select |c_#valid| v_ArrVal_645) 0)))) (forall ((v_ArrVal_645 Int)) (or (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse144 (let ((.cse145 (store |c_#memory_$Pointer$.offset| v_ArrVal_645 v_arrayElimArr_3))) (store .cse145 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse145 |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 0))))) (let ((.cse139 (select (select .cse144 |c_ULTIMATE.start_main_~head~0#1.base|) .cse9))) (or (= |c_ULTIMATE.start_main_~m~0#1.offset| .cse139) (not (= (select v_arrayElimArr_3 8) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_prenex_390 (Array Int Int)) (v_prenex_389 (Array Int Int)) (v_ArrVal_651 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (let ((.cse140 (let ((.cse142 (store (store |c_#memory_$Pointer$.base| v_ArrVal_645 v_ArrVal_651) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_645 v_ArrVal_653) |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 v_ArrVal_645)))) (let ((.cse143 (select (select .cse142 |c_ULTIMATE.start_main_~head~0#1.base|) .cse9))) (let ((.cse141 (store .cse144 .cse143 v_prenex_389))) (select (select .cse141 (select (select (store .cse142 .cse143 v_prenex_390) |c_ULTIMATE.start_main_~head~0#1.base|) .cse5)) (+ (select (select .cse141 |c_ULTIMATE.start_main_~head~0#1.base|) .cse5) 4))))))) (or (= |c_ULTIMATE.start_main_~m~0#1.offset| .cse140) (= .cse139 .cse140)))) (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_3 4))))))) (not (= (select |c_#valid| v_ArrVal_645) 0)))) (forall ((v_ArrVal_645 Int)) (or (forall ((v_arrayElimArr_3 (Array Int Int))) (or (not (= (select v_arrayElimArr_3 8) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_prenex_391 (Array Int Int)) (v_prenex_392 (Array Int Int)) (v_ArrVal_651 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (let ((.cse153 (store (store |c_#memory_$Pointer$.base| v_ArrVal_645 v_ArrVal_651) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_645 v_ArrVal_653) |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 v_ArrVal_645)))) (let ((.cse151 (let ((.cse155 (store |c_#memory_$Pointer$.offset| v_ArrVal_645 v_arrayElimArr_3))) (store .cse155 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse155 |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 0)))) (.cse154 (select (select .cse153 |c_ULTIMATE.start_main_~head~0#1.base|) .cse9))) (let ((.cse149 (store .cse151 .cse154 v_prenex_391))) (let ((.cse146 (select (select .cse149 |c_ULTIMATE.start_main_~head~0#1.base|) .cse5)) (.cse152 (store .cse153 .cse154 v_prenex_392))) (let ((.cse148 (select (select .cse152 |c_ULTIMATE.start_main_~head~0#1.base|) .cse5)) (.cse150 (+ 4 .cse146))) (let ((.cse147 (select (select .cse152 .cse148) .cse150))) (or (= |c_ULTIMATE.start_main_~m~0#1.offset| .cse146) (= .cse147 .cse148) (= .cse147 |c_ULTIMATE.start_main_~head~0#1.base|) (= |c_ULTIMATE.start_main_~m~0#1.offset| (select (select .cse149 .cse148) .cse150)) (not (= (select (select .cse151 |c_ULTIMATE.start_main_~head~0#1.base|) .cse9) .cse146)))))))))) (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_3 4))))) (not (= (select |c_#valid| v_ArrVal_645) 0)))) (forall ((v_ArrVal_645 Int)) (or (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse156 (let ((.cse162 (store |c_#memory_$Pointer$.offset| v_ArrVal_645 v_arrayElimArr_3))) (store .cse162 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse162 |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 0))))) (or (= |c_ULTIMATE.start_main_~m~0#1.offset| (select (select .cse156 |c_ULTIMATE.start_main_~head~0#1.base|) .cse9)) (not (= (select v_arrayElimArr_3 8) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_prenex_377 (Array Int Int)) (v_prenex_378 (Array Int Int)) (v_ArrVal_651 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (let ((.cse160 (store (store |c_#memory_$Pointer$.base| v_ArrVal_645 v_ArrVal_651) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_645 v_ArrVal_653) |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 v_ArrVal_645)))) (let ((.cse161 (select (select .cse160 |c_ULTIMATE.start_main_~head~0#1.base|) .cse9))) (let ((.cse159 (store .cse156 .cse161 v_prenex_377))) (let ((.cse157 (select (select .cse159 |c_ULTIMATE.start_main_~head~0#1.base|) .cse5))) (let ((.cse158 (select (select .cse159 (select (select (store .cse160 .cse161 v_prenex_378) |c_ULTIMATE.start_main_~head~0#1.base|) .cse5)) (+ .cse157 4)))) (or (= |c_ULTIMATE.start_main_~head~0#1.offset| .cse157) (= .cse158 |c_ULTIMATE.start_main_~m~0#1.offset|) (= |c_ULTIMATE.start_main_~m~0#1.offset| .cse157) (= .cse158 |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_3 4)))))) (not (= (select |c_#valid| v_ArrVal_645) 0)))))) is different from true [2022-11-02 21:04:18,338 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-02 21:04:18,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937035949] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:04:18,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:04:18,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 31 [2022-11-02 21:04:18,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836409625] [2022-11-02 21:04:18,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:04:18,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-02 21:04:18,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:18,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-02 21:04:18,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=728, Unknown=4, NotChecked=56, Total=930 [2022-11-02 21:04:18,341 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 31 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 31 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)