./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/sina3.c --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_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/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_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/sina3.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/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_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/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 2aebf3cfbf85ca5d76e40b9ce94a108ab82985532ad1ea09b88a009b3e11ff5a --- 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:09:32,257 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:09:32,259 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:09:32,299 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:09:32,300 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:09:32,303 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:09:32,306 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:09:32,310 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:09:32,315 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:09:32,320 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:09:32,321 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:09:32,323 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:09:32,324 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:09:32,326 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:09:32,328 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:09:32,331 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:09:32,332 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:09:32,333 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:09:32,335 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:09:32,342 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:09:32,344 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:09:32,345 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:09:32,349 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:09:32,350 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:09:32,353 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:09:32,353 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:09:32,353 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:09:32,358 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:09:32,360 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:09:32,361 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:09:32,362 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:09:32,363 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:09:32,365 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:09:32,367 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:09:32,369 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:09:32,369 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:09:32,370 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:09:32,370 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:09:32,371 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:09:32,372 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:09:32,372 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:09:32,374 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 21:09:32,413 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:09:32,413 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:09:32,414 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:09:32,414 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:09:32,415 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:09:32,415 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:09:32,416 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:09:32,417 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:09:32,417 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:09:32,417 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:09:32,418 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 21:09:32,418 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:09:32,419 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 21:09:32,419 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:09:32,419 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 21:09:32,419 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:09:32,419 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 21:09:32,420 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 21:09:32,420 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:09:32,420 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:09:32,420 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 21:09:32,421 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:09:32,421 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:09:32,421 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:09:32,421 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:09:32,422 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:09:32,423 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:09:32,423 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 21:09:32,424 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:09:32,424 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:09:32,424 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 21:09:32,424 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 21:09:32,425 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 21:09:32,425 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_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/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_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/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 -> 2aebf3cfbf85ca5d76e40b9ce94a108ab82985532ad1ea09b88a009b3e11ff5a [2022-11-02 21:09:32,738 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:09:32,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:09:32,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:09:32,781 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:09:32,782 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:09:32,783 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/array-fpi/sina3.c [2022-11-02 21:09:32,851 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/data/add064c01/613db87995724c6d870bb80eb51ebfc8/FLAGdebff0bf4 [2022-11-02 21:09:33,337 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:09:33,339 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/sv-benchmarks/c/array-fpi/sina3.c [2022-11-02 21:09:33,346 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/data/add064c01/613db87995724c6d870bb80eb51ebfc8/FLAGdebff0bf4 [2022-11-02 21:09:33,708 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/data/add064c01/613db87995724c6d870bb80eb51ebfc8 [2022-11-02 21:09:33,710 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:09:33,712 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:09:33,716 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:09:33,717 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:09:33,721 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:09:33,721 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:09:33" (1/1) ... [2022-11-02 21:09:33,722 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f0a55b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:33, skipping insertion in model container [2022-11-02 21:09:33,722 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:09:33" (1/1) ... [2022-11-02 21:09:33,729 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:09:33,743 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:09:33,924 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_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/sv-benchmarks/c/array-fpi/sina3.c[588,601] [2022-11-02 21:09:33,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:09:33,952 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:09:33,964 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_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/sv-benchmarks/c/array-fpi/sina3.c[588,601] [2022-11-02 21:09:33,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:09:33,984 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:09:33,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:33 WrapperNode [2022-11-02 21:09:33,984 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:09:33,985 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:09:33,985 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:09:33,985 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:09:33,993 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:09:33" (1/1) ... [2022-11-02 21:09:34,000 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:09:33" (1/1) ... [2022-11-02 21:09:34,020 INFO L138 Inliner]: procedures = 17, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2022-11-02 21:09:34,020 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:09:34,021 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:09:34,021 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:09:34,021 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:09:34,029 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:33" (1/1) ... [2022-11-02 21:09:34,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:33" (1/1) ... [2022-11-02 21:09:34,032 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:33" (1/1) ... [2022-11-02 21:09:34,032 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:33" (1/1) ... [2022-11-02 21:09:34,038 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:33" (1/1) ... [2022-11-02 21:09:34,042 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:33" (1/1) ... [2022-11-02 21:09:34,043 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:33" (1/1) ... [2022-11-02 21:09:34,044 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:33" (1/1) ... [2022-11-02 21:09:34,046 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:09:34,047 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:09:34,047 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:09:34,048 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:09:34,048 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:33" (1/1) ... [2022-11-02 21:09:34,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:09:34,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:09:34,078 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:09:34,095 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:09:34,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:09:34,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:09:34,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 21:09:34,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 21:09:34,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 21:09:34,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:09:34,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:09:34,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 21:09:34,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 21:09:34,235 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:09:34,237 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:09:34,466 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:09:34,472 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:09:34,473 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-02 21:09:34,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:09:34 BoogieIcfgContainer [2022-11-02 21:09:34,475 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:09:34,477 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:09:34,477 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:09:34,480 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:09:34,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:09:33" (1/3) ... [2022-11-02 21:09:34,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@246b806f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:09:34, skipping insertion in model container [2022-11-02 21:09:34,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:33" (2/3) ... [2022-11-02 21:09:34,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@246b806f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:09:34, skipping insertion in model container [2022-11-02 21:09:34,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:09:34" (3/3) ... [2022-11-02 21:09:34,484 INFO L112 eAbstractionObserver]: Analyzing ICFG sina3.c [2022-11-02 21:09:34,502 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:09:34,503 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 21:09:34,582 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:09:34,598 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;@e5be16b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:09:34,603 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 21:09:34,608 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:34,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 21:09:34,620 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:09:34,621 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:09:34,622 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:09:34,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:34,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1389277550, now seen corresponding path program 1 times [2022-11-02 21:09:34,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:34,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586055673] [2022-11-02 21:09:34,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:34,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:34,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:34,889 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:09:34,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:34,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586055673] [2022-11-02 21:09:34,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586055673] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:34,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:34,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:09:34,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532205926] [2022-11-02 21:09:34,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:34,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 21:09:34,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:34,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 21:09:34,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 21:09:34,949 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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:09:34,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:09:34,967 INFO L93 Difference]: Finished difference Result 50 states and 72 transitions. [2022-11-02 21:09:34,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 21:09:34,970 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-02 21:09:34,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:09:34,978 INFO L225 Difference]: With dead ends: 50 [2022-11-02 21:09:34,978 INFO L226 Difference]: Without dead ends: 23 [2022-11-02 21:09:34,981 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:09:34,984 INFO L413 NwaCegarLoop]: 32 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, 32 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:09:34,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:09:34,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-02 21:09:35,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-11-02 21:09:35,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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:09:35,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-11-02 21:09:35,012 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2022-11-02 21:09:35,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:09:35,012 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-11-02 21:09:35,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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:09:35,013 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-11-02 21:09:35,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 21:09:35,014 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:09:35,014 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:09:35,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:09:35,014 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:09:35,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:35,015 INFO L85 PathProgramCache]: Analyzing trace with hash 796930410, now seen corresponding path program 1 times [2022-11-02 21:09:35,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:35,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576962596] [2022-11-02 21:09:35,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:35,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:35,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:35,251 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:09:35,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:35,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576962596] [2022-11-02 21:09:35,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576962596] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:35,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:35,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:09:35,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480568217] [2022-11-02 21:09:35,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:35,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:09:35,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:35,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:09:35,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:09:35,256 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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:09:35,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:09:35,363 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2022-11-02 21:09:35,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:09:35,364 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-02 21:09:35,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:09:35,365 INFO L225 Difference]: With dead ends: 53 [2022-11-02 21:09:35,365 INFO L226 Difference]: Without dead ends: 37 [2022-11-02 21:09:35,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:09:35,367 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 41 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:09:35,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 17 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:09:35,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-02 21:09:35,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2022-11-02 21:09:35,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:35,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-11-02 21:09:35,375 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 16 [2022-11-02 21:09:35,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:09:35,376 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-11-02 21:09:35,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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:09:35,376 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-11-02 21:09:35,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 21:09:35,377 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:09:35,377 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:09:35,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:09:35,378 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:09:35,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:35,379 INFO L85 PathProgramCache]: Analyzing trace with hash 495241442, now seen corresponding path program 1 times [2022-11-02 21:09:35,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:35,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238095104] [2022-11-02 21:09:35,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:35,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:35,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:37,648 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:37,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:37,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238095104] [2022-11-02 21:09:37,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238095104] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:09:37,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451724175] [2022-11-02 21:09:37,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:37,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:09:37,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:09:37,652 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:09:37,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 21:09:37,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:37,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-02 21:09:37,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:09:37,822 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 21:09:37,824 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:09:37,863 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 11 treesize of output 7 [2022-11-02 21:09:37,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-02 21:09:38,034 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 26 treesize of output 28 [2022-11-02 21:09:38,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2022-11-02 21:09:38,526 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 47 treesize of output 33 [2022-11-02 21:09:38,864 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:09:38,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 38 [2022-11-02 21:09:38,902 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:38,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:09:39,531 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:09:39,532 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:09:39,534 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:09:39,548 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:39,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451724175] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:09:39,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:09:39,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 33 [2022-11-02 21:09:39,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595583863] [2022-11-02 21:09:39,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:09:39,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-02 21:09:39,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:39,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-02 21:09:39,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=895, Unknown=0, NotChecked=0, Total=1056 [2022-11-02 21:09:39,552 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 33 states, 33 states have (on average 1.696969696969697) internal successors, (56), 33 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:40,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:09:40,262 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2022-11-02 21:09:40,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 21:09:40,263 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.696969696969697) internal successors, (56), 33 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-02 21:09:40,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:09:40,264 INFO L225 Difference]: With dead ends: 56 [2022-11-02 21:09:40,264 INFO L226 Difference]: Without dead ends: 54 [2022-11-02 21:09:40,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=219, Invalid=1113, Unknown=0, NotChecked=0, Total=1332 [2022-11-02 21:09:40,266 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 42 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:09:40,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 113 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 315 Invalid, 0 Unknown, 28 Unchecked, 0.4s Time] [2022-11-02 21:09:40,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-02 21:09:40,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 44. [2022-11-02 21:09:40,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 43 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:40,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-11-02 21:09:40,277 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 24 [2022-11-02 21:09:40,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:09:40,277 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-11-02 21:09:40,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.696969696969697) internal successors, (56), 33 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:40,278 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-11-02 21:09:40,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 21:09:40,279 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:09:40,279 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:09:40,325 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 21:09:40,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:09:40,506 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:09:40,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:40,507 INFO L85 PathProgramCache]: Analyzing trace with hash 831040416, now seen corresponding path program 2 times [2022-11-02 21:09:40,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:40,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251069389] [2022-11-02 21:09:40,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:40,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:40,617 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 21:09:40,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:40,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251069389] [2022-11-02 21:09:40,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251069389] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:09:40,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351410063] [2022-11-02 21:09:40,621 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:09:40,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:09:40,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:09:40,623 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:09:40,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 21:09:40,717 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 21:09:40,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:09:40,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 21:09:40,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:09:40,780 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 21:09:40,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:09:40,841 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 21:09:40,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351410063] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:09:40,842 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:09:40,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-02 21:09:40,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325737757] [2022-11-02 21:09:40,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:09:40,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 21:09:40,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:40,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 21:09:40,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:09:40,844 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:41,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:09:41,030 INFO L93 Difference]: Finished difference Result 110 states and 128 transitions. [2022-11-02 21:09:41,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:09:41,031 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-02 21:09:41,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:09:41,032 INFO L225 Difference]: With dead ends: 110 [2022-11-02 21:09:41,032 INFO L226 Difference]: Without dead ends: 66 [2022-11-02 21:09:41,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-11-02 21:09:41,034 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 66 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:09:41,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 52 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:09:41,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-02 21:09:41,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2022-11-02 21:09:41,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:41,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2022-11-02 21:09:41,043 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 26 [2022-11-02 21:09:41,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:09:41,043 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2022-11-02 21:09:41,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:41,044 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2022-11-02 21:09:41,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 21:09:41,045 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:09:41,045 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:09:41,082 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 21:09:41,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:09:41,270 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:09:41,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:41,271 INFO L85 PathProgramCache]: Analyzing trace with hash -587916192, now seen corresponding path program 3 times [2022-11-02 21:09:41,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:41,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869966675] [2022-11-02 21:09:41,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:41,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:41,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:41,379 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 21:09:41,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:41,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869966675] [2022-11-02 21:09:41,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869966675] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:09:41,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724127955] [2022-11-02 21:09:41,381 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 21:09:41,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:09:41,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:09:41,382 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:09:41,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 21:09:41,484 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-02 21:09:41,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:09:41,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 21:09:41,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:09:41,538 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 21:09:41,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:09:41,586 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 21:09:41,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724127955] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:09:41,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:09:41,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-02 21:09:41,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188761339] [2022-11-02 21:09:41,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:09:41,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 21:09:41,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:41,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 21:09:41,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:09:41,589 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 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:09:41,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:09:41,732 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-11-02 21:09:41,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:09:41,733 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 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:09:41,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:09:41,733 INFO L225 Difference]: With dead ends: 63 [2022-11-02 21:09:41,733 INFO L226 Difference]: Without dead ends: 50 [2022-11-02 21:09:41,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-11-02 21:09:41,735 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 72 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:09:41,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 45 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:09:41,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-02 21:09:41,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2022-11-02 21:09:41,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:41,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-11-02 21:09:41,741 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 26 [2022-11-02 21:09:41,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:09:41,742 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-11-02 21:09:41,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 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:09:41,742 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-11-02 21:09:41,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 21:09:41,743 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:09:41,743 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:09:41,773 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 21:09:41,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:09:41,957 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:09:41,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:41,957 INFO L85 PathProgramCache]: Analyzing trace with hash -826292134, now seen corresponding path program 4 times [2022-11-02 21:09:41,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:41,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874182909] [2022-11-02 21:09:41,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:41,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:42,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:44,227 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:09:44,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:44,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874182909] [2022-11-02 21:09:44,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874182909] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:09:44,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521350281] [2022-11-02 21:09:44,228 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-02 21:09:44,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:09:44,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:09:44,232 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:09:44,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 21:09:44,338 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-02 21:09:44,338 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:09:44,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-02 21:09:44,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:09:44,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-02 21:09:44,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 21:09:44,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-02 21:09:44,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:09:44,562 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 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-02 21:09:44,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:09:44,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:09:44,937 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:09:44,949 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-02 21:09:44,949 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 1 case distinctions, treesize of input 39 treesize of output 44 [2022-11-02 21:09:45,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:09:45,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:09:45,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:09:45,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:09:45,184 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 21:09:45,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2022-11-02 21:09:45,508 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:09:45,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:09:45,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:09:45,513 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:09:45,516 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 21:09:45,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 53 [2022-11-02 21:09:45,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:09:45,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:09:45,737 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 21:09:45,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 45 [2022-11-02 21:09:46,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:09:46,032 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:09:46,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:09:46,034 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:09:46,048 INFO L356 Elim1Store]: treesize reduction 25, result has 34.2 percent of original size [2022-11-02 21:09:46,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 57 [2022-11-02 21:09:46,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:09:46,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:09:46,518 INFO L356 Elim1Store]: treesize reduction 124, result has 39.8 percent of original size [2022-11-02 21:09:46,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 90 treesize of output 145 [2022-11-02 21:09:47,835 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:47,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 86 treesize of output 122 [2022-11-02 21:09:47,896 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:09:47,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:09:50,151 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_70| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_70|)) (forall ((v_ArrVal_230 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_70| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_230) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1))))) is different from false [2022-11-02 21:10:16,124 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-02 21:10:16,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521350281] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:10:16,124 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:10:16,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 24] total 63 [2022-11-02 21:10:16,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947660060] [2022-11-02 21:10:16,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:10:16,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-11-02 21:10:16,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:16,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-11-02 21:10:16,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=460, Invalid=3305, Unknown=21, NotChecked=120, Total=3906 [2022-11-02 21:10:16,128 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 63 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 63 states have internal predecessors, (85), 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:10:24,204 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse1 (select .cse4 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse0 (select .cse4 .cse2)) (.cse3 (+ c_~N~0 1))) (and (= .cse0 (+ .cse1 2)) (<= c_~N~0 2) (= .cse1 1) (= .cse2 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (<= .cse3 .cse0) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (< 1 c_~N~0) (or (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (= .cse0 (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 1)) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (= .cse0 (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 1)) (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (and (<= (+ 2 |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.base|) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (* |c_ULTIMATE.start_main_~i~0#1| 4)) 1))) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))))) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= .cse0 .cse3) (forall ((|v_ULTIMATE.start_main_~i~0#1_70| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_70|)) (forall ((v_ArrVal_230 Int)) (= (select (store .cse4 (+ (* |v_ULTIMATE.start_main_~i~0#1_70| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_230) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse3))))))) is different from false [2022-11-02 21:10:26,355 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (<= c_~N~0 2) (= 3 .cse0) (< 1 c_~N~0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (or (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (= (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 1) .cse0)) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (and (= (+ (select (select |c_#memory_int| v_prenex_1) v_prenex_2) 1) .cse0) (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) 1) (<= (+ 2 |ULTIMATE.start_main_~b~0#1.base|) v_prenex_1))) (not (= v_prenex_1 |c_ULTIMATE.start_main_~a~0#1.base|))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_70| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_70|)) (forall ((v_ArrVal_230 Int)) (= (select (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_70| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_230) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)))))))) is different from false [2022-11-02 21:10:34,519 WARN L234 SmtUtils]: Spent 8.07s on a formula simplification. DAG size of input: 55 DAG size of output: 53 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 21:10:34,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:34,642 INFO L93 Difference]: Finished difference Result 94 states and 108 transitions. [2022-11-02 21:10:34,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-11-02 21:10:34,642 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 63 states have internal predecessors, (85), 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 32 [2022-11-02 21:10:34,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:34,644 INFO L225 Difference]: With dead ends: 94 [2022-11-02 21:10:34,645 INFO L226 Difference]: Without dead ends: 92 [2022-11-02 21:10:34,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 84 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2194 ImplicationChecksByTransitivity, 47.9s TimeCoverageRelationStatistics Valid=904, Invalid=5887, Unknown=27, NotChecked=492, Total=7310 [2022-11-02 21:10:34,648 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 35 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 624 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:34,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 190 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 419 Invalid, 0 Unknown, 624 Unchecked, 0.5s Time] [2022-11-02 21:10:34,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-02 21:10:34,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2022-11-02 21:10:34,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.1772151898734178) internal successors, (93), 79 states have internal predecessors, (93), 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:10:34,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 93 transitions. [2022-11-02 21:10:34,666 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 93 transitions. Word has length 32 [2022-11-02 21:10:34,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:34,667 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 93 transitions. [2022-11-02 21:10:34,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 63 states have internal predecessors, (85), 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:10:34,667 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 93 transitions. [2022-11-02 21:10:34,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 21:10:34,668 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:34,669 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:10:34,709 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 21:10:34,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:10:34,869 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:10:34,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:34,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1696042328, now seen corresponding path program 5 times [2022-11-02 21:10:34,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:34,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755286509] [2022-11-02 21:10:34,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:34,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:34,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:35,008 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-02 21:10:35,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:35,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755286509] [2022-11-02 21:10:35,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755286509] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:10:35,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838571846] [2022-11-02 21:10:35,009 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-02 21:10:35,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:10:35,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:10:35,010 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:10:35,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 21:10:35,177 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-11-02 21:10:35,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:10:35,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-02 21:10:35,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:10:35,268 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-02 21:10:35,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:10:35,339 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-02 21:10:35,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838571846] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:10:35,340 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:10:35,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-11-02 21:10:35,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245545002] [2022-11-02 21:10:35,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:10:35,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 21:10:35,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:35,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 21:10:35,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-11-02 21:10:35,341 INFO L87 Difference]: Start difference. First operand 80 states and 93 transitions. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 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:10:35,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:35,617 INFO L93 Difference]: Finished difference Result 169 states and 193 transitions. [2022-11-02 21:10:35,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 21:10:35,617 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 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 34 [2022-11-02 21:10:35,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:35,618 INFO L225 Difference]: With dead ends: 169 [2022-11-02 21:10:35,618 INFO L226 Difference]: Without dead ends: 132 [2022-11-02 21:10:35,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 57 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-11-02 21:10:35,619 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 96 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:35,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 91 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:10:35,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-02 21:10:35,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 93. [2022-11-02 21:10:35,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.141304347826087) internal successors, (105), 92 states have internal predecessors, (105), 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:10:35,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2022-11-02 21:10:35,651 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 34 [2022-11-02 21:10:35,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:35,652 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2022-11-02 21:10:35,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 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:10:35,652 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2022-11-02 21:10:35,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-02 21:10:35,653 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:35,654 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, 1, 1, 1, 1, 1] [2022-11-02 21:10:35,694 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 21:10:35,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:10:35,882 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:10:35,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:35,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1737020496, now seen corresponding path program 1 times [2022-11-02 21:10:35,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:35,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62975398] [2022-11-02 21:10:35,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:35,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:35,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,431 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:10:38,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:38,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62975398] [2022-11-02 21:10:38,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62975398] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:10:38,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144659259] [2022-11-02 21:10:38,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:38,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:10:38,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:10:38,434 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:10:38,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 21:10:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 81 conjunts are in the unsatisfiable core [2022-11-02 21:10:38,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:10:38,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 21:10:38,567 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 21:10:38,567 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:10:38,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-02 21:10:38,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:10:38,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-02 21:10:38,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:10:38,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-02 21:10:39,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:10:39,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:10:39,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 52 [2022-11-02 21:10:39,390 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:10:39,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:10:39,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:10:39,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2022-11-02 21:10:39,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:10:39,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:10:39,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 57 [2022-11-02 21:10:39,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:10:39,874 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:10:39,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:10:39,875 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:10:39,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 65 [2022-11-02 21:10:40,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:10:40,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:10:40,116 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 21:10:40,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 67 treesize of output 57 [2022-11-02 21:10:40,808 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:10:40,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 74 treesize of output 38 [2022-11-02 21:10:40,866 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:10:40,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:10:45,229 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:10:45,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144659259] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:10:45,229 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:10:45,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 23] total 66 [2022-11-02 21:10:45,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890510877] [2022-11-02 21:10:45,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:10:45,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-11-02 21:10:45,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:45,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-11-02 21:10:45,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=482, Invalid=3808, Unknown=0, NotChecked=0, Total=4290 [2022-11-02 21:10:45,234 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand has 66 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 66 states have internal predecessors, (97), 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:10:58,261 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse50 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse48 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse77 (+ .cse50 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse17 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse93 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse14 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse15 (select .cse48 .cse77))) (let ((.cse91 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15)))) (.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse78 (+ .cse93 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse38 (store .cse10 .cse78 1)) (.cse49 (select .cse48 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse19 (+ .cse50 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse39 (+ .cse93 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse9 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse29 (store .cse48 .cse77 1)) (.cse1 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse18 (select .cse91 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse10 |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse1 1)))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse2 (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse6))))) (let ((.cse3 (+ .cse4 (select (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse5 .cse6))) (= (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| .cse3)))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) .cse1))) .cse3))))))) (let ((.cse16 (select .cse18 .cse19))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15 .cse16))))) (let ((.cse13 (+ .cse14 .cse15 (select (select .cse12 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse16))) (= (let ((.cse11 (store .cse12 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| .cse13)))) (+ (select (select .cse11 |c_ULTIMATE.start_main_~b~0#1.base|) .cse1) (select (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) .cse13)))) (let ((.cse26 (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse29 .cse19 1)))) (store .cse28 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse28 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse1 1))))) (let ((.cse27 (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse23 (select .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse24 (select (select .cse26 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse25 (select (select (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse24))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse22 (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse24 .cse25))))) (let ((.cse20 (+ .cse23 (select (select .cse22 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse24 .cse25))) (= .cse20 (let ((.cse21 (store .cse22 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse22 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| .cse20)))) (+ (select (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse21 |c_ULTIMATE.start_main_~b~0#1.base|) .cse1)))))))))) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse38 .cse39 1)))) (let ((.cse37 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse33 (select (select .cse36 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse34 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse35 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse33 .cse34))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse32 (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse33 .cse34 .cse35))))) (let ((.cse30 (+ .cse33 (select (select .cse32 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse34 .cse35))) (= .cse30 (let ((.cse31 (store .cse32 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse32 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| .cse30)))) (+ (select (select .cse31 |c_ULTIMATE.start_main_~b~0#1.base|) .cse1) (select (select .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))))))) (let ((.cse46 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse38))) (let ((.cse47 (select .cse46 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse43 (select (select .cse46 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse45 (select .cse47 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse44 (select (select (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse43 .cse45))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse42 (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse43 .cse44 .cse45))))) (let ((.cse40 (+ (select (select .cse42 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse43 .cse44 .cse45))) (= .cse40 (let ((.cse41 (store .cse42 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse42 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| .cse40)))) (+ (select (select .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse41 |c_ULTIMATE.start_main_~b~0#1.base|) .cse1)))))))))) (= (select .cse48 .cse9) .cse49) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (or (<= (+ .cse50 |c_ULTIMATE.start_main_~a~0#1.offset| 1) (* c_~N~0 8)) (and (<= c_~N~0 .cse14) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (<= .cse14 c_~N~0) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse10 .cse1) 1))) (let ((.cse57 (let ((.cse59 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse48 .cse19 1)))) (store .cse59 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse59 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse1 1))))) (let ((.cse58 (select .cse57 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse54 (select (select .cse57 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse56 (select .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse55 (select (select (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse54 .cse56))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse52 (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse54 .cse55 .cse56))))) (let ((.cse53 (+ .cse54 (select (select .cse52 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse55 .cse56))) (= (let ((.cse51 (store .cse52 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse52 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| .cse53)))) (+ (select (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse51 |c_ULTIMATE.start_main_~b~0#1.base|) .cse1))) .cse53))))))) (let ((.cse63 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse49))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse62 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse63 .cse49))))) (let ((.cse60 (+ .cse14 .cse63 (select (select .cse62 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse49))) (= .cse60 (let ((.cse61 (store .cse62 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse62 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| .cse60)))) (+ (select (select .cse61 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse61 |c_ULTIMATE.start_main_~b~0#1.base|) .cse1))))))) (let ((.cse67 (select .cse48 .cse19))) (let ((.cse65 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse67))))) (let ((.cse66 (+ .cse14 .cse67 (select (select .cse65 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (= (let ((.cse64 (store .cse65 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse65 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| .cse66)))) (+ (select (select .cse64 |c_ULTIMATE.start_main_~b~0#1.base|) .cse1) (select (select .cse64 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) .cse66)))) (let ((.cse74 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse10 .cse39 1)))) (let ((.cse75 (select .cse74 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse72 (select .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse73 (select (select .cse74 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse71 (select (select (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse72 .cse73))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse69 (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse71 .cse72 .cse73))))) (let ((.cse70 (+ .cse71 (select (select .cse69 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse72 .cse73))) (= (let ((.cse68 (store .cse69 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse69 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| .cse70)))) (+ (select (select .cse68 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse68 |c_ULTIMATE.start_main_~b~0#1.base|) .cse1))) .cse70))))))) (let ((.cse76 (store .cse48 .cse77 (+ .cse14 (select .cse10 .cse78))))) (= (select .cse76 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse76 .cse9))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (let ((.cse85 (let ((.cse87 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse29))) (store .cse87 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse87 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse1 1))))) (let ((.cse86 (select .cse85 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse82 (select (select .cse85 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse84 (select .cse86 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse83 (select (select (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse86 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse82 .cse84))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse81 (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse86 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse82 .cse83 .cse84))))) (let ((.cse79 (+ (select (select .cse81 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse82 .cse83 .cse84))) (= .cse79 (let ((.cse80 (store .cse81 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse81 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| .cse79)))) (+ (select (select .cse80 |c_ULTIMATE.start_main_~b~0#1.base|) .cse1) (select (select .cse80 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))))))) (let ((.cse88 (+ .cse14 (select .cse10 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (= .cse88 (let ((.cse89 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~a~0#1.offset| .cse88)))) (+ (select (select .cse89 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse89 |c_ULTIMATE.start_main_~b~0#1.base|) .cse1))))) (let ((.cse92 (+ .cse14 .cse15 (select (select .cse91 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (= (let ((.cse90 (store .cse91 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~a~0#1.offset| .cse92)))) (+ (select (select .cse90 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse90 |c_ULTIMATE.start_main_~b~0#1.base|) .cse1))) .cse92)))))))) is different from false [2022-11-02 21:11:03,028 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse53 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse64 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse96 (+ .cse53 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse17 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse98 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse14 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse15 (select .cse64 .cse96))) (let ((.cse9 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse94 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15)))) (.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse97 (+ .cse98 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse44 (store .cse10 .cse97 1)) (.cse54 (select .cse64 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse19 (+ .cse53 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse33 (+ .cse98 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse31 (store .cse64 .cse96 (+ .cse14 (select .cse10 .cse97)))) (.cse29 (store .cse64 .cse96 1)) (.cse1 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse18 (select .cse94 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse35 (select .cse64 .cse9))) (and (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse10 |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse1 1)))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse2 (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse6))))) (let ((.cse3 (+ .cse4 (select (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse5 .cse6))) (= (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| .cse3)))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) .cse1))) .cse3))))))) (let ((.cse16 (select .cse18 .cse19))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15 .cse16))))) (let ((.cse13 (+ .cse14 .cse15 (select (select .cse12 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse16))) (= (let ((.cse11 (store .cse12 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| .cse13)))) (+ (select (select .cse11 |c_ULTIMATE.start_main_~b~0#1.base|) .cse1) (select (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) .cse13)))) (let ((.cse26 (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse29 .cse19 1)))) (store .cse28 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse28 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse1 1))))) (let ((.cse27 (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse23 (select .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse24 (select (select .cse26 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse25 (select (select (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse24))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse22 (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse24 .cse25))))) (let ((.cse20 (+ .cse23 (select (select .cse22 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse24 .cse25))) (= .cse20 (let ((.cse21 (store .cse22 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse22 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| .cse20)))) (+ (select (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse21 |c_ULTIMATE.start_main_~b~0#1.base|) .cse1)))))))))) (let ((.cse30 (store .cse31 .cse19 (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse31))) (+ (select (select .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse32 |c_ULTIMATE.start_main_~b~0#1.base|) .cse33)))))) (= (select .cse30 .cse9) (select .cse30 |c_ULTIMATE.start_main_~a~0#1.offset|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse34 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (and (= (select .cse34 0) 1) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 2) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= .cse35 (+ 2 (select .cse34 4))) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))))) (let ((.cse42 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse44 .cse33 1)))) (let ((.cse43 (select .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse39 (select (select .cse42 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse40 (select .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse41 (select (select (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 .cse40))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse38 (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 .cse40 .cse41))))) (let ((.cse36 (+ .cse39 (select (select .cse38 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse40 .cse41))) (= .cse36 (let ((.cse37 (store .cse38 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse38 |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|) .cse1) (select (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))))))) (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse44))) (let ((.cse52 (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse48 (select (select .cse51 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse50 (select .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse49 (select (select (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse50))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse47 (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse49 .cse50))))) (let ((.cse45 (+ (select (select .cse47 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse48 .cse49 .cse50))) (= .cse45 (let ((.cse46 (store .cse47 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse47 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| .cse45)))) (+ (select (select .cse46 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse46 |c_ULTIMATE.start_main_~b~0#1.base|) .cse1)))))))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (or (<= (+ .cse53 |c_ULTIMATE.start_main_~a~0#1.offset| 1) (* c_~N~0 8)) (and (<= c_~N~0 .cse14) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (<= .cse14 c_~N~0) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse10 .cse1) 1))) (= 3 .cse54) (let ((.cse61 (let ((.cse63 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse64 .cse19 1)))) (store .cse63 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse63 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse1 1))))) (let ((.cse62 (select .cse61 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse58 (select (select .cse61 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse60 (select .cse62 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse59 (select (select (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse62 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse58 .cse60))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse56 (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse62 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse58 .cse59 .cse60))))) (let ((.cse57 (+ .cse58 (select (select .cse56 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse59 .cse60))) (= (let ((.cse55 (store .cse56 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse56 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| .cse57)))) (+ (select (select .cse55 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse55 |c_ULTIMATE.start_main_~b~0#1.base|) .cse1))) .cse57))))))) (let ((.cse68 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse54))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse67 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse68 .cse54))))) (let ((.cse65 (+ .cse14 .cse68 (select (select .cse67 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse54))) (= .cse65 (let ((.cse66 (store .cse67 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse67 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| .cse65)))) (+ (select (select .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse66 |c_ULTIMATE.start_main_~b~0#1.base|) .cse1))))))) (let ((.cse72 (select .cse64 .cse19))) (let ((.cse70 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse72))))) (let ((.cse71 (+ .cse14 .cse72 (select (select .cse70 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (= (let ((.cse69 (store .cse70 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse70 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| .cse71)))) (+ (select (select .cse69 |c_ULTIMATE.start_main_~b~0#1.base|) .cse1) (select (select .cse69 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) .cse71)))) (let ((.cse79 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse10 .cse33 1)))) (let ((.cse80 (select .cse79 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse77 (select .cse80 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse78 (select (select .cse79 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse76 (select (select (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse77 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse74 (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse76 .cse77 .cse78))))) (let ((.cse75 (+ .cse76 (select (select .cse74 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse77 .cse78))) (= (let ((.cse73 (store .cse74 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse74 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| .cse75)))) (+ (select (select .cse73 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse73 |c_ULTIMATE.start_main_~b~0#1.base|) .cse1))) .cse75))))))) (let ((.cse81 (store .cse64 .cse19 (+ .cse14 (select .cse10 .cse33))))) (= (select .cse81 .cse9) (select .cse81 |c_ULTIMATE.start_main_~a~0#1.offset|))) (= (select .cse31 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse31 .cse9)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (let ((.cse88 (let ((.cse90 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse29))) (store .cse90 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse90 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse1 1))))) (let ((.cse89 (select .cse88 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse85 (select (select .cse88 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse87 (select .cse89 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse86 (select (select (store .cse88 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse89 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse85 .cse87))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse84 (store .cse88 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse89 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse85 .cse86 .cse87))))) (let ((.cse82 (+ (select (select .cse84 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse85 .cse86 .cse87))) (= .cse82 (let ((.cse83 (store .cse84 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse84 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| .cse82)))) (+ (select (select .cse83 |c_ULTIMATE.start_main_~b~0#1.base|) .cse1) (select (select .cse83 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))))))) (let ((.cse91 (+ .cse14 (select .cse10 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (= .cse91 (let ((.cse92 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse64 |c_ULTIMATE.start_main_~a~0#1.offset| .cse91)))) (+ (select (select .cse92 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse92 |c_ULTIMATE.start_main_~b~0#1.base|) .cse1))))) (let ((.cse95 (+ .cse14 .cse15 (select (select .cse94 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (= (let ((.cse93 (store .cse94 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~a~0#1.offset| .cse95)))) (+ (select (select .cse93 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse93 |c_ULTIMATE.start_main_~b~0#1.base|) .cse1))) .cse95)) (= .cse35 3))))))) is different from false [2022-11-02 21:11:05,043 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse53 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse64 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse96 (+ .cse53 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse17 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse98 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse14 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse15 (select .cse64 .cse96))) (let ((.cse9 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse94 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15)))) (.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse97 (+ .cse98 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse44 (store .cse10 .cse97 1)) (.cse54 (select .cse64 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse19 (+ .cse53 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse33 (+ .cse98 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse31 (store .cse64 .cse96 (+ .cse14 (select .cse10 .cse97)))) (.cse29 (store .cse64 .cse96 1)) (.cse1 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse18 (select .cse94 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse35 (select .cse64 .cse9))) (and (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse10 |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse1 1)))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse2 (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse6))))) (let ((.cse3 (+ .cse4 (select (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse5 .cse6))) (= (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| .cse3)))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) .cse1))) .cse3))))))) (let ((.cse16 (select .cse18 .cse19))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15 .cse16))))) (let ((.cse13 (+ .cse14 .cse15 (select (select .cse12 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse16))) (= (let ((.cse11 (store .cse12 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| .cse13)))) (+ (select (select .cse11 |c_ULTIMATE.start_main_~b~0#1.base|) .cse1) (select (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) .cse13)))) (let ((.cse26 (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse29 .cse19 1)))) (store .cse28 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse28 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse1 1))))) (let ((.cse27 (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse23 (select .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse24 (select (select .cse26 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse25 (select (select (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse24))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse22 (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse24 .cse25))))) (let ((.cse20 (+ .cse23 (select (select .cse22 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse24 .cse25))) (= .cse20 (let ((.cse21 (store .cse22 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse22 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| .cse20)))) (+ (select (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse21 |c_ULTIMATE.start_main_~b~0#1.base|) .cse1)))))))))) (let ((.cse30 (store .cse31 .cse19 (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse31))) (+ (select (select .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse32 |c_ULTIMATE.start_main_~b~0#1.base|) .cse33)))))) (= (select .cse30 .cse9) (select .cse30 |c_ULTIMATE.start_main_~a~0#1.offset|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse34 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (and (= (select .cse34 0) 1) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 2) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= .cse35 (+ 2 (select .cse34 4))) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))))) (let ((.cse42 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse44 .cse33 1)))) (let ((.cse43 (select .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse39 (select (select .cse42 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse40 (select .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse41 (select (select (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 .cse40))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse38 (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 .cse40 .cse41))))) (let ((.cse36 (+ .cse39 (select (select .cse38 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse40 .cse41))) (= .cse36 (let ((.cse37 (store .cse38 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse38 |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|) .cse1) (select (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))))))) (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse44))) (let ((.cse52 (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse48 (select (select .cse51 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse50 (select .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse49 (select (select (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse50))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse47 (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse49 .cse50))))) (let ((.cse45 (+ (select (select .cse47 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse48 .cse49 .cse50))) (= .cse45 (let ((.cse46 (store .cse47 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse47 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| .cse45)))) (+ (select (select .cse46 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse46 |c_ULTIMATE.start_main_~b~0#1.base|) .cse1)))))))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (or (<= (+ .cse53 |c_ULTIMATE.start_main_~a~0#1.offset| 1) (* c_~N~0 8)) (and (<= c_~N~0 .cse14) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (<= .cse14 c_~N~0) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse10 .cse1) 1))) (= 3 .cse54) (let ((.cse61 (let ((.cse63 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse64 .cse19 1)))) (store .cse63 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse63 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse1 1))))) (let ((.cse62 (select .cse61 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse58 (select (select .cse61 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse60 (select .cse62 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse59 (select (select (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse62 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse58 .cse60))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse56 (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse62 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse58 .cse59 .cse60))))) (let ((.cse57 (+ .cse58 (select (select .cse56 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse59 .cse60))) (= (let ((.cse55 (store .cse56 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse56 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| .cse57)))) (+ (select (select .cse55 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse55 |c_ULTIMATE.start_main_~b~0#1.base|) .cse1))) .cse57))))))) (let ((.cse68 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse54))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse67 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse68 .cse54))))) (let ((.cse65 (+ .cse14 .cse68 (select (select .cse67 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse54))) (= .cse65 (let ((.cse66 (store .cse67 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse67 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| .cse65)))) (+ (select (select .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse66 |c_ULTIMATE.start_main_~b~0#1.base|) .cse1))))))) (let ((.cse72 (select .cse64 .cse19))) (let ((.cse70 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse72))))) (let ((.cse71 (+ .cse14 .cse72 (select (select .cse70 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (= (let ((.cse69 (store .cse70 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse70 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| .cse71)))) (+ (select (select .cse69 |c_ULTIMATE.start_main_~b~0#1.base|) .cse1) (select (select .cse69 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) .cse71)))) (let ((.cse79 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse10 .cse33 1)))) (let ((.cse80 (select .cse79 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse77 (select .cse80 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse78 (select (select .cse79 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse76 (select (select (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse77 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse74 (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse76 .cse77 .cse78))))) (let ((.cse75 (+ .cse76 (select (select .cse74 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse77 .cse78))) (= (let ((.cse73 (store .cse74 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse74 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| .cse75)))) (+ (select (select .cse73 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse73 |c_ULTIMATE.start_main_~b~0#1.base|) .cse1))) .cse75))))))) (let ((.cse81 (store .cse64 .cse19 (+ .cse14 (select .cse10 .cse33))))) (= (select .cse81 .cse9) (select .cse81 |c_ULTIMATE.start_main_~a~0#1.offset|))) (= (select .cse31 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse31 .cse9)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (let ((.cse88 (let ((.cse90 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse29))) (store .cse90 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse90 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse1 1))))) (let ((.cse89 (select .cse88 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse85 (select (select .cse88 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse87 (select .cse89 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse86 (select (select (store .cse88 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse89 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse85 .cse87))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse84 (store .cse88 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse89 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse85 .cse86 .cse87))))) (let ((.cse82 (+ (select (select .cse84 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse85 .cse86 .cse87))) (= .cse82 (let ((.cse83 (store .cse84 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse84 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| .cse82)))) (+ (select (select .cse83 |c_ULTIMATE.start_main_~b~0#1.base|) .cse1) (select (select .cse83 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))))))) (let ((.cse91 (+ .cse14 (select .cse10 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (= .cse91 (let ((.cse92 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse64 |c_ULTIMATE.start_main_~a~0#1.offset| .cse91)))) (+ (select (select .cse92 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse92 |c_ULTIMATE.start_main_~b~0#1.base|) .cse1))))) (let ((.cse95 (+ .cse14 .cse15 (select (select .cse94 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (= (let ((.cse93 (store .cse94 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~a~0#1.offset| .cse95)))) (+ (select (select .cse93 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse93 |c_ULTIMATE.start_main_~b~0#1.base|) .cse1))) .cse95)) (= .cse35 3))))))) is different from true [2022-11-02 21:11:05,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:05,678 INFO L93 Difference]: Finished difference Result 130 states and 147 transitions. [2022-11-02 21:11:05,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-11-02 21:11:05,680 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 66 states have internal predecessors, (97), 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 36 [2022-11-02 21:11:05,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:05,682 INFO L225 Difference]: With dead ends: 130 [2022-11-02 21:11:05,682 INFO L226 Difference]: Without dead ends: 85 [2022-11-02 21:11:05,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 105 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3208 ImplicationChecksByTransitivity, 24.5s TimeCoverageRelationStatistics Valid=1331, Invalid=9594, Unknown=3, NotChecked=414, Total=11342 [2022-11-02 21:11:05,686 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 113 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 385 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 1383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 385 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:05,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 172 Invalid, 1383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [385 Valid, 896 Invalid, 0 Unknown, 102 Unchecked, 2.2s Time] [2022-11-02 21:11:05,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-02 21:11:05,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 67. [2022-11-02 21:11:05,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.1666666666666667) internal successors, (77), 66 states have internal predecessors, (77), 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:11:05,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2022-11-02 21:11:05,718 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 36 [2022-11-02 21:11:05,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:05,719 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 77 transitions. [2022-11-02 21:11:05,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 66 states have internal predecessors, (97), 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:11:05,719 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2022-11-02 21:11:05,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-02 21:11:05,727 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:05,727 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:11:05,766 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 21:11:05,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:11:05,954 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:11:05,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:05,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1245131882, now seen corresponding path program 6 times [2022-11-02 21:11:05,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:05,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777814291] [2022-11-02 21:11:05,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:05,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:05,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:06,093 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-02 21:11:06,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:06,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777814291] [2022-11-02 21:11:06,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777814291] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:11:06,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239583039] [2022-11-02 21:11:06,093 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-02 21:11:06,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:11:06,094 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:11:06,106 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:11:06,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 21:11:06,310 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-11-02 21:11:06,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:11:06,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-02 21:11:06,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:11:06,398 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-02 21:11:06,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:11:06,473 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-02 21:11:06,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239583039] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:11:06,473 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:11:06,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-11-02 21:11:06,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245728468] [2022-11-02 21:11:06,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:11:06,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 21:11:06,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:06,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 21:11:06,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-11-02 21:11:06,475 INFO L87 Difference]: Start difference. First operand 67 states and 77 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:11:06,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:06,714 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2022-11-02 21:11:06,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 21:11:06,714 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-02 21:11:06,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:06,715 INFO L225 Difference]: With dead ends: 89 [2022-11-02 21:11:06,715 INFO L226 Difference]: Without dead ends: 73 [2022-11-02 21:11:06,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 63 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-11-02 21:11:06,716 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 161 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:06,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 66 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:11:06,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-02 21:11:06,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 43. [2022-11-02 21:11:06,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 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:11:06,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-11-02 21:11:06,735 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 36 [2022-11-02 21:11:06,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:06,735 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-11-02 21:11:06,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:11:06,735 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-11-02 21:11:06,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-02 21:11:06,736 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:06,736 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:11:06,746 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 21:11:06,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:11:06,938 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:11:06,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:06,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1201221586, now seen corresponding path program 7 times [2022-11-02 21:11:06,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:06,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128418049] [2022-11-02 21:11:06,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:06,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:06,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:10,642 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:11:10,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:10,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128418049] [2022-11-02 21:11:10,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128418049] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:11:10,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252541185] [2022-11-02 21:11:10,643 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-02 21:11:10,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:11:10,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:11:10,644 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:11:10,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 21:11:10,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:10,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 87 conjunts are in the unsatisfiable core [2022-11-02 21:11:10,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:11:10,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 21:11:10,765 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 21:11:10,765 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:11:10,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-02 21:11:10,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:10,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-02 21:11:10,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:10,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:10,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-02 21:11:11,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:11,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:11,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 57 [2022-11-02 21:11:11,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:11,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:11,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:11,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 67 [2022-11-02 21:11:11,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:11,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:11,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:11,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 67 [2022-11-02 21:11:11,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:11,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:11,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:11,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:11,732 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:11:11,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2022-11-02 21:11:11,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:11,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:11,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:11,955 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:11:11,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2022-11-02 21:11:12,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:12,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:12,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:12,238 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:11:12,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:12,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2022-11-02 21:11:12,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:12,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:12,578 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:11:12,578 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:11:12,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:12,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 68 [2022-11-02 21:11:12,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:12,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:12,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:12,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:12,882 INFO L356 Elim1Store]: treesize reduction 47, result has 44.7 percent of original size [2022-11-02 21:11:12,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 80 treesize of output 91 [2022-11-02 21:11:13,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:13,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:13,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:13,653 INFO L356 Elim1Store]: treesize reduction 323, result has 25.2 percent of original size [2022-11-02 21:11:13,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 28 case distinctions, treesize of input 122 treesize of output 175 [2022-11-02 21:11:14,441 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:11:14,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 34 [2022-11-02 21:11:14,504 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:11:14,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:11:16,736 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_144| Int)) (or (forall ((v_ArrVal_524 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_144|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_524) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_144|)))) is different from false [2022-11-02 21:11:17,384 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_522 Int) (|v_ULTIMATE.start_main_~i~0#1_144| Int) (v_ArrVal_524 Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_144|)) (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_522) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_144|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_524) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)))) is different from false [2022-11-02 21:11:19,401 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_145| Int)) (or (forall ((v_ArrVal_522 Int) (|v_ULTIMATE.start_main_~i~0#1_144| Int) (v_ArrVal_524 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_145| 1) |v_ULTIMATE.start_main_~i~0#1_144|)) (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_145|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_522) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_144|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_524) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_145|)))) is different from false [2022-11-02 21:11:21,426 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_522 Int) (|v_ULTIMATE.start_main_~i~0#1_145| Int) (|v_ULTIMATE.start_main_~i~0#1_144| Int) (v_ArrVal_524 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_145| 1) |v_ULTIMATE.start_main_~i~0#1_144|)) (= (select (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_145|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_522) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_144|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_524) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_145|)))) is different from false [2022-11-02 21:11:36,236 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_152| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_152|)) (forall ((v_ArrVal_522 Int) (|v_ULTIMATE.start_main_~i~0#1_145| Int) (|v_ULTIMATE.start_main_~i~0#1_144| Int) (v_ArrVal_524 Int) (v_ArrVal_512 Int)) (or (= (select (store (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_152| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_512)))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4))))) (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse2 .cse3 .cse4)))))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_145|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_522) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_144|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_524) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_145| 1) |v_ULTIMATE.start_main_~i~0#1_144|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_145|)))))) is different from false [2022-11-02 21:11:38,285 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_522 Int) (v_ArrVal_510 Int) (|v_ULTIMATE.start_main_~i~0#1_145| Int) (|v_ULTIMATE.start_main_~i~0#1_144| Int) (|v_ULTIMATE.start_main_~i~0#1_152| Int) (v_ArrVal_524 Int) (v_ArrVal_512 Int)) (or (= (select (store (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_510) (+ (* |v_ULTIMATE.start_main_~i~0#1_152| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_512)))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4))))) (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4 (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))))))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_145|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_522) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_144|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_524) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_152|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_145| 1) |v_ULTIMATE.start_main_~i~0#1_144|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_145|)))) is different from false [2022-11-02 21:11:40,343 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_153| Int)) (or (forall ((v_ArrVal_522 Int) (v_ArrVal_510 Int) (|v_ULTIMATE.start_main_~i~0#1_145| Int) (|v_ULTIMATE.start_main_~i~0#1_144| Int) (|v_ULTIMATE.start_main_~i~0#1_152| Int) (v_ArrVal_524 Int) (v_ArrVal_512 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_145| 1) |v_ULTIMATE.start_main_~i~0#1_144|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_153| 1) |v_ULTIMATE.start_main_~i~0#1_152|)) (= (select (store (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_153| 4)) v_ArrVal_510) (+ (* |v_ULTIMATE.start_main_~i~0#1_152| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_512)))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4))))) (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse1 .cse2 .cse3 .cse4)))))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_145|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_522) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_144|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_524) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_145|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_153|)))) is different from false [2022-11-02 21:11:42,437 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_522 Int) (v_ArrVal_510 Int) (|v_ULTIMATE.start_main_~i~0#1_153| Int) (|v_ULTIMATE.start_main_~i~0#1_145| Int) (|v_ULTIMATE.start_main_~i~0#1_144| Int) (|v_ULTIMATE.start_main_~i~0#1_152| Int) (v_ArrVal_524 Int) (v_ArrVal_512 Int)) (or (= (select (store (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_153| 4)) v_ArrVal_510) (+ (* |v_ULTIMATE.start_main_~i~0#1_152| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_512)))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4))))) (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 .cse2 .cse3 (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse4)))))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_145|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_522) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_144|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_524) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_145| 1) |v_ULTIMATE.start_main_~i~0#1_144|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_153| 1) |v_ULTIMATE.start_main_~i~0#1_152|)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_153|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_145|)))) is different from false [2022-11-02 21:11:44,509 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_522 Int) (v_ArrVal_510 Int) (|v_ULTIMATE.start_main_~i~0#1_153| Int) (|v_ULTIMATE.start_main_~i~0#1_145| Int) (|v_ULTIMATE.start_main_~i~0#1_144| Int) (|v_ULTIMATE.start_main_~i~0#1_152| Int) (v_ArrVal_524 Int) (v_ArrVal_512 Int)) (or (= (select (store (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_153| 4)) v_ArrVal_510) (+ (* |v_ULTIMATE.start_main_~i~0#1_152| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_512)))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4))))) (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4 (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))))))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_145|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_522) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_144|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_524) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_153|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_145| 1) |v_ULTIMATE.start_main_~i~0#1_144|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_153| 1) |v_ULTIMATE.start_main_~i~0#1_152|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_145|)))) is different from false [2022-11-02 21:11:53,511 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse7 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse10 (store (select .cse9 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_145| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_144| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_153| Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_153|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_152| Int)) (or (forall ((v_ArrVal_522 Int) (v_ArrVal_510 Int) (v_ArrVal_524 Int) (v_ArrVal_512 Int)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) (select (store (store (let ((.cse5 (store .cse9 |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse10 (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_153| 4)) v_ArrVal_510) (+ (* |v_ULTIMATE.start_main_~i~0#1_152| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_512)))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse0 (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4))))) (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse1 .cse2 .cse3 .cse4)))))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_145|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_522) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_144|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_524) |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_153| 1) |v_ULTIMATE.start_main_~i~0#1_152|)))))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_145| 1) |v_ULTIMATE.start_main_~i~0#1_144|)))) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_145|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_145| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_144| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_153| Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_153|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_152| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_153| 1) |v_ULTIMATE.start_main_~i~0#1_152|)) (forall ((v_ArrVal_522 Int) (v_ArrVal_510 Int) (v_ArrVal_524 Int) (v_ArrVal_512 Int)) (< (select (store (store (let ((.cse16 (store .cse9 |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse10 (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_153| 4)) v_ArrVal_510) (+ (* |v_ULTIMATE.start_main_~i~0#1_152| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_512)))) (let ((.cse17 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse14 (select (select .cse16 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse15 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse13 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse12 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse11 (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse14 .cse15))))) (store (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select (select .cse11 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse12 .cse13 .cse14 .cse15)))))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_145|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_522) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_144|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_524) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 3 |c_ULTIMATE.start_main_~i~0#1|))))))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_145| 1) |v_ULTIMATE.start_main_~i~0#1_144|)))) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_145|))))))) is different from false [2022-11-02 21:11:55,660 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse7 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse10 (store (select .cse9 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_145| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_144| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_145| 1) |v_ULTIMATE.start_main_~i~0#1_144|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_153| Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_153|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_152| Int)) (or (forall ((v_ArrVal_522 Int) (v_ArrVal_510 Int) (v_ArrVal_524 Int) (v_ArrVal_512 Int)) (< (select (store (store (let ((.cse5 (store .cse9 |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse10 (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_153| 4)) v_ArrVal_510) (+ (* |v_ULTIMATE.start_main_~i~0#1_152| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_512)))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse0 (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4))))) (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 .cse2 .cse3 (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse4)))))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_145|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_522) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_144|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_524) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ |c_ULTIMATE.start_main_~i~0#1| 4))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_153| 1) |v_ULTIMATE.start_main_~i~0#1_152|)))))))) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_145|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_145| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_144| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_145| 1) |v_ULTIMATE.start_main_~i~0#1_144|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_153| Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_153|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_152| Int)) (or (forall ((v_ArrVal_522 Int) (v_ArrVal_510 Int) (v_ArrVal_524 Int) (v_ArrVal_512 Int)) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) (select (store (store (let ((.cse16 (store .cse9 |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse10 (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_153| 4)) v_ArrVal_510) (+ (* |v_ULTIMATE.start_main_~i~0#1_152| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_512)))) (let ((.cse17 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse12 (select (select .cse16 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse13 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse15 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse14 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse11 (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse14 .cse15))))) (store (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse12 .cse13 .cse14 (select (select .cse11 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse15)))))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_145|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_522) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_144|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_524) |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_153| 1) |v_ULTIMATE.start_main_~i~0#1_152|)))))))) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_145|))))))) is different from false [2022-11-02 21:11:57,825 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse18 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse18 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) (let ((.cse7 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse10 (store (select .cse9 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_145| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_144| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_153| Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_153|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_152| Int)) (or (forall ((v_ArrVal_522 Int) (v_ArrVal_510 Int) (v_ArrVal_524 Int) (v_ArrVal_512 Int)) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) (select (store (store (let ((.cse5 (store .cse9 |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse10 (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_153| 4)) v_ArrVal_510) (+ (* |v_ULTIMATE.start_main_~i~0#1_152| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_512)))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse0 (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4))))) (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse2 .cse3 .cse4)))))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_145|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_522) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_144|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_524) |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_153| 1) |v_ULTIMATE.start_main_~i~0#1_152|)))))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_145| 1) |v_ULTIMATE.start_main_~i~0#1_144|)))) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_145|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_145| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_144| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_145| 1) |v_ULTIMATE.start_main_~i~0#1_144|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_153| Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_153|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_152| Int)) (or (forall ((v_ArrVal_522 Int) (v_ArrVal_510 Int) (v_ArrVal_524 Int) (v_ArrVal_512 Int)) (< (select (store (store (let ((.cse16 (store .cse9 |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse10 (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_153| 4)) v_ArrVal_510) (+ (* |v_ULTIMATE.start_main_~i~0#1_152| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_512)))) (let ((.cse17 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse12 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse14 (select (select .cse16 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse13 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse15 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse11 (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse14 .cse15))))) (store (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse12 (select (select .cse11 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse13 .cse14 .cse15)))))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_145|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_522) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_144|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_524) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ |c_ULTIMATE.start_main_~i~0#1| 4))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_153| 1) |v_ULTIMATE.start_main_~i~0#1_152|)))))))) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_145|))))))) is different from false [2022-11-02 21:11:59,948 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse18 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse18 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse18 16 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) (let ((.cse7 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse10 (store (select .cse9 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_145| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_144| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_153| Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_153|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_152| Int)) (or (forall ((v_ArrVal_522 Int) (v_ArrVal_510 Int) (v_ArrVal_524 Int) (v_ArrVal_512 Int)) (< (select (store (store (let ((.cse5 (store .cse9 |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse10 (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_153| 4)) v_ArrVal_510) (+ (* |v_ULTIMATE.start_main_~i~0#1_152| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_512)))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse0 (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4))))) (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 .cse2 (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse3 .cse4)))))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_145|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_522) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_144|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_524) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 5 |c_ULTIMATE.start_main_~i~0#1|))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_153| 1) |v_ULTIMATE.start_main_~i~0#1_152|)))))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_145| 1) |v_ULTIMATE.start_main_~i~0#1_144|)))) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_145|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_145| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_144| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_145| 1) |v_ULTIMATE.start_main_~i~0#1_144|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_153| Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_153|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_152| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_153| 1) |v_ULTIMATE.start_main_~i~0#1_152|)) (forall ((v_ArrVal_522 Int) (v_ArrVal_510 Int) (v_ArrVal_524 Int) (v_ArrVal_512 Int)) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) (select (store (store (let ((.cse16 (store .cse9 |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse10 (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_153| 4)) v_ArrVal_510) (+ (* |v_ULTIMATE.start_main_~i~0#1_152| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_512)))) (let ((.cse17 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse13 (select (select .cse16 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse15 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse14 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse12 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse11 (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse14 .cse15))))) (store (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse12 .cse13 (select (select .cse11 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse14 .cse15)))))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_145|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_522) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_144|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_524) |c_ULTIMATE.start_main_~a~0#1.offset|))))))))) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_145|))))))) is different from false [2022-11-02 21:12:02,152 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse18 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse18 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse18 16 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) (let ((.cse7 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse10 (store (select .cse9 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_145| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_144| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_153| Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_153|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_152| Int)) (or (forall ((v_ArrVal_522 Int) (v_ArrVal_510 Int) (v_ArrVal_524 Int) (v_ArrVal_512 Int)) (< (select (store (store (let ((.cse5 (store .cse9 |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse10 (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_153| 4)) v_ArrVal_510) (+ (* |v_ULTIMATE.start_main_~i~0#1_152| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_512)))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse0 (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4))))) (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4 (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))))))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_145|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_522) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_144|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_524) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 5 |c_ULTIMATE.start_main_~i~0#1|))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_153| 1) |v_ULTIMATE.start_main_~i~0#1_152|)))))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_145| 1) |v_ULTIMATE.start_main_~i~0#1_144|)))) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_145|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_145| Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_145|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_144| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_145| 1) |v_ULTIMATE.start_main_~i~0#1_144|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_153| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_152| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_153| 1) |v_ULTIMATE.start_main_~i~0#1_152|)) (forall ((v_ArrVal_522 Int) (v_ArrVal_510 Int) (v_ArrVal_524 Int) (v_ArrVal_512 Int)) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) (select (store (store (let ((.cse16 (store .cse9 |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse10 (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_153| 4)) v_ArrVal_510) (+ (* |v_ULTIMATE.start_main_~i~0#1_152| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_512)))) (let ((.cse17 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse12 (select (select .cse16 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse15 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse14 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse13 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse11 (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse14 .cse15))))) (store (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse12 .cse13 .cse14 .cse15 (select (select .cse11 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))))))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_145|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_522) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_144|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_524) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_153|))))))))))) is different from false [2022-11-02 21:12:02,234 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 25 not checked. [2022-11-02 21:12:02,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252541185] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:12:02,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:12:02,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28, 30] total 74 [2022-11-02 21:12:02,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397420761] [2022-11-02 21:12:02,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:12:02,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-11-02 21:12:02,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:12:02,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-11-02 21:12:02,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=3222, Unknown=19, NotChecked=1806, Total=5402 [2022-11-02 21:12:02,238 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 74 states, 74 states have (on average 1.364864864864865) internal successors, (101), 74 states have internal predecessors, (101), 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:12:12,651 WARN L234 SmtUtils]: Spent 10.13s on a formula simplification. DAG size of input: 129 DAG size of output: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 21:12:23,064 WARN L234 SmtUtils]: Spent 10.11s on a formula simplification. DAG size of input: 131 DAG size of output: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 21:12:25,247 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= (select .cse0 0) 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_153| Int)) (or (forall ((v_ArrVal_522 Int) (v_ArrVal_510 Int) (|v_ULTIMATE.start_main_~i~0#1_145| Int) (|v_ULTIMATE.start_main_~i~0#1_144| Int) (|v_ULTIMATE.start_main_~i~0#1_152| Int) (v_ArrVal_524 Int) (v_ArrVal_512 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_145| 1) |v_ULTIMATE.start_main_~i~0#1_144|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_153| 1) |v_ULTIMATE.start_main_~i~0#1_152|)) (= (select (store (store (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse8 (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_153| 4)) v_ArrVal_510) (+ (* |v_ULTIMATE.start_main_~i~0#1_152| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_512)))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse5))))) (store (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select (select .cse1 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse2 .cse3 .cse4 .cse5)))))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_145|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_522) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_144|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_524) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_145|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_153|)))) (= (select .cse0 8) 1) (= (select .cse0 (+ (* c_~N~0 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 8))) 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (<= 3 c_~N~0) (= (select .cse8 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|)) 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (<= c_~N~0 3) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-11-02 21:12:27,363 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (* c_~N~0 8)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= (select .cse0 0) 1) (or (<= (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset| 1) .cse1) (and (<= c_~N~0 .cse2) (<= .cse2 c_~N~0) (= (select .cse3 0) 1))) (= .cse2 0) (= (select .cse0 8) 1) (= (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (- 8))) 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (<= 3 c_~N~0) (= (select .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (<= c_~N~0 3) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_152| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_152|)) (forall ((v_ArrVal_522 Int) (|v_ULTIMATE.start_main_~i~0#1_145| Int) (|v_ULTIMATE.start_main_~i~0#1_144| Int) (v_ArrVal_524 Int) (v_ArrVal_512 Int)) (or (= (select (store (store (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse3 (+ (* |v_ULTIMATE.start_main_~i~0#1_152| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_512)))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse6 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse5 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse4 (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6 .cse7 .cse8))))) (store (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse5 (select (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse6 .cse7 .cse8)))))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_145|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_522) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_144|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_524) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_145| 1) |v_ULTIMATE.start_main_~i~0#1_144|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_145|)))))))) is different from false [2022-11-02 21:12:29,700 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse11 (select .cse5 (+ (* c_~N~0 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 8)))) (.cse13 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse9 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse1 (not (= .cse13 8))) (.cse2 (or (= .cse11 1) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse4 (= (select .cse8 0) 1)) (.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (select .cse5 .cse13)) (.cse6 (+ c_~N~0 1))) (and (<= c_~N~0 .cse0) (or .cse1 (let ((.cse3 (+ .cse0 1))) (and .cse2 (<= c_~N~0 .cse3) .cse4 (<= .cse3 c_~N~0)))) (= (select .cse5 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (<= .cse6 .cse7) (forall ((|v_ULTIMATE.start_main_~i~0#1_145| Int)) (or (forall ((v_ArrVal_522 Int) (|v_ULTIMATE.start_main_~i~0#1_144| Int) (v_ArrVal_524 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_145| 1) |v_ULTIMATE.start_main_~i~0#1_144|)) (= (select (store (store .cse5 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_145|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_522) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_144|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_524) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse6))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_145|)))) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (<= 3 c_~N~0) (= (select .cse8 (+ .cse9 |c_ULTIMATE.start_main_~b~0#1.offset|)) 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (<= .cse0 c_~N~0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse10 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (and (= .cse7 (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) .cse9) .cse10)) (= (+ 2 .cse11) .cse10) (= .cse7 (+ .cse10 1)) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= .cse10 3) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))))) (or .cse1 (let ((.cse12 (+ .cse0 2))) (and (= .cse7 1) (<= .cse12 c_~N~0) .cse2 (<= c_~N~0 .cse12) .cse4))) (<= c_~N~0 3) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= .cse7 .cse6) (<= |c_ULTIMATE.start_main_~i~0#1| 1))))) is different from false [2022-11-02 21:12:31,873 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse5 (* 8 |c_ULTIMATE.start_main_~i~0#1|)) (.cse1 (+ c_~N~0 1)) (.cse7 (select .cse0 0))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_144| Int)) (or (forall ((v_ArrVal_524 Int)) (= (select (store .cse0 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_144|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_524) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse1)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_144|)))) (let ((.cse2 (* c_~N~0 8)) (.cse4 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) 1) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse3 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (and (= (+ 2 (select .cse0 (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| (- 8)))) .cse3) (= .cse3 3) (= (+ .cse3 1) .cse4)))) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))))) (and (= (+ .cse5 8) .cse2) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse6 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) 1) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= .cse6 3) (= (+ .cse6 1) .cse4) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (<= .cse7 .cse1) (<= 3 c_~N~0) (or (= (select .cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (= .cse5 8)) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (<= c_~N~0 3) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= .cse1 .cse7) (<= (+ (div (- |c_ULTIMATE.start_main_~a~0#1.offset|) 8) 1) |c_ULTIMATE.start_main_~i~0#1|)))) is different from false [2022-11-02 21:12:32,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:12:32,322 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2022-11-02 21:12:32,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-02 21:12:32,322 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 74 states have (on average 1.364864864864865) internal successors, (101), 74 states have internal predecessors, (101), 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 40 [2022-11-02 21:12:32,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:12:32,323 INFO L225 Difference]: With dead ends: 83 [2022-11-02 21:12:32,323 INFO L226 Difference]: Without dead ends: 81 [2022-11-02 21:12:32,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 32 SyntacticMatches, 14 SemanticMatches, 83 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 1907 ImplicationChecksByTransitivity, 78.7s TimeCoverageRelationStatistics Valid=432, Invalid=4039, Unknown=23, NotChecked=2646, Total=7140 [2022-11-02 21:12:32,326 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 16 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 1571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1115 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:12:32,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 253 Invalid, 1571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 418 Invalid, 0 Unknown, 1115 Unchecked, 0.4s Time] [2022-11-02 21:12:32,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-02 21:12:32,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2022-11-02 21:12:32,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.1369863013698631) internal successors, (83), 73 states have internal predecessors, (83), 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:12:32,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2022-11-02 21:12:32,346 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 40 [2022-11-02 21:12:32,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:12:32,347 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2022-11-02 21:12:32,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 1.364864864864865) internal successors, (101), 74 states have internal predecessors, (101), 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:12:32,347 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2022-11-02 21:12:32,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-02 21:12:32,348 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:12:32,348 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:12:32,375 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-02 21:12:32,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-02 21:12:32,558 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:12:32,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:12:32,559 INFO L85 PathProgramCache]: Analyzing trace with hash 524150480, now seen corresponding path program 8 times [2022-11-02 21:12:32,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:12:32,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429659955] [2022-11-02 21:12:32,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:12:32,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:12:32,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:32,733 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-02 21:12:32,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:12:32,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429659955] [2022-11-02 21:12:32,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429659955] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:12:32,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077575633] [2022-11-02 21:12:32,734 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:12:32,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:12:32,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:12:32,737 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:12:32,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-02 21:12:32,848 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 21:12:32,849 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:12:32,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-02 21:12:32,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:12:32,993 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-02 21:12:32,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:12:33,106 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-02 21:12:33,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077575633] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:12:33,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:12:33,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-11-02 21:12:33,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616847049] [2022-11-02 21:12:33,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:12:33,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-02 21:12:33,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:12:33,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-02 21:12:33,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-11-02 21:12:33,108 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:12:33,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:12:33,433 INFO L93 Difference]: Finished difference Result 184 states and 203 transitions. [2022-11-02 21:12:33,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 21:12:33,434 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-11-02 21:12:33,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:12:33,434 INFO L225 Difference]: With dead ends: 184 [2022-11-02 21:12:33,435 INFO L226 Difference]: Without dead ends: 141 [2022-11-02 21:12:33,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 70 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2022-11-02 21:12:33,436 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 191 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:12:33,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 83 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:12:33,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-02 21:12:33,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 105. [2022-11-02 21:12:33,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.1057692307692308) internal successors, (115), 104 states have internal predecessors, (115), 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:12:33,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2022-11-02 21:12:33,460 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 42 [2022-11-02 21:12:33,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:12:33,460 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2022-11-02 21:12:33,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:12:33,460 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2022-11-02 21:12:33,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-02 21:12:33,461 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:12:33,461 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:12:33,507 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-02 21:12:33,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-02 21:12:33,678 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:12:33,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:12:33,679 INFO L85 PathProgramCache]: Analyzing trace with hash -308361392, now seen corresponding path program 9 times [2022-11-02 21:12:33,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:12:33,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879724232] [2022-11-02 21:12:33,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:12:33,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:12:33,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:33,853 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-02 21:12:33,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:12:33,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879724232] [2022-11-02 21:12:33,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879724232] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:12:33,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936955234] [2022-11-02 21:12:33,854 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 21:12:33,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:12:33,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:12:33,856 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:12:33,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-02 21:12:34,064 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-02 21:12:34,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:12:34,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-02 21:12:34,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:12:34,182 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-02 21:12:34,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:12:34,284 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-02 21:12:34,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936955234] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:12:34,285 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:12:34,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-11-02 21:12:34,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654330040] [2022-11-02 21:12:34,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:12:34,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-02 21:12:34,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:12:34,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-02 21:12:34,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-11-02 21:12:34,286 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:12:34,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:12:34,799 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2022-11-02 21:12:34,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 21:12:34,800 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-11-02 21:12:34,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:12:34,801 INFO L225 Difference]: With dead ends: 146 [2022-11-02 21:12:34,801 INFO L226 Difference]: Without dead ends: 117 [2022-11-02 21:12:34,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 70 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-11-02 21:12:34,802 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 123 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:12:34,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 185 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 21:12:34,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-02 21:12:34,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 86. [2022-11-02 21:12:34,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.0823529411764705) internal successors, (92), 85 states have internal predecessors, (92), 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:12:34,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2022-11-02 21:12:34,822 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 42 [2022-11-02 21:12:34,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:12:34,822 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2022-11-02 21:12:34,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:12:34,823 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2022-11-02 21:12:34,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-02 21:12:34,823 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:12:34,824 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:12:34,848 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-02 21:12:35,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-02 21:12:35,030 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:12:35,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:12:35,031 INFO L85 PathProgramCache]: Analyzing trace with hash 2112995272, now seen corresponding path program 2 times [2022-11-02 21:12:35,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:12:35,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399665394] [2022-11-02 21:12:35,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:12:35,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:12:35,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:37,475 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 21:12:37,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:12:37,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399665394] [2022-11-02 21:12:37,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399665394] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:12:37,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933518861] [2022-11-02 21:12:37,476 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:12:37,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:12:37,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:12:37,477 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:12:37,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48a5bf45-a4b9-43b8-a084-ce72eddc6af3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-02 21:12:37,583 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 21:12:37,583 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:12:37,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-02 21:12:37,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:12:37,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:12:37,602 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 21:12:37,603 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 28 treesize of output 24 [2022-11-02 21:12:37,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-02 21:12:37,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:12:37,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-02 21:12:38,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:12:38,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:12:38,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:12:38,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-02 21:12:38,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:12:38,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-02 21:12:38,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:12:38,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-02 21:12:38,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:12:38,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:12:38,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-02 21:12:38,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:12:38,438 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:12:38,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:12:38,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2022-11-02 21:12:38,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:12:38,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:12:38,656 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:12:38,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 64 [2022-11-02 21:12:38,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:12:38,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:12:38,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:12:38,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:12:38,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 67 [2022-11-02 21:12:39,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:12:39,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 35 [2022-11-02 21:12:39,758 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-02 21:12:39,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:12:55,302 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_215| Int) (v_ArrVal_761 Int)) (or (let ((.cse0 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_215|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_761))) (= (select .cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_215|)))) is different from false [2022-11-02 21:12:56,265 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_215| Int) (v_ArrVal_761 Int)) (or (let ((.cse0 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 4 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_215|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_761))) (= (select .cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_215|)))) is different from false [2022-11-02 21:12:58,102 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_215| Int) (v_ArrVal_761 Int)) (or (not (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_215|)) (let ((.cse0 (store (let ((.cse2 (* 8 |c_ULTIMATE.start_main_~i~0#1|)) (.cse4 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse4 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) (store .cse1 (+ .cse2 8 |c_ULTIMATE.start_main_~a~0#1.offset|) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse1))) (+ (select (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse4 4 |c_ULTIMATE.start_main_~b~0#1.offset|))))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_215|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_761))) (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) is different from false [2022-11-02 21:13:00,135 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_215| Int) (v_ArrVal_761 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_756 Int)) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_215|)) (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_756)))) (let ((.cse2 (store (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_756 (select (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))))) (store .cse2 .cse1 (let ((.cse3 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse2))) (+ (select (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_215|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_761))) (= (select .cse0 .cse1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) is different from false [2022-11-02 21:13:00,158 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:13:00,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 231 treesize of output 190 [2022-11-02 21:13:00,175 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_215| Int) (v_ArrVal_761 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_215|)) (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse2 (store (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))))) (store .cse2 .cse1 (let ((.cse3 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse2))) (+ (select (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_215|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_761))) (= (select .cse0 .cse1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) is different from false [2022-11-02 21:13:00,251 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_751 Int) (|v_ULTIMATE.start_main_~i~0#1_215| Int) (v_ArrVal_761 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (or (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (store (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_751)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse2 (store (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))))) (store .cse2 .cse1 (let ((.cse3 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse2))) (+ (select (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_215|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_761))) (= (select .cse0 .cse1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_215|)))) is different from false [2022-11-02 21:13:00,276 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_223| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_223|)) (forall ((v_ArrVal_751 Int) (|v_ULTIMATE.start_main_~i~0#1_215| Int) (v_ArrVal_761 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_215|)) (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (store (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_223| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_751)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse2 (store (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))))) (store .cse2 .cse1 (let ((.cse3 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse2))) (+ (select (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_215|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_761))) (= (select .cse0 .cse1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) is different from false [2022-11-02 21:13:00,311 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_223| Int) (v_ArrVal_751 Int) (|v_ULTIMATE.start_main_~i~0#1_215| Int) (v_ArrVal_761 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_223|)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_215|)) (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (store (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_223| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_751)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse2 (store (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))))) (store .cse2 .cse1 (let ((.cse3 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse2))) (+ (select (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_215|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_761))) (= (select .cse0 .cse1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) is different from false [2022-11-02 21:13:00,340 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_223| Int) (v_ArrVal_751 Int) (|v_ULTIMATE.start_main_~i~0#1_215| Int) (v_ArrVal_761 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (or (not (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_223|)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_215|)) (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (store (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 4 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_223| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_751)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse2 (store (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))))) (store .cse2 .cse1 (let ((.cse3 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse2))) (+ (select (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (select (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_215|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_761))) (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse0 .cse1)))))) is different from false [2022-11-02 21:13:00,388 INFO L356 Elim1Store]: treesize reduction 63, result has 37.6 percent of original size [2022-11-02 21:13:00,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 627 treesize of output 233 [2022-11-02 21:13:00,427 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:13:00,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 6671 treesize of output 6099 [2022-11-02 21:13:00,556 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:13:00,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 7910 treesize of output 6712