./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops/sum_array-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf732500-6b86-42b5-a311-f7edf7e28325/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf732500-6b86-42b5-a311-f7edf7e28325/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_cf732500-6b86-42b5-a311-f7edf7e28325/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf732500-6b86-42b5-a311-f7edf7e28325/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops/sum_array-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf732500-6b86-42b5-a311-f7edf7e28325/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_cf732500-6b86-42b5-a311-f7edf7e28325/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 84226515a723f10f2a919f265c45890771224ac18b5dd5f986441c53175929f5 --- 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:04,972 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:00:04,974 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:00:05,026 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:00:05,027 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:00:05,031 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:00:05,034 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:00:05,037 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:00:05,039 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:00:05,045 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:00:05,046 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:00:05,049 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:00:05,049 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:00:05,052 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:00:05,053 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:00:05,056 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:00:05,057 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:00:05,058 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:00:05,060 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:00:05,068 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:00:05,069 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:00:05,071 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:00:05,074 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:00:05,075 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:00:05,085 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:00:05,085 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:00:05,085 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:00:05,087 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:00:05,088 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:00:05,089 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:00:05,089 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:00:05,092 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:00:05,094 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:00:05,095 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:00:05,097 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:00:05,097 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:00:05,098 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:00:05,098 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:00:05,098 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:00:05,099 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:00:05,100 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:00:05,101 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf732500-6b86-42b5-a311-f7edf7e28325/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 21:00:05,144 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:00:05,144 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:00:05,145 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:00:05,145 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:00:05,146 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:00:05,146 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:00:05,147 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:00:05,147 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:00:05,147 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:00:05,148 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:00:05,149 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 21:00:05,149 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:00:05,149 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 21:00:05,150 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:00:05,150 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 21:00:05,150 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:00:05,150 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 21:00:05,150 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 21:00:05,150 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:00:05,151 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:00:05,151 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 21:00:05,151 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:00:05,151 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:00:05,151 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:00:05,152 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:00:05,152 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:00:05,152 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:00:05,152 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 21:00:05,153 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:00:05,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:00:05,153 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 21:00:05,153 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 21:00:05,154 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 21:00:05,154 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_cf732500-6b86-42b5-a311-f7edf7e28325/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_cf732500-6b86-42b5-a311-f7edf7e28325/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 -> 84226515a723f10f2a919f265c45890771224ac18b5dd5f986441c53175929f5 [2022-11-02 21:00:05,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:00:05,583 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:00:05,586 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:00:05,587 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:00:05,588 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:00:05,590 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf732500-6b86-42b5-a311-f7edf7e28325/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/loops/sum_array-2.i [2022-11-02 21:00:05,678 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf732500-6b86-42b5-a311-f7edf7e28325/bin/uautomizer-Dbtcem3rbc/data/57fc4c7e5/b877621096414fdab0ca1e534df1a8bf/FLAG342e2d45d [2022-11-02 21:00:06,238 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:00:06,241 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf732500-6b86-42b5-a311-f7edf7e28325/sv-benchmarks/c/loops/sum_array-2.i [2022-11-02 21:00:06,249 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf732500-6b86-42b5-a311-f7edf7e28325/bin/uautomizer-Dbtcem3rbc/data/57fc4c7e5/b877621096414fdab0ca1e534df1a8bf/FLAG342e2d45d [2022-11-02 21:00:06,592 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf732500-6b86-42b5-a311-f7edf7e28325/bin/uautomizer-Dbtcem3rbc/data/57fc4c7e5/b877621096414fdab0ca1e534df1a8bf [2022-11-02 21:00:06,595 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:00:06,596 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:00:06,602 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:00:06,602 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:00:06,607 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:00:06,608 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:00:06" (1/1) ... [2022-11-02 21:00:06,609 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c51e1e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:06, skipping insertion in model container [2022-11-02 21:00:06,609 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:00:06" (1/1) ... [2022-11-02 21:00:06,619 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:00:06,640 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:00:06,858 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_cf732500-6b86-42b5-a311-f7edf7e28325/sv-benchmarks/c/loops/sum_array-2.i[938,951] [2022-11-02 21:00:06,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:00:06,888 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:00:06,907 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_cf732500-6b86-42b5-a311-f7edf7e28325/sv-benchmarks/c/loops/sum_array-2.i[938,951] [2022-11-02 21:00:06,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:00:06,950 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:00:06,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:06 WrapperNode [2022-11-02 21:00:06,950 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:00:06,952 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:00:06,952 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:00:06,953 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:00:06,960 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:06" (1/1) ... [2022-11-02 21:00:06,988 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:06" (1/1) ... [2022-11-02 21:00:07,013 INFO L138 Inliner]: procedures = 18, calls = 29, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 101 [2022-11-02 21:00:07,014 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:00:07,014 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:00:07,015 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:00:07,015 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:00:07,024 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:06" (1/1) ... [2022-11-02 21:00:07,025 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:06" (1/1) ... [2022-11-02 21:00:07,027 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:06" (1/1) ... [2022-11-02 21:00:07,027 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:06" (1/1) ... [2022-11-02 21:00:07,033 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:06" (1/1) ... [2022-11-02 21:00:07,038 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:06" (1/1) ... [2022-11-02 21:00:07,039 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:06" (1/1) ... [2022-11-02 21:00:07,040 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:06" (1/1) ... [2022-11-02 21:00:07,043 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:00:07,043 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:00:07,044 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:00:07,044 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:00:07,045 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:06" (1/1) ... [2022-11-02 21:00:07,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:00:07,065 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf732500-6b86-42b5-a311-f7edf7e28325/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:00:07,078 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf732500-6b86-42b5-a311-f7edf7e28325/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:07,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf732500-6b86-42b5-a311-f7edf7e28325/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:07,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:00:07,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:00:07,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 21:00:07,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 21:00:07,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:00:07,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:00:07,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 21:00:07,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 21:00:07,219 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:00:07,221 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:00:07,536 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:00:07,543 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:00:07,543 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-02 21:00:07,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:00:07 BoogieIcfgContainer [2022-11-02 21:00:07,548 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:00:07,551 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:00:07,552 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:00:07,556 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:00:07,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:00:06" (1/3) ... [2022-11-02 21:00:07,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b82ebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:00:07, skipping insertion in model container [2022-11-02 21:00:07,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:06" (2/3) ... [2022-11-02 21:00:07,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b82ebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:00:07, skipping insertion in model container [2022-11-02 21:00:07,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:00:07" (3/3) ... [2022-11-02 21:00:07,560 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_array-2.i [2022-11-02 21:00:07,583 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:00:07,583 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 21:00:07,667 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:00:07,685 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;@2597d885, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:00:07,685 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 21:00:07,694 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 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:07,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 21:00:07,703 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:07,704 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:00:07,705 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:00:07,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:07,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1741268329, now seen corresponding path program 1 times [2022-11-02 21:00:07,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:07,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743823488] [2022-11-02 21:00:07,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:07,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:07,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:08,002 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:08,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:08,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743823488] [2022-11-02 21:00:08,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743823488] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:00:08,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:00:08,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:00:08,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21081549] [2022-11-02 21:00:08,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:00:08,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 21:00:08,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:08,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 21:00:08,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 21:00:08,060 INFO L87 Difference]: Start difference. First operand has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 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) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:08,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:08,081 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2022-11-02 21:00:08,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 21:00:08,098 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-02 21:00:08,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:00:08,108 INFO L225 Difference]: With dead ends: 41 [2022-11-02 21:00:08,108 INFO L226 Difference]: Without dead ends: 19 [2022-11-02 21:00:08,113 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:08,118 INFO L413 NwaCegarLoop]: 28 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, 28 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:08,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 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:08,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-11-02 21:00:08,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-11-02 21:00:08,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 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:08,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-11-02 21:00:08,167 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 11 [2022-11-02 21:00:08,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:00:08,167 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-11-02 21:00:08,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:08,169 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-11-02 21:00:08,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 21:00:08,170 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:08,170 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:00:08,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:00:08,171 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:00:08,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:08,173 INFO L85 PathProgramCache]: Analyzing trace with hash -217285445, now seen corresponding path program 1 times [2022-11-02 21:00:08,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:08,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878862253] [2022-11-02 21:00:08,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:08,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:08,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:08,568 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:08,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:08,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878862253] [2022-11-02 21:00:08,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878862253] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:00:08,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:00:08,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:00:08,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494144910] [2022-11-02 21:00:08,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:00:08,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:00:08,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:08,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:00:08,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:00:08,573 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:08,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:08,719 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2022-11-02 21:00:08,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:00:08,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-02 21:00:08,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:00:08,721 INFO L225 Difference]: With dead ends: 52 [2022-11-02 21:00:08,721 INFO L226 Difference]: Without dead ends: 33 [2022-11-02 21:00:08,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:00:08,723 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 15 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:00:08,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 28 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:00:08,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-02 21:00:08,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 22. [2022-11-02 21:00:08,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 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:08,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-11-02 21:00:08,730 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 11 [2022-11-02 21:00:08,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:00:08,730 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-11-02 21:00:08,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:08,730 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-11-02 21:00:08,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 21:00:08,731 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:08,731 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:00:08,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:00:08,732 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:00:08,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:08,732 INFO L85 PathProgramCache]: Analyzing trace with hash -2020776544, now seen corresponding path program 1 times [2022-11-02 21:00:08,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:08,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490615012] [2022-11-02 21:00:08,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:08,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:08,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:11,181 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 21:00:11,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:11,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490615012] [2022-11-02 21:00:11,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490615012] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:00:11,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659384332] [2022-11-02 21:00:11,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:11,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:00:11,183 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf732500-6b86-42b5-a311-f7edf7e28325/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:00:11,185 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf732500-6b86-42b5-a311-f7edf7e28325/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:00:11,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf732500-6b86-42b5-a311-f7edf7e28325/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 21:00:11,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:11,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-02 21:00:11,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:00:11,343 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 14 treesize of output 12 [2022-11-02 21:00:11,514 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-02 21:00:11,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2022-11-02 21:00:11,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 21:00:11,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:00:12,009 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:00:12,009 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 195 treesize of output 199 [2022-11-02 21:00:12,835 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:00:12,835 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 214 treesize of output 156 [2022-11-02 21:00:12,851 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:00:12,852 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 184 treesize of output 135 [2022-11-02 21:00:12,867 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:00:12,868 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 113 treesize of output 82 [2022-11-02 21:00:12,885 INFO L356 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-11-02 21:00:12,886 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 104 treesize of output 85 [2022-11-02 21:00:12,911 INFO L356 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-11-02 21:00:12,912 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 261 treesize of output 200 [2022-11-02 21:00:12,940 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:00:12,941 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 158 treesize of output 128 [2022-11-02 21:00:12,986 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:00:12,987 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 65 treesize of output 60 [2022-11-02 21:00:13,017 INFO L356 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-11-02 21:00:13,017 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 104 treesize of output 83 [2022-11-02 21:00:13,032 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-02 21:00:13,032 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 196 treesize of output 1 [2022-11-02 21:00:13,040 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-02 21:00:13,041 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 38 treesize of output 1 [2022-11-02 21:00:13,052 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-02 21:00:13,053 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 169 treesize of output 1 [2022-11-02 21:00:13,640 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:00:13,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 249 treesize of output 241 [2022-11-02 21:00:14,258 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:00:14,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 140 treesize of output 174 [2022-11-02 21:00:14,692 INFO L356 Elim1Store]: treesize reduction 17, result has 85.0 percent of original size [2022-11-02 21:00:14,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 186 treesize of output 207 [2022-11-02 21:00:14,936 INFO L356 Elim1Store]: treesize reduction 92, result has 18.6 percent of original size [2022-11-02 21:00:14,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 131 treesize of output 103 [2022-11-02 21:00:15,030 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:00:15,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 428 treesize of output 388 [2022-11-02 21:00:16,265 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:00:16,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 428 treesize of output 388 [2022-11-02 21:00:17,853 INFO L356 Elim1Store]: treesize reduction 112, result has 0.9 percent of original size [2022-11-02 21:00:17,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 316 treesize of output 1 [2022-11-02 21:00:17,883 INFO L356 Elim1Store]: treesize reduction 112, result has 0.9 percent of original size [2022-11-02 21:00:17,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 613 treesize of output 1 [2022-11-02 21:00:17,896 INFO L356 Elim1Store]: treesize reduction 112, result has 0.9 percent of original size [2022-11-02 21:00:17,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 1 [2022-11-02 21:00:17,912 INFO L356 Elim1Store]: treesize reduction 112, result has 0.9 percent of original size [2022-11-02 21:00:17,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 186 treesize of output 1 [2022-11-02 21:00:17,929 INFO L356 Elim1Store]: treesize reduction 112, result has 0.9 percent of original size [2022-11-02 21:00:17,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 483 treesize of output 1 [2022-11-02 21:00:17,989 INFO L356 Elim1Store]: treesize reduction 112, result has 0.9 percent of original size [2022-11-02 21:00:17,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 186 treesize of output 1 [2022-11-02 21:00:18,003 INFO L356 Elim1Store]: treesize reduction 112, result has 0.9 percent of original size [2022-11-02 21:00:18,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 316 treesize of output 1 [2022-11-02 21:00:18,020 INFO L356 Elim1Store]: treesize reduction 112, result has 0.9 percent of original size [2022-11-02 21:00:18,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 613 treesize of output 1 [2022-11-02 21:00:18,033 INFO L356 Elim1Store]: treesize reduction 112, result has 0.9 percent of original size [2022-11-02 21:00:18,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 1 [2022-11-02 21:00:18,049 INFO L356 Elim1Store]: treesize reduction 112, result has 0.9 percent of original size [2022-11-02 21:00:18,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 186 treesize of output 1 [2022-11-02 21:00:18,063 INFO L356 Elim1Store]: treesize reduction 112, result has 0.9 percent of original size [2022-11-02 21:00:18,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 483 treesize of output 1 [2022-11-02 21:00:18,081 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-02 21:00:18,082 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 104 treesize of output 1 [2022-11-02 21:00:18,089 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-02 21:00:18,090 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 38 treesize of output 1 [2022-11-02 21:00:18,097 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-02 21:00:18,098 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 196 treesize of output 1 [2022-11-02 21:00:18,105 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-02 21:00:18,106 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 104 treesize of output 1 [2022-11-02 21:00:18,115 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-02 21:00:18,115 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 261 treesize of output 1 [2022-11-02 21:00:18,125 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-02 21:00:18,125 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 169 treesize of output 1 [2022-11-02 21:00:18,168 INFO L356 Elim1Store]: treesize reduction 68, result has 1.4 percent of original size [2022-11-02 21:00:18,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 169 treesize of output 1 [2022-11-02 21:00:18,181 INFO L356 Elim1Store]: treesize reduction 68, result has 1.4 percent of original size [2022-11-02 21:00:18,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 1 [2022-11-02 21:00:18,192 INFO L356 Elim1Store]: treesize reduction 68, result has 1.4 percent of original size [2022-11-02 21:00:18,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 1 [2022-11-02 21:00:18,203 INFO L356 Elim1Store]: treesize reduction 68, result has 1.4 percent of original size [2022-11-02 21:00:18,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 261 treesize of output 1 [2022-11-02 21:00:18,215 INFO L356 Elim1Store]: treesize reduction 68, result has 1.4 percent of original size [2022-11-02 21:00:18,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 196 treesize of output 1 [2022-11-02 21:00:18,226 INFO L356 Elim1Store]: treesize reduction 68, result has 1.4 percent of original size [2022-11-02 21:00:18,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 1 [2022-11-02 21:00:18,244 INFO L356 Elim1Store]: treesize reduction 112, result has 0.9 percent of original size [2022-11-02 21:00:18,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 1 [2022-11-02 21:00:18,256 INFO L356 Elim1Store]: treesize reduction 112, result has 0.9 percent of original size [2022-11-02 21:00:18,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 186 treesize of output 1 [2022-11-02 21:00:18,271 INFO L356 Elim1Store]: treesize reduction 112, result has 0.9 percent of original size [2022-11-02 21:00:18,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 316 treesize of output 1 [2022-11-02 21:00:18,284 INFO L356 Elim1Store]: treesize reduction 112, result has 0.9 percent of original size [2022-11-02 21:00:18,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 186 treesize of output 1 [2022-11-02 21:00:18,299 INFO L356 Elim1Store]: treesize reduction 112, result has 0.9 percent of original size [2022-11-02 21:00:18,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 613 treesize of output 1 [2022-11-02 21:00:18,313 INFO L356 Elim1Store]: treesize reduction 112, result has 0.9 percent of original size [2022-11-02 21:00:18,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 483 treesize of output 1 [2022-11-02 21:00:18,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 21:00:18,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659384332] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:00:18,423 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:00:18,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 18 [2022-11-02 21:00:18,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075348530] [2022-11-02 21:00:18,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:00:18,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-02 21:00:18,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:18,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-02 21:00:18,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-11-02 21:00:18,427 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:19,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:19,388 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-11-02 21:00:19,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 21:00:19,389 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-02 21:00:19,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:00:19,390 INFO L225 Difference]: With dead ends: 52 [2022-11-02 21:00:19,390 INFO L226 Difference]: Without dead ends: 35 [2022-11-02 21:00:19,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=182, Invalid=574, Unknown=0, NotChecked=0, Total=756 [2022-11-02 21:00:19,392 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 70 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:00:19,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 86 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 21:00:19,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-02 21:00:19,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2022-11-02 21:00:19,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:19,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-11-02 21:00:19,400 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 19 [2022-11-02 21:00:19,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:00:19,401 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-11-02 21:00:19,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:19,401 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-11-02 21:00:19,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 21:00:19,402 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:19,402 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:00:19,449 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf732500-6b86-42b5-a311-f7edf7e28325/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 21:00:19,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf732500-6b86-42b5-a311-f7edf7e28325/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:00:19,631 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:00:19,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:19,631 INFO L85 PathProgramCache]: Analyzing trace with hash -224460496, now seen corresponding path program 1 times [2022-11-02 21:00:19,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:19,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877720425] [2022-11-02 21:00:19,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:19,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:19,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:19,996 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 21:00:19,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:19,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877720425] [2022-11-02 21:00:19,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877720425] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:00:19,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277539392] [2022-11-02 21:00:20,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:20,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:00:20,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf732500-6b86-42b5-a311-f7edf7e28325/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:00:20,007 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf732500-6b86-42b5-a311-f7edf7e28325/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:00:20,036 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf732500-6b86-42b5-a311-f7edf7e28325/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 21:00:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:20,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-02 21:00:20,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:00:20,222 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 21:00:20,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:00:20,321 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 21:00:20,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277539392] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:00:20,321 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:00:20,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-11-02 21:00:20,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142016048] [2022-11-02 21:00:20,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:00:20,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 21:00:20,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:20,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 21:00:20,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-11-02 21:00:20,326 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 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,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:20,651 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2022-11-02 21:00:20,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:00:20,652 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 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 26 [2022-11-02 21:00:20,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:00:20,653 INFO L225 Difference]: With dead ends: 65 [2022-11-02 21:00:20,653 INFO L226 Difference]: Without dead ends: 52 [2022-11-02 21:00:20,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2022-11-02 21:00:20,654 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 92 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:00:20,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 56 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:00:20,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-02 21:00:20,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 32. [2022-11-02 21:00:20,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:20,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-11-02 21:00:20,666 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 26 [2022-11-02 21:00:20,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:00:20,666 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-11-02 21:00:20,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 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,667 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-11-02 21:00:20,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-02 21:00:20,667 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:20,668 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:00:20,718 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf732500-6b86-42b5-a311-f7edf7e28325/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 21:00:20,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf732500-6b86-42b5-a311-f7edf7e28325/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:00:20,888 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:00:20,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:20,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1108233645, now seen corresponding path program 2 times [2022-11-02 21:00:20,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:20,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642619047] [2022-11-02 21:00:20,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:20,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:25,253 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:00:25,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:25,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642619047] [2022-11-02 21:00:25,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642619047] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:00:25,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34196227] [2022-11-02 21:00:25,254 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:00:25,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:00:25,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf732500-6b86-42b5-a311-f7edf7e28325/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:00:25,256 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf732500-6b86-42b5-a311-f7edf7e28325/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:00:25,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf732500-6b86-42b5-a311-f7edf7e28325/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 21:00:25,368 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 21:00:25,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:00:25,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-02 21:00:25,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:00:25,383 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 14 treesize of output 12 [2022-11-02 21:00:25,613 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-02 21:00:25,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 30 [2022-11-02 21:00:25,916 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 21:00:25,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:00:26,397 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:00:26,397 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 219 treesize of output 223 [2022-11-02 21:00:26,935 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:00:26,935 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 125 treesize of output 90 [2022-11-02 21:00:26,957 INFO L356 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-11-02 21:00:26,958 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 116 treesize of output 95 [2022-11-02 21:00:26,985 INFO L356 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-11-02 21:00:26,986 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 285 treesize of output 220 [2022-11-02 21:00:27,015 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:00:27,016 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 170 treesize of output 138 [2022-11-02 21:00:27,063 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:00:27,065 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 71 treesize of output 64 [2022-11-02 21:00:27,094 INFO L356 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-11-02 21:00:27,098 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 44 treesize of output 40 [2022-11-02 21:00:27,115 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-02 21:00:27,116 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 116 treesize of output 1 [2022-11-02 21:00:27,127 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-02 21:00:27,127 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 214 treesize of output 1 [2022-11-02 21:00:27,143 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-02 21:00:27,143 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 187 treesize of output 1 [2022-11-02 21:00:28,055 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:00:28,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 166 treesize of output 174 [2022-11-02 21:00:28,595 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:00:28,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 92 treesize of output 138 [2022-11-02 21:00:28,853 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:00:28,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 264 treesize of output 236 [2022-11-02 21:00:29,809 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-11-02 21:00:29,971 INFO L356 Elim1Store]: treesize reduction 17, result has 86.0 percent of original size [2022-11-02 21:00:29,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 719 treesize of output 530 [2022-11-02 21:00:30,776 INFO L356 Elim1Store]: treesize reduction 92, result has 24.0 percent of original size [2022-11-02 21:00:30,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 147 treesize of output 111 [2022-11-02 21:00:30,857 INFO L356 Elim1Store]: treesize reduction 88, result has 27.3 percent of original size [2022-11-02 21:00:30,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 346 treesize of output 250 [2022-11-02 21:00:31,001 INFO L356 Elim1Store]: treesize reduction 100, result has 17.4 percent of original size [2022-11-02 21:00:31,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 500 treesize of output 328 [2022-11-02 21:00:31,078 INFO L356 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2022-11-02 21:00:31,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 220 treesize of output 1 [2022-11-02 21:00:31,095 INFO L356 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2022-11-02 21:00:31,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 220 treesize of output 1 [2022-11-02 21:00:31,110 INFO L356 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2022-11-02 21:00:31,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 1 [2022-11-02 21:00:31,130 INFO L356 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2022-11-02 21:00:31,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 565 treesize of output 1 [2022-11-02 21:00:31,149 INFO L356 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2022-11-02 21:00:31,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 374 treesize of output 1 [2022-11-02 21:00:31,175 INFO L356 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2022-11-02 21:00:31,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 719 treesize of output 1 [2022-11-02 21:00:31,200 INFO L356 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2022-11-02 21:00:31,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 220 treesize of output 1 [2022-11-02 21:00:31,282 INFO L356 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2022-11-02 21:00:31,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 719 treesize of output 1 [2022-11-02 21:00:31,299 INFO L356 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2022-11-02 21:00:31,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 220 treesize of output 1 [2022-11-02 21:00:31,313 INFO L356 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2022-11-02 21:00:31,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 220 treesize of output 1 [2022-11-02 21:00:31,324 INFO L356 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2022-11-02 21:00:31,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 1 [2022-11-02 21:00:31,340 INFO L356 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2022-11-02 21:00:31,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 565 treesize of output 1 [2022-11-02 21:00:31,354 INFO L356 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2022-11-02 21:00:31,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 374 treesize of output 1 [2022-11-02 21:00:31,384 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-11-02 21:00:31,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 285 treesize of output 1 [2022-11-02 21:00:31,398 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-11-02 21:00:31,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 116 treesize of output 1 [2022-11-02 21:00:31,417 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-11-02 21:00:31,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 1 [2022-11-02 21:00:31,430 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-11-02 21:00:31,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 116 treesize of output 1 [2022-11-02 21:00:31,443 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-11-02 21:00:31,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 214 treesize of output 1 [2022-11-02 21:00:31,456 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-11-02 21:00:31,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 187 treesize of output 1 [2022-11-02 21:00:31,481 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-02 21:00:31,482 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 116 treesize of output 1 [2022-11-02 21:00:31,492 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-02 21:00:31,492 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 285 treesize of output 1 [2022-11-02 21:00:31,714 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 21:00:31,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34196227] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:00:31,715 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:00:31,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 28 [2022-11-02 21:00:31,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468819937] [2022-11-02 21:00:31,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:00:31,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-02 21:00:31,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:31,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-02 21:00:31,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2022-11-02 21:00:31,717 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 28 states, 28 states have (on average 2.642857142857143) internal successors, (74), 28 states have internal predecessors, (74), 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:35,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:35,155 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2022-11-02 21:00:35,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-02 21:00:35,155 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.642857142857143) internal successors, (74), 28 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-02 21:00:35,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:00:35,156 INFO L225 Difference]: With dead ends: 83 [2022-11-02 21:00:35,157 INFO L226 Difference]: Without dead ends: 57 [2022-11-02 21:00:35,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=542, Invalid=2214, Unknown=0, NotChecked=0, Total=2756 [2022-11-02 21:00:35,159 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 214 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 21:00:35,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 144 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 21:00:35,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-02 21:00:35,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 44. [2022-11-02 21:00:35,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 states have internal predecessors, (47), 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:35,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2022-11-02 21:00:35,188 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 31 [2022-11-02 21:00:35,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:00:35,189 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2022-11-02 21:00:35,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.642857142857143) internal successors, (74), 28 states have internal predecessors, (74), 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:35,191 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2022-11-02 21:00:35,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-02 21:00:35,194 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:35,194 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:00:35,223 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf732500-6b86-42b5-a311-f7edf7e28325/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 21:00:35,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf732500-6b86-42b5-a311-f7edf7e28325/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:00:35,403 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:00:35,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:35,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1732581416, now seen corresponding path program 3 times [2022-11-02 21:00:35,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:35,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933960188] [2022-11-02 21:00:35,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:35,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:35,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:39,368 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-02 21:00:39,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:39,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933960188] [2022-11-02 21:00:39,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933960188] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:00:39,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323745504] [2022-11-02 21:00:39,369 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 21:00:39,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:00:39,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf732500-6b86-42b5-a311-f7edf7e28325/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:00:39,375 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf732500-6b86-42b5-a311-f7edf7e28325/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:00:39,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf732500-6b86-42b5-a311-f7edf7e28325/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 21:00:39,751 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-02 21:00:39,751 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:00:39,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-02 21:00:39,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:00:39,770 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 14 treesize of output 12 [2022-11-02 21:00:40,247 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 21:00:40,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 113 [2022-11-02 21:00:40,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 87 [2022-11-02 21:00:41,072 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:00:41,080 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:00:41,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 74 treesize of output 34 [2022-11-02 21:00:41,120 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-02 21:00:41,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:00:41,777 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:00:41,778 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 219 treesize of output 223 [2022-11-02 21:00:42,067 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:00:42,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 752 treesize of output 692 [2022-11-02 21:00:42,254 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:00:42,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 387 treesize of output 351 [2022-11-02 21:00:42,516 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:00:42,517 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 134 treesize of output 99 [2022-11-02 21:00:42,537 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:00:42,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 76 [2022-11-02 21:00:42,573 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:00:42,574 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 125 treesize of output 105 [2022-11-02 21:00:42,599 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:00:42,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 183 treesize of output 167 [2022-11-02 21:00:42,709 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:00:42,711 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-11-02 21:00:42,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:00:42,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:00:42,731 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-02 21:00:42,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 105 treesize of output 1 [2022-11-02 21:00:42,823 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:00:42,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 495 treesize of output 443 [2022-11-02 21:00:42,852 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:00:42,853 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 375 treesize of output 315 [2022-11-02 21:00:43,042 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:00:43,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 275 treesize of output 251 [2022-11-02 21:00:43,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 151 [2022-11-02 21:00:43,111 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:00:43,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:00:43,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:00:43,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:00:43,157 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 21:00:43,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 105 treesize of output 1 [2022-11-02 21:00:43,262 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:00:43,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 275 treesize of output 247 [2022-11-02 21:00:45,250 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:00:45,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 479 treesize of output 407 [2022-11-02 21:00:49,077 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-02 21:00:49,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323745504] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:00:49,078 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:00:49,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 11] total 30 [2022-11-02 21:00:49,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894132845] [2022-11-02 21:00:49,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:00:49,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-02 21:00:49,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:49,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-02 21:00:49,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=744, Unknown=0, NotChecked=0, Total=870 [2022-11-02 21:00:49,081 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 30 states, 30 states have (on average 3.1333333333333333) internal successors, (94), 30 states have internal predecessors, (94), 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:50,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:50,592 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2022-11-02 21:00:50,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-02 21:00:50,593 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.1333333333333333) internal successors, (94), 30 states have internal predecessors, (94), 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 43 [2022-11-02 21:00:50,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:00:50,599 INFO L225 Difference]: With dead ends: 89 [2022-11-02 21:00:50,600 INFO L226 Difference]: Without dead ends: 87 [2022-11-02 21:00:50,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 70 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=243, Invalid=1317, Unknown=0, NotChecked=0, Total=1560 [2022-11-02 21:00:50,602 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 93 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:00:50,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 224 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 325 Invalid, 0 Unknown, 44 Unchecked, 0.5s Time] [2022-11-02 21:00:50,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-02 21:00:50,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 51. [2022-11-02 21:00:50,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.1) internal successors, (55), 50 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:50,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2022-11-02 21:00:50,639 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 43 [2022-11-02 21:00:50,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:00:50,642 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2022-11-02 21:00:50,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.1333333333333333) internal successors, (94), 30 states have internal predecessors, (94), 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:50,643 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-11-02 21:00:50,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-02 21:00:50,646 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:50,646 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:00:50,696 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf732500-6b86-42b5-a311-f7edf7e28325/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 21:00:50,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf732500-6b86-42b5-a311-f7edf7e28325/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:00:50,870 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:00:50,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:50,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1620778086, now seen corresponding path program 4 times [2022-11-02 21:00:50,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:50,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256537475] [2022-11-02 21:00:50,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:50,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:50,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:51,389 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-02 21:00:51,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:51,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256537475] [2022-11-02 21:00:51,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256537475] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:00:51,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566766403] [2022-11-02 21:00:51,390 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-02 21:00:51,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:00:51,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf732500-6b86-42b5-a311-f7edf7e28325/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:00:51,391 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf732500-6b86-42b5-a311-f7edf7e28325/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:00:51,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf732500-6b86-42b5-a311-f7edf7e28325/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 21:00:52,012 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-02 21:00:52,013 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:00:52,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-02 21:00:52,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:00:52,036 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 21:00:52,037 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 23 treesize of output 19 [2022-11-02 21:00:52,297 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 13 treesize of output 9 [2022-11-02 21:00:52,412 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 6 treesize of output 5 [2022-11-02 21:00:52,470 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 6 treesize of output 5 [2022-11-02 21:00:52,539 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 13 treesize of output 9 [2022-11-02 21:00:52,627 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 6 treesize of output 5 [2022-11-02 21:00:52,674 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 6 treesize of output 5 [2022-11-02 21:00:52,716 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 27 treesize of output 30 [2022-11-02 21:00:52,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 130 [2022-11-02 21:00:52,852 INFO L356 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2022-11-02 21:00:52,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 111 [2022-11-02 21:00:52,881 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 60 treesize of output 12 [2022-11-02 21:00:53,783 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 21:00:53,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:01:44,975 WARN L234 SmtUtils]: Spent 10.06s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 21:02:43,614 WARN L234 SmtUtils]: Spent 22.65s on a formula simplification that was a NOOP. DAG size: 125 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 21:03:39,415 WARN L234 SmtUtils]: Spent 22.99s on a formula simplification that was a NOOP. DAG size: 127 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 21:03:39,821 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse39 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296))) (let ((.cse0 (<= .cse39 2147483647)) (.cse5 (+ 8 |c_ULTIMATE.start_main_~#C~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8)) (.cse3 (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 8)) (.cse21 (* .cse39 4))) (and (or (not .cse0) (let ((.cse9 (+ .cse21 |c_ULTIMATE.start_main_~#C~0#1.offset|)) (.cse11 (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse21)) (.cse12 (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse21))) (and (forall ((|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse13 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (< |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 0) (let ((.cse4 (let ((.cse7 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse6 (store v_ArrVal_266 .cse9 (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse10 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse11) (select (select .cse10 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse12)))))) (store .cse6 (+ .cse7 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse6))) (+ (select (select .cse8 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse7)) (select (select .cse8 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse7)))))))) (= (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse4))) (+ (select (select .cse1 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse2) (select (select .cse1 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse3))) (select .cse4 .cse5))) (< 2147483647 .cse13) (< .cse13 0) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|)))) (forall ((|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse20 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (<= |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 2147483647) (let ((.cse14 (let ((.cse17 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse16 (store v_ArrVal_266 .cse9 (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse19 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse11) (select (select .cse19 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse12)))))) (store .cse16 (+ (- 17179869184) .cse17 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse16))) (+ (select (select .cse18 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse17)) (select (select .cse18 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) .cse17)))))))) (= (select .cse14 .cse5) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse14))) (+ (select (select .cse15 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse3) (select (select .cse15 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse2))))) (<= 4294967296 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|) (<= 4294967296 .cse20) (<= .cse20 2147483647))))))) (or .cse0 (let ((.cse28 (+ (- 17179869184) .cse21 |c_ULTIMATE.start_main_~#C~0#1.offset|)) (.cse30 (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) .cse21)) (.cse31 (+ (- 17179869184) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse21))) (and (forall ((|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse22 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (<= |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 2147483647) (<= 4294967296 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|) (<= 4294967296 .cse22) (<= .cse22 2147483647) (let ((.cse23 (let ((.cse26 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse25 (store v_ArrVal_266 .cse28 (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse29 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse30) (select (select .cse29 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse31)))))) (store .cse25 (+ (- 17179869184) .cse26 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse25))) (+ (select (select .cse27 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse26)) (select (select .cse27 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) .cse26)))))))) (= (select .cse23 .cse5) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse23))) (+ (select (select .cse24 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse3) (select (select .cse24 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse2)))))))) (forall ((|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse32 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (< |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 0) (< 2147483647 .cse32) (< .cse32 0) (let ((.cse33 (let ((.cse36 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse35 (store v_ArrVal_266 .cse28 (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse38 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse30) (select (select .cse38 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse31)))))) (store .cse35 (+ .cse36 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse35))) (+ (select (select .cse37 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse36)) (select (select .cse37 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse36)))))))) (= (select .cse33 .cse5) (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse33))) (+ (select (select .cse34 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse2) (select (select .cse34 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse3))))) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|)))))))))) is different from false [2022-11-02 21:03:40,301 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse39 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296))) (let ((.cse0 (<= .cse39 2147483647)) (.cse4 (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8)) (.cse3 (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 8)) (.cse6 (+ 8 |c_ULTIMATE.start_main_~#C~0#1.offset|)) (.cse21 (* 4 .cse39))) (and (or (not .cse0) (let ((.cse10 (+ .cse21 |c_ULTIMATE.start_main_~#C~0#1.offset|)) (.cse12 (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse21)) (.cse13 (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse21))) (and (forall ((|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse1 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (<= |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 2147483647) (<= 4294967296 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|) (<= 4294967296 .cse1) (<= .cse1 2147483647) (let ((.cse5 (let ((.cse8 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse7 (store v_ArrVal_266 .cse10 (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse11 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse12) (select (select .cse11 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse13)))))) (store .cse7 (+ (- 17179869184) .cse8 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse7))) (+ (select (select .cse9 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse8)) (select (select .cse9 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) .cse8)))))))) (= (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse5))) (+ (select (select .cse2 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse3) (select (select .cse2 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse4))) (select .cse5 .cse6)))))) (forall ((|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse20 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (let ((.cse15 (let ((.cse17 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse16 (store v_ArrVal_266 .cse10 (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse19 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse12) (select (select .cse19 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse13)))))) (store .cse16 (+ .cse17 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse16))) (+ (select (select .cse18 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse17)) (select (select .cse18 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse17)))))))) (= (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse15))) (+ (select (select .cse14 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse4) (select (select .cse14 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse3))) (select .cse15 .cse6))) (< |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 0) (< 2147483647 .cse20) (< .cse20 0) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))))))) (or .cse0 (let ((.cse28 (+ (- 17179869184) .cse21 |c_ULTIMATE.start_main_~#C~0#1.offset|)) (.cse30 (+ (- 17179869184) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse21)) (.cse31 (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) .cse21))) (and (forall ((|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse22 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (<= |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 2147483647) (<= 4294967296 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|) (<= 4294967296 .cse22) (let ((.cse24 (let ((.cse26 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse25 (store v_ArrVal_266 .cse28 (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse29 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse30) (select (select .cse29 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse31)))))) (store .cse25 (+ (- 17179869184) .cse26 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse25))) (+ (select (select .cse27 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) .cse26)) (select (select .cse27 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse26)))))))) (= (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse24))) (+ (select (select .cse23 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse4) (select (select .cse23 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse3))) (select .cse24 .cse6))) (<= .cse22 2147483647)))) (forall ((|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse38 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (< |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 0) (let ((.cse33 (let ((.cse35 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse34 (store v_ArrVal_266 .cse28 (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse37 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse30) (select (select .cse37 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse31)))))) (store .cse34 (+ .cse35 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse34))) (+ (select (select .cse36 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse35)) (select (select .cse36 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse35)))))))) (= (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse33))) (+ (select (select .cse32 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse4) (select (select .cse32 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse3))) (select .cse33 .cse6))) (< 2147483647 .cse38) (< .cse38 0) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|)))))))))) is different from false [2022-11-02 21:03:40,961 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 8 |c_ULTIMATE.start_main_~#C~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8)) (.cse2 (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 8))) (and (forall ((|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse0 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (<= |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 2147483647) (<= 4294967296 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|) (<= 4294967296 .cse0) (<= .cse0 2147483647) (let ((.cse4 (let ((.cse7 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse6 (store v_ArrVal_266 .cse5 (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse9 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse3) (select (select .cse9 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse2)))))) (store .cse6 (+ (- 17179869184) .cse7 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse6))) (+ (select (select .cse8 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse7)) (select (select .cse8 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) .cse7)))))))) (= (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse4))) (+ (select (select .cse1 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse2) (select (select .cse1 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse3))) (select .cse4 .cse5)))))) (forall ((|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse16 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (let ((.cse10 (let ((.cse13 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse12 (store v_ArrVal_266 .cse5 (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse15 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse3) (select (select .cse15 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse2)))))) (store .cse12 (+ .cse13 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse12))) (+ (select (select .cse14 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse13)) (select (select .cse14 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse13)))))))) (= (select .cse10 .cse5) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse10))) (+ (select (select .cse11 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse2) (select (select .cse11 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse3))))) (< |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 0) (< 2147483647 .cse16) (< .cse16 0) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|)))))) is different from false [2022-11-02 21:03:41,956 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse41 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296))) (let ((.cse14 (<= .cse41 2147483647)) (.cse40 (* .cse41 4))) (let ((.cse23 (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) .cse40)) (.cse13 (not .cse14)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~#C~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 8)) (.cse3 (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8)) (.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base|)) (.cse11 (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse40))) (and (or (forall ((|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_263 Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse12 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| (store .cse10 .cse11 v_ArrVal_263)))) (let ((.cse0 (let ((.cse7 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse6 (store v_ArrVal_266 .cse1 (let ((.cse9 (store .cse5 |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse9 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse4) (select (select .cse9 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse3)))))) (store .cse6 (+ .cse7 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse8 (store .cse5 |c_ULTIMATE.start_main_~#C~0#1.base| .cse6))) (+ (select (select .cse8 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse7)) (select (select .cse8 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse7)))))))) (= (select .cse0 .cse1) (let ((.cse2 (store .cse5 |c_ULTIMATE.start_main_~#C~0#1.base| .cse0))) (+ (select (select .cse2 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse3) (select (select .cse2 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse4)))))) (< |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 0) (< 2147483647 .cse12) (< .cse12 0) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|)))) .cse13) (or .cse14 (forall ((|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_263 Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse15 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (<= |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 2147483647) (<= 4294967296 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|) (<= 4294967296 .cse15) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| (store .cse10 .cse23 v_ArrVal_263)))) (let ((.cse16 (let ((.cse20 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse19 (store v_ArrVal_266 .cse1 (let ((.cse22 (store .cse18 |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse22 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse4) (select (select .cse22 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse3)))))) (store .cse19 (+ (- 17179869184) .cse20 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse21 (store .cse18 |c_ULTIMATE.start_main_~#C~0#1.base| .cse19))) (+ (select (select .cse21 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse20)) (select (select .cse21 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) .cse20)))))))) (= (select .cse16 .cse1) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_main_~#C~0#1.base| .cse16))) (+ (select (select .cse17 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse3) (select (select .cse17 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse4)))))) (<= .cse15 2147483647))))) (or (forall ((|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_263 Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse24 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (< |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 0) (< 2147483647 .cse24) (< .cse24 0) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| (store .cse10 .cse23 v_ArrVal_263)))) (let ((.cse27 (let ((.cse29 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse28 (store v_ArrVal_266 .cse1 (let ((.cse31 (store .cse26 |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse31 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse4) (select (select .cse31 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse3)))))) (store .cse28 (+ .cse29 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse30 (store .cse26 |c_ULTIMATE.start_main_~#C~0#1.base| .cse28))) (+ (select (select .cse30 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse29)) (select (select .cse30 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse29)))))))) (= (let ((.cse25 (store .cse26 |c_ULTIMATE.start_main_~#C~0#1.base| .cse27))) (+ (select (select .cse25 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse4) (select (select .cse25 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse3))) (select .cse27 .cse1)))) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|)))) .cse14) (or .cse13 (forall ((|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_263 Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse39 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (<= |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 2147483647) (<= 4294967296 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|) (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| (store .cse10 .cse11 v_ArrVal_263)))) (let ((.cse32 (let ((.cse36 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse35 (store v_ArrVal_266 .cse1 (let ((.cse38 (store .cse34 |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse38 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse4) (select (select .cse38 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse3)))))) (store .cse35 (+ (- 17179869184) .cse36 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse37 (store .cse34 |c_ULTIMATE.start_main_~#C~0#1.base| .cse35))) (+ (select (select .cse37 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse36)) (select (select .cse37 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) .cse36)))))))) (= (select .cse32 .cse1) (let ((.cse33 (store .cse34 |c_ULTIMATE.start_main_~#C~0#1.base| .cse32))) (+ (select (select .cse33 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse3) (select (select .cse33 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse4)))))) (<= 4294967296 .cse39) (<= .cse39 2147483647))))))))) is different from false [2022-11-02 21:03:42,744 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse41 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296))) (let ((.cse14 (<= .cse41 2147483647)) (.cse40 (* .cse41 4))) (let ((.cse22 (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) .cse40)) (.cse6 (+ 8 |c_ULTIMATE.start_main_~#C~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 8)) (.cse2 (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8)) (.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base|)) (.cse12 (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse40)) (.cse13 (not .cse14))) (and (or (forall ((|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_263 Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse0 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (< |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 0) (< 2147483647 .cse0) (< .cse0 0) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| (store .cse11 .cse12 v_ArrVal_263)))) (let ((.cse5 (let ((.cse8 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse7 (store v_ArrVal_266 .cse6 (let ((.cse10 (store .cse4 |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse10 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse3) (select (select .cse10 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse2)))))) (store .cse7 (+ .cse8 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse9 (store .cse4 |c_ULTIMATE.start_main_~#C~0#1.base| .cse7))) (+ (select (select .cse9 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse8)) (select (select .cse9 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse8)))))))) (= (let ((.cse1 (store .cse4 |c_ULTIMATE.start_main_~#C~0#1.base| .cse5))) (+ (select (select .cse1 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse2) (select (select .cse1 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse3))) (select .cse5 .cse6))))))) .cse13) (or .cse14 (forall ((|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_263 Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse23 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (<= |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 2147483647) (<= 4294967296 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| (store .cse11 .cse22 v_ArrVal_263)))) (let ((.cse17 (let ((.cse19 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse18 (store v_ArrVal_266 .cse6 (let ((.cse21 (store .cse16 |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse21 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse3) (select (select .cse21 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse2)))))) (store .cse18 (+ (- 17179869184) .cse19 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse20 (store .cse16 |c_ULTIMATE.start_main_~#C~0#1.base| .cse18))) (+ (select (select .cse20 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) .cse19)) (select (select .cse20 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse19)))))))) (= (let ((.cse15 (store .cse16 |c_ULTIMATE.start_main_~#C~0#1.base| .cse17))) (+ (select (select .cse15 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse2) (select (select .cse15 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse3))) (select .cse17 .cse6)))) (<= 4294967296 .cse23) (<= .cse23 2147483647))))) (or .cse14 (forall ((|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_263 Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse24 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (< |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 0) (< 2147483647 .cse24) (< .cse24 0) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| (store .cse11 .cse22 v_ArrVal_263)))) (let ((.cse27 (let ((.cse29 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse28 (store v_ArrVal_266 .cse6 (let ((.cse31 (store .cse26 |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse31 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse3) (select (select .cse31 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse2)))))) (store .cse28 (+ .cse29 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse30 (store .cse26 |c_ULTIMATE.start_main_~#C~0#1.base| .cse28))) (+ (select (select .cse30 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse29)) (select (select .cse30 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse29)))))))) (= (let ((.cse25 (store .cse26 |c_ULTIMATE.start_main_~#C~0#1.base| .cse27))) (+ (select (select .cse25 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse3) (select (select .cse25 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse2))) (select .cse27 .cse6)))))))) (or (forall ((|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_263 Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse32 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (<= |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 2147483647) (<= 4294967296 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|) (<= 4294967296 .cse32) (<= .cse32 2147483647) (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| (store .cse11 .cse12 v_ArrVal_263)))) (let ((.cse35 (let ((.cse37 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse36 (store v_ArrVal_266 .cse6 (let ((.cse39 (store .cse34 |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse39 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse3) (select (select .cse39 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse2)))))) (store .cse36 (+ (- 17179869184) .cse37 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse38 (store .cse34 |c_ULTIMATE.start_main_~#C~0#1.base| .cse36))) (+ (select (select .cse38 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) .cse37)) (select (select .cse38 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse37)))))))) (= (let ((.cse33 (store .cse34 |c_ULTIMATE.start_main_~#C~0#1.base| .cse35))) (+ (select (select .cse33 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse3) (select (select .cse33 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse2))) (select .cse35 .cse6))))))) .cse13))))) is different from false [2022-11-02 21:03:43,415 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:03:43,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 736 treesize of output 465 [2022-11-02 21:03:43,491 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:03:43,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 753 treesize of output 457 [2022-11-02 21:03:43,565 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:03:43,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 762 treesize of output 466 [2022-11-02 21:03:43,639 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:03:43,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 727 treesize of output 456 [2022-11-02 21:03:43,802 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (<= (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647))) (let ((.cse0 (not .cse12)) (.cse7 (+ 8 |c_ULTIMATE.start_main_~#C~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 8)) (.cse4 (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8))) (and (or .cse0 (forall ((v_arrayElimArr_8 (Array Int Int)) (|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse1 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (< |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 0) (< 2147483647 .cse1) (< .cse1 0) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| v_arrayElimArr_8))) (let ((.cse6 (let ((.cse9 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse8 (store v_ArrVal_266 .cse7 (let ((.cse11 (store .cse5 |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse11 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse4) (select (select .cse11 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse3)))))) (store .cse8 (+ .cse9 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse10 (store .cse5 |c_ULTIMATE.start_main_~#C~0#1.base| .cse8))) (+ (select (select .cse10 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse9)) (select (select .cse10 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse9)))))))) (= (let ((.cse2 (store .cse5 |c_ULTIMATE.start_main_~#C~0#1.base| .cse6))) (+ (select (select .cse2 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse3) (select (select .cse2 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse4))) (select .cse6 .cse7)))))))) (or .cse12 (forall ((v_arrayElimArr_7 (Array Int Int)) (|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse20 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (<= |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 2147483647) (<= 4294967296 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| v_arrayElimArr_7))) (let ((.cse13 (let ((.cse17 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse16 (store v_ArrVal_266 .cse7 (let ((.cse19 (store .cse15 |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse19 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse4) (select (select .cse19 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse3)))))) (store .cse16 (+ (- 17179869184) .cse17 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse18 (store .cse15 |c_ULTIMATE.start_main_~#C~0#1.base| .cse16))) (+ (select (select .cse18 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) .cse17)) (select (select .cse18 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse17)))))))) (= (select .cse13 .cse7) (let ((.cse14 (store .cse15 |c_ULTIMATE.start_main_~#C~0#1.base| .cse13))) (+ (select (select .cse14 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse3) (select (select .cse14 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse4)))))) (<= 4294967296 .cse20) (<= .cse20 2147483647))))) (or .cse12 (forall ((v_arrayElimArr_6 (Array Int Int)) (|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse28 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (< |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 0) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| v_arrayElimArr_6))) (let ((.cse21 (let ((.cse25 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse24 (store v_ArrVal_266 .cse7 (let ((.cse27 (store .cse23 |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse27 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse4) (select (select .cse27 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse3)))))) (store .cse24 (+ .cse25 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse26 (store .cse23 |c_ULTIMATE.start_main_~#C~0#1.base| .cse24))) (+ (select (select .cse26 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse25)) (select (select .cse26 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse25)))))))) (= (select .cse21 .cse7) (let ((.cse22 (store .cse23 |c_ULTIMATE.start_main_~#C~0#1.base| .cse21))) (+ (select (select .cse22 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse4) (select (select .cse22 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse3)))))) (< 2147483647 .cse28) (< .cse28 0) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))))) (or .cse0 (forall ((v_arrayElimArr_5 (Array Int Int)) (|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse36 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (<= |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 2147483647) (<= 4294967296 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| v_arrayElimArr_5))) (let ((.cse29 (let ((.cse33 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse32 (store v_ArrVal_266 .cse7 (let ((.cse35 (store .cse31 |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse35 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse3) (select (select .cse35 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse4)))))) (store .cse32 (+ (- 17179869184) .cse33 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse34 (store .cse31 |c_ULTIMATE.start_main_~#C~0#1.base| .cse32))) (+ (select (select .cse34 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) .cse33)) (select (select .cse34 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse33)))))))) (= (select .cse29 .cse7) (let ((.cse30 (store .cse31 |c_ULTIMATE.start_main_~#C~0#1.base| .cse29))) (+ (select (select .cse30 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse4) (select (select .cse30 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse3)))))) (<= 4294967296 .cse36) (<= .cse36 2147483647)))))))) is different from false [2022-11-02 21:03:44,245 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse11 (<= (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2147483647))) (let ((.cse12 (not .cse11)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~#C~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8)) (.cse4 (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 8))) (and (or (forall ((v_arrayElimArr_6 (Array Int Int)) (|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse10 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (< |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 0) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| v_arrayElimArr_6))) (let ((.cse0 (let ((.cse7 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse6 (store v_ArrVal_266 .cse1 (let ((.cse9 (store .cse5 |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse9 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse3) (select (select .cse9 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse4)))))) (store .cse6 (+ .cse7 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse8 (store .cse5 |c_ULTIMATE.start_main_~#C~0#1.base| .cse6))) (+ (select (select .cse8 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse7)) (select (select .cse8 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse7)))))))) (= (select .cse0 .cse1) (let ((.cse2 (store .cse5 |c_ULTIMATE.start_main_~#C~0#1.base| .cse0))) (+ (select (select .cse2 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse3) (select (select .cse2 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse4)))))) (< 2147483647 .cse10) (< .cse10 0) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|)))) .cse11) (or .cse12 (forall ((v_arrayElimArr_5 (Array Int Int)) (|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse20 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (<= |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 2147483647) (<= 4294967296 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| v_arrayElimArr_5))) (let ((.cse13 (let ((.cse17 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse16 (store v_ArrVal_266 .cse1 (let ((.cse19 (store .cse15 |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse19 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse4) (select (select .cse19 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse3)))))) (store .cse16 (+ (- 17179869184) .cse17 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse18 (store .cse15 |c_ULTIMATE.start_main_~#C~0#1.base| .cse16))) (+ (select (select .cse18 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) .cse17)) (select (select .cse18 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse17)))))))) (= (select .cse13 .cse1) (let ((.cse14 (store .cse15 |c_ULTIMATE.start_main_~#C~0#1.base| .cse13))) (+ (select (select .cse14 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse3) (select (select .cse14 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse4)))))) (<= 4294967296 .cse20) (<= .cse20 2147483647))))) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse28 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (<= |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 2147483647) (<= 4294967296 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| v_arrayElimArr_7))) (let ((.cse21 (let ((.cse25 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse24 (store v_ArrVal_266 .cse1 (let ((.cse27 (store .cse23 |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse27 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse3) (select (select .cse27 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse4)))))) (store .cse24 (+ (- 17179869184) .cse25 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse26 (store .cse23 |c_ULTIMATE.start_main_~#C~0#1.base| .cse24))) (+ (select (select .cse26 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) .cse25)) (select (select .cse26 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse25)))))))) (= (select .cse21 .cse1) (let ((.cse22 (store .cse23 |c_ULTIMATE.start_main_~#C~0#1.base| .cse21))) (+ (select (select .cse22 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse4) (select (select .cse22 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse3)))))) (<= 4294967296 .cse28) (<= .cse28 2147483647)))) .cse11) (or .cse12 (forall ((v_arrayElimArr_8 (Array Int Int)) (|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse29 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (< |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 0) (< 2147483647 .cse29) (< .cse29 0) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| v_arrayElimArr_8))) (let ((.cse32 (let ((.cse34 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse33 (store v_ArrVal_266 .cse1 (let ((.cse36 (store .cse31 |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse36 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse3) (select (select .cse36 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse4)))))) (store .cse33 (+ .cse34 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse35 (store .cse31 |c_ULTIMATE.start_main_~#C~0#1.base| .cse33))) (+ (select (select .cse35 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse34)) (select (select .cse35 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse34)))))))) (= (let ((.cse30 (store .cse31 |c_ULTIMATE.start_main_~#C~0#1.base| .cse32))) (+ (select (select .cse30 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse4) (select (select .cse30 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse3))) (select .cse32 .cse1))))))))))) is different from false [2022-11-02 21:03:45,107 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~#C~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8)) (.cse4 (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 8))) (and (forall ((v_arrayElimArr_5 (Array Int Int)) (|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse10 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (<= |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 2147483647) (<= 4294967296 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| v_arrayElimArr_5))) (let ((.cse0 (let ((.cse7 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse6 (store v_ArrVal_266 .cse1 (let ((.cse9 (store .cse5 |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse9 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse4) (select (select .cse9 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse3)))))) (store .cse6 (+ (- 17179869184) .cse7 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse8 (store .cse5 |c_ULTIMATE.start_main_~#C~0#1.base| .cse6))) (+ (select (select .cse8 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) .cse7)) (select (select .cse8 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse7)))))))) (= (select .cse0 .cse1) (let ((.cse2 (store .cse5 |c_ULTIMATE.start_main_~#C~0#1.base| .cse0))) (+ (select (select .cse2 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse3) (select (select .cse2 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse4)))))) (<= 4294967296 .cse10) (<= .cse10 2147483647)))) (forall ((v_arrayElimArr_8 (Array Int Int)) (|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse11 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (< |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 0) (< 2147483647 .cse11) (< .cse11 0) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| v_arrayElimArr_8))) (let ((.cse14 (let ((.cse16 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse15 (store v_ArrVal_266 .cse1 (let ((.cse18 (store .cse13 |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse18 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse3) (select (select .cse18 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse4)))))) (store .cse15 (+ .cse16 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse17 (store .cse13 |c_ULTIMATE.start_main_~#C~0#1.base| .cse15))) (+ (select (select .cse17 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse16)) (select (select .cse17 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse16)))))))) (= (let ((.cse12 (store .cse13 |c_ULTIMATE.start_main_~#C~0#1.base| .cse14))) (+ (select (select .cse12 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse4) (select (select .cse12 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse3))) (select .cse14 .cse1))))))))) is different from false [2022-11-02 21:03:46,379 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 822643 treesize of output 822639 [2022-11-02 21:03:53,786 WARN L234 SmtUtils]: Spent 6.69s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-02 21:03:53,786 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:03:53,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 822597 treesize of output 705910 [2022-11-02 21:03:59,436 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:03:59,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 3700637 treesize of output 2935374