./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/sina5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/sina5.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa --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 503513a726b63dcf7252b591818901fbaab844b1443a8550e123aa98a06238f6 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 19:28:57,783 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 19:28:57,786 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 19:28:57,810 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 19:28:57,810 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 19:28:57,811 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 19:28:57,813 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 19:28:57,814 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 19:28:57,816 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 19:28:57,817 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 19:28:57,818 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 19:28:57,819 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 19:28:57,819 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 19:28:57,820 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 19:28:57,822 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 19:28:57,823 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 19:28:57,824 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 19:28:57,824 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 19:28:57,826 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 19:28:57,828 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 19:28:57,829 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 19:28:57,831 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 19:28:57,832 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 19:28:57,833 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 19:28:57,835 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 19:28:57,836 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 19:28:57,836 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 19:28:57,837 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 19:28:57,837 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 19:28:57,838 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 19:28:57,839 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 19:28:57,839 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 19:28:57,840 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 19:28:57,841 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 19:28:57,842 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 19:28:57,842 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 19:28:57,842 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 19:28:57,842 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 19:28:57,843 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 19:28:57,843 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 19:28:57,844 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 19:28:57,845 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-06 19:28:57,870 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 19:28:57,871 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 19:28:57,871 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 19:28:57,871 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 19:28:57,872 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 19:28:57,872 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 19:28:57,873 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 19:28:57,873 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 19:28:57,873 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 19:28:57,873 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 19:28:57,873 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 19:28:57,874 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 19:28:57,874 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 19:28:57,874 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 19:28:57,874 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 19:28:57,874 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 19:28:57,875 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 19:28:57,875 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 19:28:57,880 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 19:28:57,881 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 19:28:57,881 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 19:28:57,881 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 19:28:57,881 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 19:28:57,881 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 19:28:57,881 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 19:28:57,882 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 19:28:57,882 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 19:28:57,882 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 19:28:57,882 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 19:28:57,882 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 19:28:57,882 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 19:28:57,882 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 19:28:57,882 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 19:28:57,882 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 19:28:57,883 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_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/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_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa 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 -> 503513a726b63dcf7252b591818901fbaab844b1443a8550e123aa98a06238f6 [2021-12-06 19:28:58,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 19:28:58,063 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 19:28:58,066 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 19:28:58,067 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 19:28:58,067 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 19:28:58,068 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/array-fpi/sina5.c [2021-12-06 19:28:58,110 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/data/008477b02/c9900a3ebe43468a8b49b517aad13a42/FLAGd0e6b06db [2021-12-06 19:28:58,481 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 19:28:58,481 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/sv-benchmarks/c/array-fpi/sina5.c [2021-12-06 19:28:58,486 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/data/008477b02/c9900a3ebe43468a8b49b517aad13a42/FLAGd0e6b06db [2021-12-06 19:28:58,502 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/data/008477b02/c9900a3ebe43468a8b49b517aad13a42 [2021-12-06 19:28:58,504 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 19:28:58,505 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 19:28:58,506 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 19:28:58,506 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 19:28:58,508 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 19:28:58,509 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:28:58" (1/1) ... [2021-12-06 19:28:58,509 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4956094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:28:58, skipping insertion in model container [2021-12-06 19:28:58,510 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:28:58" (1/1) ... [2021-12-06 19:28:58,514 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 19:28:58,530 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 19:28:58,630 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_0198bc36-85f9-4c78-a74f-c9776886d4b0/sv-benchmarks/c/array-fpi/sina5.c[588,601] [2021-12-06 19:28:58,645 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 19:28:58,651 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 19:28:58,660 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_0198bc36-85f9-4c78-a74f-c9776886d4b0/sv-benchmarks/c/array-fpi/sina5.c[588,601] [2021-12-06 19:28:58,667 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 19:28:58,677 INFO L208 MainTranslator]: Completed translation [2021-12-06 19:28:58,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:28:58 WrapperNode [2021-12-06 19:28:58,677 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 19:28:58,678 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 19:28:58,678 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 19:28:58,678 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 19:28:58,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:28:58" (1/1) ... [2021-12-06 19:28:58,689 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:28:58" (1/1) ... [2021-12-06 19:28:58,705 INFO L137 Inliner]: procedures = 17, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 109 [2021-12-06 19:28:58,706 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 19:28:58,706 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 19:28:58,706 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 19:28:58,706 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 19:28:58,713 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:28:58" (1/1) ... [2021-12-06 19:28:58,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:28:58" (1/1) ... [2021-12-06 19:28:58,715 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:28:58" (1/1) ... [2021-12-06 19:28:58,715 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:28:58" (1/1) ... [2021-12-06 19:28:58,720 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:28:58" (1/1) ... [2021-12-06 19:28:58,724 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:28:58" (1/1) ... [2021-12-06 19:28:58,725 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:28:58" (1/1) ... [2021-12-06 19:28:58,727 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 19:28:58,727 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 19:28:58,727 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 19:28:58,728 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 19:28:58,728 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:28:58" (1/1) ... [2021-12-06 19:28:58,736 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 19:28:58,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:28:58,754 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 19:28:58,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 19:28:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 19:28:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 19:28:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-06 19:28:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-06 19:28:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-06 19:28:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 19:28:58,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 19:28:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-06 19:28:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-06 19:28:58,832 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 19:28:58,833 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 19:28:58,940 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 19:28:58,944 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 19:28:58,944 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-06 19:28:58,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:28:58 BoogieIcfgContainer [2021-12-06 19:28:58,946 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 19:28:58,947 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 19:28:58,947 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 19:28:58,950 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 19:28:58,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:28:58" (1/3) ... [2021-12-06 19:28:58,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fbe8ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:28:58, skipping insertion in model container [2021-12-06 19:28:58,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:28:58" (2/3) ... [2021-12-06 19:28:58,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fbe8ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:28:58, skipping insertion in model container [2021-12-06 19:28:58,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:28:58" (3/3) ... [2021-12-06 19:28:58,952 INFO L111 eAbstractionObserver]: Analyzing ICFG sina5.c [2021-12-06 19:28:58,956 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 19:28:58,957 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-06 19:28:58,991 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 19:28:58,997 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-06 19:28:58,997 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-06 19:28:59,008 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 29 states have internal predecessors, (44), 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) [2021-12-06 19:28:59,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-06 19:28:59,012 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:28:59,013 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:28:59,013 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:28:59,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:28:59,017 INFO L85 PathProgramCache]: Analyzing trace with hash -635308358, now seen corresponding path program 1 times [2021-12-06 19:28:59,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:28:59,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189068924] [2021-12-06 19:28:59,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:28:59,026 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:28:59,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:28:59,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:28:59,135 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:28:59,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189068924] [2021-12-06 19:28:59,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189068924] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:28:59,136 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:28:59,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 19:28:59,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065609376] [2021-12-06 19:28:59,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:28:59,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-06 19:28:59,141 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:28:59,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-06 19:28:59,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-06 19:28:59,165 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 29 states have internal predecessors, (44), 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 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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) [2021-12-06 19:28:59,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:28:59,186 INFO L93 Difference]: Finished difference Result 56 states and 82 transitions. [2021-12-06 19:28:59,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-06 19:28:59,188 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-06 19:28:59,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:28:59,196 INFO L225 Difference]: With dead ends: 56 [2021-12-06 19:28:59,196 INFO L226 Difference]: Without dead ends: 26 [2021-12-06 19:28:59,199 INFO L932 BasicCegarLoop]: 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 [2021-12-06 19:28:59,203 INFO L933 BasicCegarLoop]: 36 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, 36 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 [2021-12-06 19:28:59,204 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:28:59,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-12-06 19:28:59,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-12-06 19:28:59,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:28:59,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2021-12-06 19:28:59,237 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 18 [2021-12-06 19:28:59,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:28:59,237 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2021-12-06 19:28:59,237 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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) [2021-12-06 19:28:59,238 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2021-12-06 19:28:59,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-06 19:28:59,238 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:28:59,239 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:28:59,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 19:28:59,239 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:28:59,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:28:59,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1344199344, now seen corresponding path program 1 times [2021-12-06 19:28:59,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:28:59,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544326239] [2021-12-06 19:28:59,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:28:59,241 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:28:59,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:28:59,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:28:59,326 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:28:59,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544326239] [2021-12-06 19:28:59,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544326239] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:28:59,327 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:28:59,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 19:28:59,327 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431047855] [2021-12-06 19:28:59,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:28:59,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 19:28:59,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:28:59,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 19:28:59,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-06 19:28:59,330 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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) [2021-12-06 19:28:59,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:28:59,393 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2021-12-06 19:28:59,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 19:28:59,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-06 19:28:59,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:28:59,394 INFO L225 Difference]: With dead ends: 61 [2021-12-06 19:28:59,394 INFO L226 Difference]: Without dead ends: 42 [2021-12-06 19:28:59,395 INFO L932 BasicCegarLoop]: 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 [2021-12-06 19:28:59,396 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 47 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:28:59,396 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 18 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:28:59,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-12-06 19:28:59,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 31. [2021-12-06 19:28:59,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2) internal successors, (36), 30 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) [2021-12-06 19:28:59,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2021-12-06 19:28:59,402 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 18 [2021-12-06 19:28:59,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:28:59,402 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2021-12-06 19:28:59,402 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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) [2021-12-06 19:28:59,403 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2021-12-06 19:28:59,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-06 19:28:59,403 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:28:59,403 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:28:59,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 19:28:59,404 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:28:59,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:28:59,404 INFO L85 PathProgramCache]: Analyzing trace with hash -933126362, now seen corresponding path program 1 times [2021-12-06 19:28:59,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:28:59,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999227164] [2021-12-06 19:28:59,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:28:59,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:28:59,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:29:00,297 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:29:00,297 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:29:00,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999227164] [2021-12-06 19:29:00,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999227164] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:29:00,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786184300] [2021-12-06 19:29:00,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:29:00,298 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:29:00,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:29:00,299 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:29:00,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-06 19:29:00,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:29:00,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 59 conjunts are in the unsatisfiable core [2021-12-06 19:29:00,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:29:00,412 INFO L388 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 [2021-12-06 19:29:00,422 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-06 19:29:00,422 INFO L388 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 [2021-12-06 19:29:00,469 INFO L388 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 [2021-12-06 19:29:00,631 INFO L388 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 [2021-12-06 19:29:00,787 INFO L388 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 [2021-12-06 19:29:00,933 INFO L388 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 [2021-12-06 19:29:01,113 INFO L388 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 43 treesize of output 33 [2021-12-06 19:29:01,328 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:29:01,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:29:02,018 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:29:02,018 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:29:02,019 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:29:02,035 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:29:02,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786184300] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:29:02,036 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:29:02,036 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 40 [2021-12-06 19:29:02,036 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336413883] [2021-12-06 19:29:02,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:29:02,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-12-06 19:29:02,040 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:29:02,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-12-06 19:29:02,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1353, Unknown=0, NotChecked=0, Total=1560 [2021-12-06 19:29:02,043 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 40 states, 40 states have (on average 1.75) internal successors, (70), 40 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:29:02,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:29:02,587 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2021-12-06 19:29:02,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-06 19:29:02,588 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.75) internal successors, (70), 40 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-06 19:29:02,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:29:02,589 INFO L225 Difference]: With dead ends: 64 [2021-12-06 19:29:02,589 INFO L226 Difference]: Without dead ends: 62 [2021-12-06 19:29:02,590 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 31 SyntacticMatches, 9 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 793 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=257, Invalid=1549, Unknown=0, NotChecked=0, Total=1806 [2021-12-06 19:29:02,592 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 43 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 19:29:02,592 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 158 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 415 Invalid, 0 Unknown, 54 Unchecked, 0.4s Time] [2021-12-06 19:29:02,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-12-06 19:29:02,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2021-12-06 19:29:02,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 51 states have internal predecessors, (62), 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) [2021-12-06 19:29:02,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2021-12-06 19:29:02,602 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 28 [2021-12-06 19:29:02,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:29:02,603 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2021-12-06 19:29:02,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.75) internal successors, (70), 40 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:29:02,603 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2021-12-06 19:29:02,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-06 19:29:02,604 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:29:02,604 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:29:02,625 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-06 19:29:02,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:29:02,807 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:29:02,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:29:02,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1642466588, now seen corresponding path program 2 times [2021-12-06 19:29:02,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:29:02,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277526467] [2021-12-06 19:29:02,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:29:02,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:29:02,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:29:02,896 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-06 19:29:02,897 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:29:02,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277526467] [2021-12-06 19:29:02,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277526467] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:29:02,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233388022] [2021-12-06 19:29:02,897 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 19:29:02,897 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:29:02,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:29:02,898 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:29:02,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-06 19:29:02,947 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 19:29:02,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 19:29:02,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 19:29:02,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:29:03,001 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-06 19:29:03,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:29:03,037 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-06 19:29:03,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233388022] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:29:03,038 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:29:03,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-06 19:29:03,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423283211] [2021-12-06 19:29:03,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:29:03,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 19:29:03,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:29:03,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 19:29:03,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-06 19:29:03,039 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:29:03,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:29:03,139 INFO L93 Difference]: Finished difference Result 134 states and 158 transitions. [2021-12-06 19:29:03,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 19:29:03,139 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-06 19:29:03,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:29:03,140 INFO L225 Difference]: With dead ends: 134 [2021-12-06 19:29:03,140 INFO L226 Difference]: Without dead ends: 78 [2021-12-06 19:29:03,140 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-12-06 19:29:03,141 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 87 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 19:29:03,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 53 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 19:29:03,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-12-06 19:29:03,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 56. [2021-12-06 19:29:03,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 55 states have internal predecessors, (65), 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) [2021-12-06 19:29:03,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2021-12-06 19:29:03,149 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 30 [2021-12-06 19:29:03,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:29:03,149 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2021-12-06 19:29:03,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:29:03,150 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2021-12-06 19:29:03,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-06 19:29:03,151 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:29:03,151 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:29:03,170 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-06 19:29:03,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:29:03,352 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:29:03,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:29:03,353 INFO L85 PathProgramCache]: Analyzing trace with hash -396360796, now seen corresponding path program 3 times [2021-12-06 19:29:03,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:29:03,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198229885] [2021-12-06 19:29:03,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:29:03,353 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:29:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:29:03,412 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-06 19:29:03,412 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:29:03,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198229885] [2021-12-06 19:29:03,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198229885] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:29:03,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717695645] [2021-12-06 19:29:03,413 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-06 19:29:03,413 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:29:03,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:29:03,413 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:29:03,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-06 19:29:03,464 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-06 19:29:03,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 19:29:03,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 19:29:03,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:29:03,512 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-06 19:29:03,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:29:03,545 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-06 19:29:03,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717695645] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:29:03,545 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:29:03,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-06 19:29:03,545 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914747936] [2021-12-06 19:29:03,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:29:03,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 19:29:03,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:29:03,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 19:29:03,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-06 19:29:03,546 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:29:03,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:29:03,632 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2021-12-06 19:29:03,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 19:29:03,633 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-06 19:29:03,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:29:03,633 INFO L225 Difference]: With dead ends: 74 [2021-12-06 19:29:03,633 INFO L226 Difference]: Without dead ends: 57 [2021-12-06 19:29:03,634 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-12-06 19:29:03,635 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 114 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 19:29:03,635 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 43 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 19:29:03,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-12-06 19:29:03,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2021-12-06 19:29:03,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.15) internal successors, (46), 40 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:29:03,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2021-12-06 19:29:03,641 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 30 [2021-12-06 19:29:03,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:29:03,642 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2021-12-06 19:29:03,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:29:03,642 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2021-12-06 19:29:03,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-06 19:29:03,643 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:29:03,643 INFO L514 BasicCegarLoop]: trace histogram [2, 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] [2021-12-06 19:29:03,665 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-06 19:29:03,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:29:03,848 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:29:03,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:29:03,850 INFO L85 PathProgramCache]: Analyzing trace with hash 389318684, now seen corresponding path program 4 times [2021-12-06 19:29:03,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:29:03,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572404344] [2021-12-06 19:29:03,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:29:03,852 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:29:03,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:29:05,349 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:29:05,350 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:29:05,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572404344] [2021-12-06 19:29:05,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572404344] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:29:05,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039206312] [2021-12-06 19:29:05,350 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-06 19:29:05,350 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:29:05,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:29:05,351 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:29:05,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-06 19:29:05,395 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-06 19:29:05,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 19:29:05,397 WARN L261 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 80 conjunts are in the unsatisfiable core [2021-12-06 19:29:05,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:29:05,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:29:05,430 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2021-12-06 19:29:05,442 INFO L388 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 [2021-12-06 19:29:05,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:29:05,505 INFO L388 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 [2021-12-06 19:29:05,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:29:05,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:29:05,614 INFO L388 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 30 treesize of output 32 [2021-12-06 19:29:05,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:29:05,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:29:05,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:29:05,840 INFO L388 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 [2021-12-06 19:29:05,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:29:05,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:29:05,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:29:05,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:29:05,985 INFO L388 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 [2021-12-06 19:29:06,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:29:06,201 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:29:06,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:29:06,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:29:06,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:29:06,204 INFO L388 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 [2021-12-06 19:29:06,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:29:06,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:29:06,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:29:06,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:29:06,374 INFO L388 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 [2021-12-06 19:29:06,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:29:06,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:29:06,571 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:29:06,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:29:06,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:29:06,573 INFO L388 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 73 treesize of output 63 [2021-12-06 19:29:06,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:29:06,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:29:06,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:29:06,751 INFO L388 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 65 treesize of output 57 [2021-12-06 19:29:06,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:29:06,982 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:29:06,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:29:06,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:29:06,985 INFO L388 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 73 treesize of output 61 [2021-12-06 19:29:07,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:29:07,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:29:07,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:29:07,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:29:07,242 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:29:07,254 INFO L354 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2021-12-06 19:29:07,254 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 74 [2021-12-06 19:29:07,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:29:07,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:29:07,528 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 19:29:07,528 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 61 treesize of output 41 [2021-12-06 19:29:07,566 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:29:07,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:29:09,739 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_81| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_81| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((v_ArrVal_257 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_81| 8)) v_ArrVal_257) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (* 2 c_~N~0) 1))))) is different from false [2021-12-06 19:29:32,037 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-06 19:29:32,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039206312] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:29:32,037 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:29:32,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 26, 26] total 77 [2021-12-06 19:29:32,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495739978] [2021-12-06 19:29:32,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:29:32,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2021-12-06 19:29:32,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:29:32,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2021-12-06 19:29:32,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=459, Invalid=5228, Unknown=17, NotChecked=148, Total=5852 [2021-12-06 19:29:32,041 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 77 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 77 states have internal predecessors, (103), 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) [2021-12-06 19:29:34,759 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 8))) (+ (* 2 c_~N~0) 1)) (= (select .cse0 (+ |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|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_81| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_81| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((v_ArrVal_257 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_81| 8)) v_ArrVal_257) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (* 2 c_~N~0) 1))))) (< 1 c_~N~0) (<= c_~N~0 2) (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 ((.cse1 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (and (= .cse1 4) (= (select .cse2 0) 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 8))) (+ .cse1 1)) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse1 (+ 3 (select .cse2 8))) (< (+ |ULTIMATE.start_main_~b~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|)))))) is different from false [2021-12-06 19:29:36,881 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 5) (forall ((|v_ULTIMATE.start_main_~i~0#1_81| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_81| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((v_ArrVal_257 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_81| 8)) v_ArrVal_257) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (* 2 c_~N~0) 1))))) (< 1 c_~N~0) (<= c_~N~0 2) (<= |c_ULTIMATE.start_main_~i~0#1| 1) (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 ((.cse1 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 4) (= (select .cse1 0) 1) (= (select .cse1 8) 1) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|) (< (+ |ULTIMATE.start_main_~b~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|)))) (= (+ (* 2 c_~N~0) 1) (select .cse0 0)))) is different from false [2021-12-06 19:29:37,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:29:37,032 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2021-12-06 19:29:37,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-12-06 19:29:37,033 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 77 states have internal predecessors, (103), 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 38 [2021-12-06 19:29:37,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:29:37,034 INFO L225 Difference]: With dead ends: 83 [2021-12-06 19:29:37,034 INFO L226 Difference]: Without dead ends: 81 [2021-12-06 19:29:37,036 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2470 ImplicationChecksByTransitivity, 30.2s TimeCoverageRelationStatistics Valid=562, Invalid=6237, Unknown=19, NotChecked=492, Total=7310 [2021-12-06 19:29:37,036 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 25 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 620 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 19:29:37,037 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 233 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 373 Invalid, 0 Unknown, 620 Unchecked, 0.3s Time] [2021-12-06 19:29:37,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-12-06 19:29:37,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2021-12-06 19:29:37,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.1690140845070423) internal successors, (83), 71 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) [2021-12-06 19:29:37,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2021-12-06 19:29:37,044 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 38 [2021-12-06 19:29:37,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:29:37,044 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2021-12-06 19:29:37,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 77 states have internal predecessors, (103), 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) [2021-12-06 19:29:37,044 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2021-12-06 19:29:37,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-06 19:29:37,045 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:29:37,045 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 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] [2021-12-06 19:29:37,065 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-06 19:29:37,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:29:37,247 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:29:37,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:29:37,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1666934362, now seen corresponding path program 5 times [2021-12-06 19:29:37,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:29:37,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298314035] [2021-12-06 19:29:37,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:29:37,249 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:29:37,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:29:37,307 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-06 19:29:37,307 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:29:37,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298314035] [2021-12-06 19:29:37,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298314035] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:29:37,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239717943] [2021-12-06 19:29:37,308 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-06 19:29:37,308 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:29:37,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:29:37,308 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:29:37,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-06 19:29:37,452 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-12-06 19:29:37,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 19:29:37,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-06 19:29:37,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:29:37,534 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-06 19:29:37,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:29:37,581 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-06 19:29:37,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239717943] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:29:37,581 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:29:37,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2021-12-06 19:29:37,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706064215] [2021-12-06 19:29:37,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:29:37,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-06 19:29:37,582 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:29:37,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-06 19:29:37,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2021-12-06 19:29:37,582 INFO L87 Difference]: Start difference. First operand 72 states and 83 transitions. Second operand has 19 states, 19 states have (on average 3.473684210526316) internal successors, (66), 19 states have internal predecessors, (66), 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) [2021-12-06 19:29:37,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:29:37,844 INFO L93 Difference]: Finished difference Result 160 states and 182 transitions. [2021-12-06 19:29:37,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-06 19:29:37,845 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.473684210526316) internal successors, (66), 19 states have internal predecessors, (66), 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 [2021-12-06 19:29:37,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:29:37,846 INFO L225 Difference]: With dead ends: 160 [2021-12-06 19:29:37,846 INFO L226 Difference]: Without dead ends: 107 [2021-12-06 19:29:37,846 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=198, Invalid=858, Unknown=0, NotChecked=0, Total=1056 [2021-12-06 19:29:37,847 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 237 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 19:29:37,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 172 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 19:29:37,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-06 19:29:37,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 82. [2021-12-06 19:29:37,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 81 states have internal predecessors, (88), 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) [2021-12-06 19:29:37,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2021-12-06 19:29:37,855 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 40 [2021-12-06 19:29:37,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:29:37,855 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2021-12-06 19:29:37,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.473684210526316) internal successors, (66), 19 states have internal predecessors, (66), 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) [2021-12-06 19:29:37,855 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2021-12-06 19:29:37,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-06 19:29:37,856 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:29:37,856 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1] [2021-12-06 19:29:37,875 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-06 19:29:38,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:29:38,058 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:29:38,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:29:38,059 INFO L85 PathProgramCache]: Analyzing trace with hash -465930606, now seen corresponding path program 1 times [2021-12-06 19:29:38,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:29:38,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087884503] [2021-12-06 19:29:38,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:29:38,061 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:29:38,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:29:38,659 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 19:29:38,659 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:29:38,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087884503] [2021-12-06 19:29:38,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087884503] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:29:38,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967724834] [2021-12-06 19:29:38,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:29:38,660 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:29:38,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:29:38,661 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:29:38,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-06 19:29:38,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:29:38,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 57 conjunts are in the unsatisfiable core [2021-12-06 19:29:38,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:29:38,723 INFO L388 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 98 treesize of output 94 [2021-12-06 19:29:38,758 INFO L388 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 [2021-12-06 19:29:38,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:29:38,821 INFO L388 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 21 treesize of output 20 [2021-12-06 19:29:38,875 INFO L388 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 23 [2021-12-06 19:29:38,891 INFO L388 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 23 [2021-12-06 19:29:38,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:29:38,959 INFO L388 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 23 [2021-12-06 19:29:38,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:29:38,972 INFO L388 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 23 [2021-12-06 19:29:38,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:29:38,996 INFO L388 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 23 [2021-12-06 19:29:39,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:29:39,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:29:39,010 INFO L388 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 28 treesize of output 30 [2021-12-06 19:29:39,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:29:39,038 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:29:39,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:29:39,040 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2021-12-06 19:29:39,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:29:39,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:29:39,108 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 34 [2021-12-06 19:29:39,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:29:39,385 INFO L388 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 0 case distinctions, treesize of input 68 treesize of output 40 [2021-12-06 19:29:39,409 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-06 19:29:39,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:29:56,455 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 19:29:56,456 INFO L388 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 277 treesize of output 226 [2021-12-06 19:29:58,494 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse2 (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))))) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse1 (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse2 .cse3)))) (let ((.cse0 (select (store .cse2 .cse3 .cse1) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (mod (+ .cse0 1) (- 2)) 0)) (= .cse1 (+ (* 2 (div (+ (* .cse0 (- 1)) 1) (- 2))) 1)))))))) is different from false [2021-12-06 19:29:58,751 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_394 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_394) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse2 (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse0 (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse2 .cse3)))) (let ((.cse1 (select (store .cse2 .cse3 .cse0) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 (+ (* 2 (div (+ (* .cse1 (- 1)) 1) (- 2))) 1)) (not (= 0 (mod (+ .cse1 1) (- 2)))))))))) is different from false [2021-12-06 19:30:00,904 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_394 (Array Int Int))) (let ((.cse4 (store (store (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|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 8)) 1)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_394) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse2 (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|)))))) (let ((.cse1 (+ (select .cse2 .cse3) (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse0 (select (store .cse2 .cse3 .cse1) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (mod (+ .cse0 1) (- 2)) 0)) (= (+ 1 (* 2 (div (+ (* .cse0 (- 1)) 1) (- 2)))) .cse1))))))) is different from false [2021-12-06 19:30:02,965 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_394 (Array Int Int))) (let ((.cse4 (store (store (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|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 8) 8) 1)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_394) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse2 (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|)))))) (let ((.cse1 (+ (select .cse2 .cse3) (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse0 (select (store .cse2 .cse3 .cse1) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (+ (* 2 (div (+ (* .cse0 (- 1)) 1) (- 2))) 1) .cse1) (not (= (mod (+ .cse0 1) (- 2)) 0)))))))) is different from false [2021-12-06 19:30:03,052 INFO L354 Elim1Store]: treesize reduction 39, result has 40.0 percent of original size [2021-12-06 19:30:03,053 INFO L388 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 2 case distinctions, treesize of input 673 treesize of output 318 [2021-12-06 19:30:03,064 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2309 treesize of output 2201 [2021-12-06 19:30:03,395 INFO L354 Elim1Store]: treesize reduction 39, result has 68.8 percent of original size [2021-12-06 19:30:03,396 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 3125 treesize of output 2973 [2021-12-06 19:30:03,435 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:30:03,448 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:30:03,503 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 19:30:03,503 INFO L388 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 2432 treesize of output 2118 [2021-12-06 19:30:03,525 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:30:03,539 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:30:03,595 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 19:30:03,595 INFO L388 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 1281 treesize of output 1247 [2021-12-06 19:30:05,878 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 9 not checked. [2021-12-06 19:30:05,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967724834] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:30:05,879 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:30:05,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 16, 18] total 55 [2021-12-06 19:30:05,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739792801] [2021-12-06 19:30:05,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:30:05,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2021-12-06 19:30:05,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:30:05,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-12-06 19:30:05,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=2246, Unknown=9, NotChecked=404, Total=2970 [2021-12-06 19:30:05,881 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 55 states, 55 states have (on average 2.018181818181818) internal successors, (111), 55 states have internal predecessors, (111), 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) [2021-12-06 19:30:42,808 WARN L227 SmtUtils]: Spent 36.47s on a formula simplification. DAG size of input: 63 DAG size of output: 58 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 19:31:18,592 WARN L227 SmtUtils]: Spent 35.65s on a formula simplification. DAG size of input: 68 DAG size of output: 58 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 19:31:26,870 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (* |c_ULTIMATE.start_main_~i~0#1| 8)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_394 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_394) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse2 (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse0 (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse2 .cse3)))) (let ((.cse1 (select (store .cse2 .cse3 .cse0) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 (+ (* 2 (div (+ (* .cse1 (- 1)) 1) (- 2))) 1)) (not (= 0 (mod (+ .cse1 1) (- 2)))))))))) (= (select .cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse7)) 1) (= (select .cse6 0) 1) (= (select .cse6 |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_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (select .cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse7)) 1) (= (select .cse6 8) 1) (= |c_ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse10 (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse13 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))))) (.cse11 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse9 (+ (select (select (store .cse12 |c_ULTIMATE.start_main_~a~0#1.base| .cse10) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse10 .cse11)))) (let ((.cse8 (select (store .cse10 .cse11 .cse9) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (mod (+ .cse8 1) (- 2)) 0)) (= .cse9 (+ (* 2 (div (+ (* .cse8 (- 1)) 1) (- 2))) 1)))))))))) is different from false [2021-12-06 19:31:29,107 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_394 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_394) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse2 (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse0 (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse2 .cse3)))) (let ((.cse1 (select (store .cse2 .cse3 .cse0) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 (+ (* 2 (div (+ (* .cse1 (- 1)) 1) (- 2))) 1)) (not (= 0 (mod (+ .cse1 1) (- 2)))))))))) (= (select .cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 1) (= (select .cse6 0) 1) (= (select .cse6 |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_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (not (= (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~b~0#1.offset|) 0)) (= (select .cse6 8) 1) (= |c_ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse9 (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse12 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))))) (.cse10 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse8 (+ (select (select (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| .cse9) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse9 .cse10)))) (let ((.cse7 (select (store .cse9 .cse10 .cse8) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (mod (+ .cse7 1) (- 2)) 0)) (= .cse8 (+ (* 2 (div (+ (* .cse7 (- 1)) 1) (- 2))) 1)))))))))) is different from false [2021-12-06 19:31:31,415 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_394 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_394) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse2 (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse0 (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse2 .cse3)))) (let ((.cse1 (select (store .cse2 .cse3 .cse0) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 (+ (* 2 (div (+ (* .cse1 (- 1)) 1) (- 2))) 1)) (not (= 0 (mod (+ .cse1 1) (- 2)))))))))) (= (select .cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 1) (= (select .cse6 0) 1) (= (select .cse6 |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_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (select .cse6 8) 1) (= |c_ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse9 (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse12 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))))) (.cse10 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse8 (+ (select (select (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| .cse9) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse9 .cse10)))) (let ((.cse7 (select (store .cse9 .cse10 .cse8) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (mod (+ .cse7 1) (- 2)) 0)) (= .cse8 (+ (* 2 (div (+ (* .cse7 (- 1)) 1) (- 2))) 1)))))))))) is different from false [2021-12-06 19:31:33,601 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 1) (= (select .cse0 0) 1) (= (select .cse0 |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_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (select .cse0 8) 1) (= |c_ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|)) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse3 (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))))) (.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse2 (+ (select (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse3 .cse4)))) (let ((.cse1 (select (store .cse3 .cse4 .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (mod (+ .cse1 1) (- 2)) 0)) (= .cse2 (+ (* 2 (div (+ (* .cse1 (- 1)) 1) (- 2))) 1)))))))))) is different from false [2021-12-06 19:31:35,655 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 1) (= (select .cse0 0) 1) (= (select .cse0 |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_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (select .cse0 8) 1) (= |c_ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|)) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse3 (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))))) (.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse2 (+ (select (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse3 .cse4)))) (let ((.cse1 (select (store .cse3 .cse4 .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (mod (+ .cse1 1) (- 2)) 0)) (= .cse2 (+ (* 2 (div (+ (* .cse1 (- 1)) 1) (- 2))) 1)))))))))) is different from false [2021-12-06 19:31:37,700 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_394 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_394) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse2 (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse0 (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse2 .cse3)))) (let ((.cse1 (select (store .cse2 .cse3 .cse0) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 (+ (* 2 (div (+ (* .cse1 (- 1)) 1) (- 2))) 1)) (not (= 0 (mod (+ .cse1 1) (- 2)))))))))) (= (select .cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 1) (= (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse9 (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse12 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))))) (.cse10 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse8 (+ (select (select (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| .cse9) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse9 .cse10)))) (let ((.cse7 (select (store .cse9 .cse10 .cse8) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (mod (+ .cse7 1) (- 2)) 0)) (= .cse8 (+ (* 2 (div (+ (* .cse7 (- 1)) 1) (- 2))) 1)))))))))) is different from false [2021-12-06 19:31:39,741 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 1) (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse3 (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))))) (.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse2 (+ (select (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse3 .cse4)))) (let ((.cse1 (select (store .cse3 .cse4 .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (mod (+ .cse1 1) (- 2)) 0)) (= .cse2 (+ (* 2 (div (+ (* .cse1 (- 1)) 1) (- 2))) 1)))))))))) is different from false [2021-12-06 19:31:41,792 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 1) (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse3 (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))))) (.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse2 (+ (select (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse3 .cse4)))) (let ((.cse1 (select (store .cse3 .cse4 .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (mod (+ .cse1 1) (- 2)) 0)) (= .cse2 (+ (* 2 (div (+ (* .cse1 (- 1)) 1) (- 2))) 1)))))))))) is different from false [2021-12-06 19:31:43,846 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 1) (= (select .cse0 0) 1) (= (select .cse0 |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_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (select .cse0 8) 1) (= |c_ULTIMATE.start_main_~b~0#1.offset| 0) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse3 (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))))) (.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse2 (+ (select (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse3 .cse4)))) (let ((.cse1 (select (store .cse3 .cse4 .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (mod (+ .cse1 1) (- 2)) 0)) (= .cse2 (+ (* 2 (div (+ (* .cse1 (- 1)) 1) (- 2))) 1)))))))))) is different from false [2021-12-06 19:31:45,901 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 1) (= (select .cse0 0) 1) (= (select .cse0 |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|)) (not (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 8))) 0)) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (select .cse0 8) 1) (= |c_ULTIMATE.start_main_~b~0#1.offset| 0) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse3 (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))))) (.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse2 (+ (select (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse3 .cse4)))) (let ((.cse1 (select (store .cse3 .cse4 .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (mod (+ .cse1 1) (- 2)) 0)) (= .cse2 (+ (* 2 (div (+ (* .cse1 (- 1)) 1) (- 2))) 1)))))))))) is different from false [2021-12-06 19:31:52,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:31:52,131 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2021-12-06 19:31:52,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-12-06 19:31:52,132 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 2.018181818181818) internal successors, (111), 55 states have internal predecessors, (111), 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 [2021-12-06 19:31:52,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:31:52,133 INFO L225 Difference]: With dead ends: 97 [2021-12-06 19:31:52,133 INFO L226 Difference]: Without dead ends: 64 [2021-12-06 19:31:52,135 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 77 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 1348 ImplicationChecksByTransitivity, 128.7s TimeCoverageRelationStatistics Valid=505, Invalid=3690, Unknown=21, NotChecked=1946, Total=6162 [2021-12-06 19:31:52,135 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 53 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 193 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-12-06 19:31:52,136 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 121 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 306 Invalid, 0 Unknown, 193 Unchecked, 1.4s Time] [2021-12-06 19:31:52,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-12-06 19:31:52,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2021-12-06 19:31:52,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 59 states have internal predecessors, (67), 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) [2021-12-06 19:31:52,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2021-12-06 19:31:52,143 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 42 [2021-12-06 19:31:52,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:31:52,143 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2021-12-06 19:31:52,143 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 2.018181818181818) internal successors, (111), 55 states have internal predecessors, (111), 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) [2021-12-06 19:31:52,144 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2021-12-06 19:31:52,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-06 19:31:52,144 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:31:52,144 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:31:52,165 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-06 19:31:52,345 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:31:52,346 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:31:52,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:31:52,348 INFO L85 PathProgramCache]: Analyzing trace with hash 383514002, now seen corresponding path program 6 times [2021-12-06 19:31:52,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:31:52,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356107892] [2021-12-06 19:31:52,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:31:52,349 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:31:52,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:32:01,108 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:32:01,108 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:32:01,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356107892] [2021-12-06 19:32:01,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356107892] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:32:01,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187519399] [2021-12-06 19:32:01,108 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-06 19:32:01,109 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:32:01,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:32:01,109 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:32:01,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-06 19:32:01,215 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-12-06 19:32:01,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 19:32:01,218 WARN L261 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 111 conjunts are in the unsatisfiable core [2021-12-06 19:32:01,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:32:01,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:01,255 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2021-12-06 19:32:01,301 INFO L388 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 [2021-12-06 19:32:01,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:01,556 INFO L388 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 [2021-12-06 19:32:02,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:02,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:02,164 INFO L388 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 30 treesize of output 32 [2021-12-06 19:32:02,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:02,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:02,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:02,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:02,773 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 47 [2021-12-06 19:32:04,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:04,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:04,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:04,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:04,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:04,173 INFO L388 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 44 treesize of output 52 [2021-12-06 19:32:04,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:04,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:04,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:04,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:04,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:04,669 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-06 19:32:04,670 INFO L388 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 1 case distinctions, treesize of input 55 treesize of output 66 [2021-12-06 19:32:05,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:05,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:05,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:05,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:05,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:05,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:05,548 INFO L354 Elim1Store]: treesize reduction 38, result has 15.6 percent of original size [2021-12-06 19:32:05,549 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 81 [2021-12-06 19:32:07,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:07,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:07,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:07,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:07,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:07,476 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:32:07,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:07,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:07,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:07,486 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 9 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 90 [2021-12-06 19:32:08,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:08,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:08,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:08,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:08,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:08,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:08,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:08,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:08,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:08,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:08,554 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:32:08,555 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 9 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 93 [2021-12-06 19:32:09,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:09,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:09,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:09,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:09,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:09,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:09,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:09,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:09,548 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 88 [2021-12-06 19:32:10,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:10,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:10,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:10,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:10,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:10,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:10,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:10,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:10,799 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 88 [2021-12-06 19:32:11,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:11,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:11,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:11,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:11,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:11,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:11,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:11,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:11,455 INFO L354 Elim1Store]: treesize reduction 45, result has 2.2 percent of original size [2021-12-06 19:32:11,455 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 9 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 99 [2021-12-06 19:32:12,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:12,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:12,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:12,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:12,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:12,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:12,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:12,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:12,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:12,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:12,612 INFO L354 Elim1Store]: treesize reduction 64, result has 1.5 percent of original size [2021-12-06 19:32:12,612 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 11 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 5 case distinctions, treesize of input 93 treesize of output 105 [2021-12-06 19:32:15,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:15,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:15,152 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:32:15,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:15,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:15,159 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:32:15,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:15,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:15,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:15,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:15,172 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:32:15,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:15,176 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 9 disjoint index pairs (out of 45 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 90 [2021-12-06 19:32:16,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:16,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:16,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:16,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:16,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:16,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:16,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:16,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:16,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:16,498 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:32:16,499 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:32:16,661 INFO L354 Elim1Store]: treesize reduction 154, result has 24.9 percent of original size [2021-12-06 19:32:16,661 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 8 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 13 case distinctions, treesize of input 106 treesize of output 111 [2021-12-06 19:32:18,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:18,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:18,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:18,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:18,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:18,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:18,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:18,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:18,090 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:32:18,090 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:32:18,270 INFO L354 Elim1Store]: treesize reduction 216, result has 21.5 percent of original size [2021-12-06 19:32:18,270 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 100 treesize of output 111 [2021-12-06 19:32:19,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:19,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:19,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:19,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:19,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:32:19,983 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 19:32:19,984 INFO L388 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 3 case distinctions, treesize of input 90 treesize of output 48 [2021-12-06 19:32:20,306 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:32:20,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:32:23,763 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_141| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_141| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((v_ArrVal_518 Int)) (= (+ (* 2 c_~N~0) 1) (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_141| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.offset|))))) is different from false [2021-12-06 19:33:52,346 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_142| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_142| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((v_ArrVal_518 Int) (|v_ULTIMATE.start_main_~i~0#1_141| Int) (v_ArrVal_516 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_141| (+ |v_ULTIMATE.start_main_~i~0#1_142| 1)) (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_142| 8)) v_ArrVal_516) (+ (* |v_ULTIMATE.start_main_~i~0#1_141| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (* 2 c_~N~0) 1)))))) is different from false [2021-12-06 19:33:54,405 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_518 Int) (|v_ULTIMATE.start_main_~i~0#1_141| Int) (v_ArrVal_516 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_142| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< |v_ULTIMATE.start_main_~i~0#1_141| (+ |v_ULTIMATE.start_main_~i~0#1_142| 1)) (= (+ (* 2 c_~N~0) 1) (select (store (store (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 8)))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_142| 8)) v_ArrVal_516) (+ (* |v_ULTIMATE.start_main_~i~0#1_141| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2021-12-06 19:34:14,434 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_518 Int) (|v_ULTIMATE.start_main_~i~0#1_141| Int) (v_ArrVal_516 Int)) (or (= (select (store (store (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 8)))) (.cse4 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse6 (* |v_ULTIMATE.start_main_~i~0#1_147| 8))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse4))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse6)))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse4))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse6 8)))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 .cse2 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse3 .cse4))))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_142| 8)) v_ArrVal_516) (+ (* |v_ULTIMATE.start_main_~i~0#1_141| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (* 2 c_~N~0) 1)) (< |v_ULTIMATE.start_main_~i~0#1_142| 1) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_147| 1)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_147|) c_~N~0) (< |v_ULTIMATE.start_main_~i~0#1_141| (+ |v_ULTIMATE.start_main_~i~0#1_142| 1)))) is different from false [2021-12-06 19:34:16,664 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_518 Int) (|v_ULTIMATE.start_main_~i~0#1_141| Int) (v_ArrVal_516 Int)) (or (= (select (store (store (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse6 (* |v_ULTIMATE.start_main_~i~0#1_147| 8))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse4))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse6)))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse6 8)))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse1 .cse2 .cse3 .cse4))))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_142| 8)) v_ArrVal_516) (+ (* |v_ULTIMATE.start_main_~i~0#1_141| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (* 2 c_~N~0) 1)) (< |v_ULTIMATE.start_main_~i~0#1_142| 1) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_147| 1)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_147|) c_~N~0) (< |v_ULTIMATE.start_main_~i~0#1_141| (+ |v_ULTIMATE.start_main_~i~0#1_142| 1)))) is different from false [2021-12-06 19:34:19,481 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_518 Int) (|v_ULTIMATE.start_main_~i~0#1_141| Int) (v_ArrVal_516 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_142| 1) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_147| 1)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_147|) c_~N~0) (= (select (store (store (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 8)))) (.cse5 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse5))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse7 (* |v_ULTIMATE.start_main_~i~0#1_147| 8))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse5))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse7)))) (let ((.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse5))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse7 8)))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4 .cse5 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|))))))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_142| 8)) v_ArrVal_516) (+ (* |v_ULTIMATE.start_main_~i~0#1_141| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (* 2 c_~N~0) 1)) (< |v_ULTIMATE.start_main_~i~0#1_141| (+ |v_ULTIMATE.start_main_~i~0#1_142| 1)))) is different from false [2021-12-06 19:34:21,793 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_518 Int) (|v_ULTIMATE.start_main_~i~0#1_141| Int) (v_ArrVal_516 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_142| 1) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_147| 1)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_147|) c_~N~0) (= (+ (* 2 c_~N~0) 1) (select (store (store (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 8) 8))) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse4))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse7 (* |v_ULTIMATE.start_main_~i~0#1_147| 8))) (let ((.cse5 (select (select (store |c_#memory_int| |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_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse7)))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse7 8)))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse2 .cse3 .cse4 .cse5)))))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_142| 8)) v_ArrVal_516) (+ (* |v_ULTIMATE.start_main_~i~0#1_141| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_141| (+ |v_ULTIMATE.start_main_~i~0#1_142| 1)))) is different from false [2021-12-06 19:34:24,211 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_518 Int) (|v_ULTIMATE.start_main_~i~0#1_141| Int) (v_ArrVal_516 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_142| 1) (= (select (store (store (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse9 (* |c_ULTIMATE.start_main_~i~0#1| 8))) (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse9))) (.cse5 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse9 8)))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5 .cse6))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse8 (* |v_ULTIMATE.start_main_~i~0#1_147| 8))) (let ((.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse5 .cse6))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse8)))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse8 8)))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4 .cse5 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse6))))))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_142| 8)) v_ArrVal_516) (+ (* |v_ULTIMATE.start_main_~i~0#1_141| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (* 2 c_~N~0) 1)) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_147| 1)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_147|) c_~N~0) (< |v_ULTIMATE.start_main_~i~0#1_141| (+ |v_ULTIMATE.start_main_~i~0#1_142| 1)))) is different from false [2021-12-06 19:34:26,608 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_518 Int) (|v_ULTIMATE.start_main_~i~0#1_141| Int) (v_ArrVal_516 Int)) (or (= (+ (* 2 c_~N~0) 1) (select (store (store (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse9 (* |c_ULTIMATE.start_main_~i~0#1| 8))) (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse9 8))) (.cse5 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse9 16)))) (let ((.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse5))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse8 (* |v_ULTIMATE.start_main_~i~0#1_147| 8))) (let ((.cse6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse4 .cse5))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse8)))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse8 8)))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))))))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_142| 8)) v_ArrVal_516) (+ (* |v_ULTIMATE.start_main_~i~0#1_141| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_142| 1) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_147| 1)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_147|) c_~N~0) (< |v_ULTIMATE.start_main_~i~0#1_141| (+ |v_ULTIMATE.start_main_~i~0#1_142| 1)))) is different from false [2021-12-06 19:34:29,298 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_518 Int) (|v_ULTIMATE.start_main_~i~0#1_141| Int) (v_ArrVal_516 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_142| 1) (= (+ (* 2 c_~N~0) 1) (select (store (store (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse10 (* |c_ULTIMATE.start_main_~i~0#1| 8))) (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse10))) (.cse6 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse7 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse10 8)))) (let ((.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse10 16)))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse9 (* |v_ULTIMATE.start_main_~i~0#1_147| 8))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4 .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse9)))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse4 .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse9 8)))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse7)))))))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_142| 8)) v_ArrVal_516) (+ (* |v_ULTIMATE.start_main_~i~0#1_141| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.offset|)) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_147| 1)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_147|) c_~N~0) (< |v_ULTIMATE.start_main_~i~0#1_141| (+ |v_ULTIMATE.start_main_~i~0#1_142| 1)))) is different from false [2021-12-06 19:34:31,801 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_518 Int) (|v_ULTIMATE.start_main_~i~0#1_141| Int) (v_ArrVal_516 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_142| 1) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_147| 1)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_147|) c_~N~0) (< |v_ULTIMATE.start_main_~i~0#1_141| (+ |v_ULTIMATE.start_main_~i~0#1_142| 1)) (= (+ (* 2 c_~N~0) 1) (select (store (store (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (let ((.cse6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse5))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse9 (* |v_ULTIMATE.start_main_~i~0#1_147| 8))) (let ((.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse5 .cse6))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse9)))) (let ((.cse7 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse9 8)))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 .cse2 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse3 .cse4 .cse5 .cse6 .cse7)))))))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_142| 8)) v_ArrVal_516) (+ (* |v_ULTIMATE.start_main_~i~0#1_141| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2021-12-06 19:35:03,205 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_518 Int) (|v_ULTIMATE.start_main_~i~0#1_141| Int) (v_ArrVal_516 Int)) (or (= (+ (* 2 c_~N~0) 1) (select (store (store (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (let ((.cse11 (* |ULTIMATE.start_main_~i~0#1| 8))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse11) 1) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse11 8) 1))))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse6 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse4 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (let ((.cse1 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse6 .cse7))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse10 (* |v_ULTIMATE.start_main_~i~0#1_147| 8))) (let ((.cse5 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse4 .cse6 .cse7))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse10)))) (let ((.cse2 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse4 .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse10 8)))) (let ((.cse0 (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4 .cse5 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse6 .cse7))))))))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_142| 8)) v_ArrVal_516) (+ (* |v_ULTIMATE.start_main_~i~0#1_141| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_142| 1) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_147| 1)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_147|) c_~N~0) (< |v_ULTIMATE.start_main_~i~0#1_141| (+ |v_ULTIMATE.start_main_~i~0#1_142| 1)))) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) c_~N~0) (<= c_~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-12-06 19:35:07,900 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (|v_ULTIMATE.start_main_~i~0#1_156| Int) (v_ArrVal_518 Int) (|v_ULTIMATE.start_main_~i~0#1_141| Int) (v_ArrVal_516 Int)) (or (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_156| 1)) (< |v_ULTIMATE.start_main_~i~0#1_142| 1) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_156|) c_~N~0) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_147| 1)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_147|) c_~N~0) (< |v_ULTIMATE.start_main_~i~0#1_141| (+ |v_ULTIMATE.start_main_~i~0#1_142| 1)) (= (select (store (store (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (let ((.cse11 (* |v_ULTIMATE.start_main_~i~0#1_156| 8))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 8)) 1) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse11) 1) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse11 8) 1))))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse6 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (let ((.cse5 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse6 .cse7))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse10 (* |v_ULTIMATE.start_main_~i~0#1_147| 8))) (let ((.cse1 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse10)))) (let ((.cse4 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse10 8)))) (let ((.cse0 (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 .cse2 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse3 .cse4 .cse5 .cse6 .cse7))))))))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_142| 8)) v_ArrVal_516) (+ (* |v_ULTIMATE.start_main_~i~0#1_141| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (* 2 c_~N~0) 1)))) is different from false [2021-12-06 19:35:10,912 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (|v_ULTIMATE.start_main_~i~0#1_156| Int) (v_ArrVal_518 Int) (|v_ULTIMATE.start_main_~i~0#1_141| Int) (v_ArrVal_516 Int)) (or (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_156| 1)) (< |v_ULTIMATE.start_main_~i~0#1_142| 1) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_156|) c_~N~0) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_147| 1)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_147|) c_~N~0) (< |v_ULTIMATE.start_main_~i~0#1_141| (+ |v_ULTIMATE.start_main_~i~0#1_142| 1)) (= (+ (* 2 c_~N~0) 1) (select (store (store (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (let ((.cse11 (* |v_ULTIMATE.start_main_~i~0#1_156| 8))) (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| .cse11) 1) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse11 8) 1))))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse2 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (let ((.cse4 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse7))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse10 (* |v_ULTIMATE.start_main_~i~0#1_147| 8))) (let ((.cse6 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4 .cse7))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse10)))) (let ((.cse5 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4 .cse6 .cse7))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse10 8)))) (let ((.cse0 (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse5 .cse6 .cse7))))))))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_142| 8)) v_ArrVal_516) (+ (* |v_ULTIMATE.start_main_~i~0#1_141| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2021-12-06 19:35:47,106 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (|v_ULTIMATE.start_main_~i~0#1_156| Int) (v_ArrVal_518 Int) (|v_ULTIMATE.start_main_~i~0#1_141| Int) (v_ArrVal_516 Int)) (or (= (select (store (store (let ((.cse8 (let ((.cse11 (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|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 8)) 1)))) (store .cse11 |c_ULTIMATE.start_main_~b~0#1.base| (let ((.cse12 (* |v_ULTIMATE.start_main_~i~0#1_156| 8))) (store (store (store (select .cse11 |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| .cse12) 1) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse12 8) 1)))))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse6 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse1 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (let ((.cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse10 (* |v_ULTIMATE.start_main_~i~0#1_147| 8))) (let ((.cse2 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4 .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse10)))) (let ((.cse3 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse4 .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse10 8)))) (let ((.cse0 (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 .cse2 .cse3 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse4 .cse5 .cse6 .cse7))))))))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_142| 8)) v_ArrVal_516) (+ (* |v_ULTIMATE.start_main_~i~0#1_141| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (* 2 ~N~0) 1)) (<= ~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_156| 1)) (< |v_ULTIMATE.start_main_~i~0#1_142| 1) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_156|) ~N~0) (<= ~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_147| 1)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_147|) ~N~0) (< |v_ULTIMATE.start_main_~i~0#1_141| (+ |v_ULTIMATE.start_main_~i~0#1_142| 1)))) (<= ~N~0 |c_ULTIMATE.start_main_~i~0#1|) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0))) is different from false [2021-12-06 19:35:52,154 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (|v_ULTIMATE.start_main_~i~0#1_156| Int) (~N~0 Int) (v_ArrVal_518 Int) (|v_ULTIMATE.start_main_~i~0#1_141| Int) (v_ArrVal_516 Int)) (or (<= ~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_156| 1)) (< |v_ULTIMATE.start_main_~i~0#1_142| 1) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_156|) ~N~0) (<= ~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_147| 1)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_147|) ~N~0) (= (select (store (store (let ((.cse8 (let ((.cse11 (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|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 8) 8) 1)))) (store .cse11 |c_ULTIMATE.start_main_~b~0#1.base| (let ((.cse12 (* |v_ULTIMATE.start_main_~i~0#1_156| 8))) (store (store (store (select .cse11 |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| .cse12) 1) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse12 8) 1)))))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse6 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (let ((.cse3 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse4 .cse6))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse10 (* |v_ULTIMATE.start_main_~i~0#1_147| 8))) (let ((.cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4 .cse6))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse10)))) (let ((.cse5 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4 .cse6 .cse7))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse10 8)))) (let ((.cse0 (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))))))))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_142| 8)) v_ArrVal_516) (+ (* |v_ULTIMATE.start_main_~i~0#1_141| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (* 2 ~N~0) 1)) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (< |v_ULTIMATE.start_main_~i~0#1_141| (+ |v_ULTIMATE.start_main_~i~0#1_142| 1)) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-12-06 19:35:57,891 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (|v_ULTIMATE.start_main_~i~0#1_156| Int) (~N~0 Int) (v_ArrVal_518 Int) (|v_ULTIMATE.start_main_~i~0#1_141| Int) (v_ArrVal_516 Int)) (or (<= ~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_156| 1)) (= (select (store (store (let ((.cse8 (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse13 (* |c_ULTIMATE.start_main_~i~0#1| 8))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse13) 1) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse13 8) 1))))) (store .cse11 |c_ULTIMATE.start_main_~b~0#1.base| (let ((.cse12 (* |v_ULTIMATE.start_main_~i~0#1_156| 8))) (store (store (store (select .cse11 |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| .cse12) 1) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse12 8) 1)))))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse5 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (let ((.cse1 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse5 .cse7))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse10 (* |v_ULTIMATE.start_main_~i~0#1_147| 8))) (let ((.cse6 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse5 .cse7))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse10)))) (let ((.cse4 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse10 8)))) (let ((.cse0 (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))))))))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_142| 8)) v_ArrVal_516) (+ (* |v_ULTIMATE.start_main_~i~0#1_141| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (* 2 ~N~0) 1)) (< |v_ULTIMATE.start_main_~i~0#1_142| 1) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_156|) ~N~0) (<= ~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_147| 1)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_147|) ~N~0) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (< |v_ULTIMATE.start_main_~i~0#1_141| (+ |v_ULTIMATE.start_main_~i~0#1_142| 1)) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-12-06 19:36:03,523 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (|v_ULTIMATE.start_main_~i~0#1_156| Int) (~N~0 Int) (v_ArrVal_518 Int) (|v_ULTIMATE.start_main_~i~0#1_141| Int) (v_ArrVal_516 Int)) (or (<= ~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_156| 1)) (< |v_ULTIMATE.start_main_~i~0#1_142| 1) (= (select (store (store (let ((.cse8 (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse13 (* |c_ULTIMATE.start_main_~i~0#1| 8))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse13 8) 1) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse13 16) 1))))) (store .cse11 |c_ULTIMATE.start_main_~b~0#1.base| (let ((.cse12 (* |v_ULTIMATE.start_main_~i~0#1_156| 8))) (store (store (store (select .cse11 |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| .cse12) 1) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse12 8) 1)))))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse2 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (let ((.cse3 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse6 .cse7))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse10 (* |v_ULTIMATE.start_main_~i~0#1_147| 8))) (let ((.cse5 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse6 .cse7))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse10)))) (let ((.cse4 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse10 8)))) (let ((.cse0 (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 .cse2 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse3 .cse4 .cse5 .cse6 .cse7))))))))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_142| 8)) v_ArrVal_516) (+ (* |v_ULTIMATE.start_main_~i~0#1_141| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (* 2 ~N~0) 1)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_156|) ~N~0) (<= ~N~0 (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (<= ~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_147| 1)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_147|) ~N~0) (< |v_ULTIMATE.start_main_~i~0#1_141| (+ |v_ULTIMATE.start_main_~i~0#1_142| 1)) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0))) is different from false [2021-12-06 19:36:10,406 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (|v_ULTIMATE.start_main_~i~0#1_156| Int) (~N~0 Int) (v_ArrVal_518 Int) (|v_ULTIMATE.start_main_~i~0#1_141| Int) (v_ArrVal_516 Int)) (or (<= ~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_156| 1)) (< |v_ULTIMATE.start_main_~i~0#1_142| 1) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_156|) ~N~0) (= (select (store (store (let ((.cse8 (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse13 (* |c_ULTIMATE.start_main_~i~0#1| 8))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse13) 1) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse13 8) 1) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse13 16) 1))))) (store .cse11 |c_ULTIMATE.start_main_~b~0#1.base| (let ((.cse12 (* |v_ULTIMATE.start_main_~i~0#1_156| 8))) (store (store (store (select .cse11 |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| .cse12) 1) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse12 8) 1)))))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse4 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (let ((.cse6 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse10 (* |v_ULTIMATE.start_main_~i~0#1_147| 8))) (let ((.cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse10)))) (let ((.cse2 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse4 .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse10 8)))) (let ((.cse0 (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 .cse2 .cse3 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse4 .cse5 .cse6 .cse7))))))))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_142| 8)) v_ArrVal_516) (+ (* |v_ULTIMATE.start_main_~i~0#1_141| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (* 2 ~N~0) 1)) (<= ~N~0 (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (<= ~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_147| 1)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_147|) ~N~0) (< |v_ULTIMATE.start_main_~i~0#1_141| (+ |v_ULTIMATE.start_main_~i~0#1_142| 1)) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0))) is different from false [2021-12-06 19:36:10,512 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 34 not checked. [2021-12-06 19:36:10,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187519399] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:36:10,513 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:36:10,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 110 [2021-12-06 19:36:10,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496387342] [2021-12-06 19:36:10,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:36:10,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 110 states [2021-12-06 19:36:10,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:36:10,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2021-12-06 19:36:10,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=697, Invalid=7485, Unknown=84, NotChecked=3724, Total=11990 [2021-12-06 19:36:10,517 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 110 states, 110 states have (on average 1.209090909090909) internal successors, (133), 110 states have internal predecessors, (133), 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) [2021-12-06 19:37:04,341 WARN L227 SmtUtils]: Spent 53.03s on a formula simplification. DAG size of input: 143 DAG size of output: 120 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 19:37:12,609 WARN L227 SmtUtils]: Spent 7.66s on a formula simplification. DAG size of input: 141 DAG size of output: 118 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 19:37:21,775 WARN L227 SmtUtils]: Spent 8.47s on a formula simplification. DAG size of input: 116 DAG size of output: 114 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 19:37:24,642 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)) 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 1) (= (select .cse1 (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 8))) 1) (= 1 (select .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|)) (= (select .cse0 0) 1) (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* c_~N~0 8) (- 8))) 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~#sum~0#1.offset| 0) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (< (+ |c_ULTIMATE.start_main_~b~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (select .cse0 8) 1) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_518 Int) (|v_ULTIMATE.start_main_~i~0#1_141| Int) (v_ArrVal_516 Int)) (or (= (+ (* 2 c_~N~0) 1) (select (store (store (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (let ((.cse13 (* |ULTIMATE.start_main_~i~0#1| 8))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse13) 1) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse13 8) 1))))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse9 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse6 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (let ((.cse3 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6 .cse8 .cse9))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse12 (* |v_ULTIMATE.start_main_~i~0#1_147| 8))) (let ((.cse7 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse5 .cse6 .cse8 .cse9))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse12)))) (let ((.cse4 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse5 .cse6 .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse12 8)))) (let ((.cse2 (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse3 .cse4 .cse5 .cse6 .cse7 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse8 .cse9))))))))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_142| 8)) v_ArrVal_516) (+ (* |v_ULTIMATE.start_main_~i~0#1_141| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_142| 1) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_147| 1)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_147|) c_~N~0) (< |v_ULTIMATE.start_main_~i~0#1_141| (+ |v_ULTIMATE.start_main_~i~0#1_142| 1)))) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) c_~N~0) (<= c_~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1)))) (= |c_ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|)) (<= 3 c_~N~0) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= c_~N~0 3) (< 2 c_~N~0))) is different from false [2021-12-06 19:37:26,667 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (and (= (select .cse0 0) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select .cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)) 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (= (select .cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 1) (= 1 (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (= (select .cse1 0) 1) (= (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select .cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* c_~N~0 8) (- 8))) 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~#sum~0#1.offset| 0) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (select .cse0 (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 8) (- 8))) 1) (< (+ |c_ULTIMATE.start_main_~b~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (not (= (+ .cse2 |c_ULTIMATE.start_main_~b~0#1.offset|) 0)) (= (select .cse1 8) 1) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_518 Int) (|v_ULTIMATE.start_main_~i~0#1_141| Int) (v_ArrVal_516 Int)) (or (= (+ (* 2 c_~N~0) 1) (select (store (store (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (let ((.cse14 (* |ULTIMATE.start_main_~i~0#1| 8))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse14) 1) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse14 8) 1))))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse10 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse9 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse7 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (let ((.cse4 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7 .cse9 .cse10))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse13 (* |v_ULTIMATE.start_main_~i~0#1_147| 8))) (let ((.cse8 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse6 .cse7 .cse9 .cse10))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse13)))) (let ((.cse5 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse6 .cse7 .cse8 .cse9 .cse10))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse13 8)))) (let ((.cse3 (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse4 .cse5 .cse6 .cse7 .cse8 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse9 .cse10))))))))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_142| 8)) v_ArrVal_516) (+ (* |v_ULTIMATE.start_main_~i~0#1_141| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_142| 1) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_147| 1)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_147|) c_~N~0) (< |v_ULTIMATE.start_main_~i~0#1_141| (+ |v_ULTIMATE.start_main_~i~0#1_142| 1)))) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) c_~N~0) (<= c_~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1)))) (= |c_ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|)) (<= 3 c_~N~0) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= c_~N~0 3) (< 2 c_~N~0) (<= (+ .cse2 16) (* 8 c_~N~0)))) is different from false [2021-12-06 19:37:35,574 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 8))) (+ (* 2 c_~N~0) 1)) (= (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)) 1) (= (select .cse0 (+ |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|)) (exists ((|v_ULTIMATE.start_main_~i~0#1_136| Int) (|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse1 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse3 (* |v_ULTIMATE.start_main_~i~0#1_136| 8))) (let ((.cse2 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) 0)) (.cse4 (select .cse1 (+ (- 8) .cse3)))) (and (= (select .cse1 0) 1) (= .cse2 (+ (select .cse1 .cse3) .cse4 4)) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_136| 1)) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|) (< |v_ULTIMATE.start_main_~i~0#1_136| c_~N~0) (< (+ |ULTIMATE.start_main_~b~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse4 1) (= (+ .cse2 1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 8)))) (= .cse2 (+ 5 .cse4)))))) (<= c_~N~0 3) (< 2 c_~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_142| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_142| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((v_ArrVal_518 Int) (|v_ULTIMATE.start_main_~i~0#1_141| Int) (v_ArrVal_516 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_141| (+ |v_ULTIMATE.start_main_~i~0#1_142| 1)) (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_142| 8)) v_ArrVal_516) (+ (* |v_ULTIMATE.start_main_~i~0#1_141| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (* 2 c_~N~0) 1)))))))) is different from false [2021-12-06 19:37:37,980 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (* 8 |c_ULTIMATE.start_main_~i~0#1|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_141| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_141| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((v_ArrVal_518 Int)) (= (+ (* 2 c_~N~0) 1) (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_141| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (or (= (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 1) (= .cse1 8)) (<= c_~N~0 3) (<= |c_ULTIMATE.start_main_~i~0#1| 1) (or (= .cse1 16) (= (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)) 1)) (exists ((|v_ULTIMATE.start_main_~i~0#1_136| Int) (|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse2 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse4 (* |v_ULTIMATE.start_main_~i~0#1_136| 8))) (let ((.cse3 (select .cse2 .cse4))) (and (= (select .cse2 0) 1) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_136| 1)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ .cse3 6)) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|) (< |v_ULTIMATE.start_main_~i~0#1_136| c_~N~0) (< (+ |ULTIMATE.start_main_~b~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) 0) (+ 5 .cse3)) (= .cse3 1) (= (select .cse2 (+ (- 8) .cse4)) 1))))) (< 2 c_~N~0) (= (+ (* 2 c_~N~0) 1) (select .cse0 0)))) is different from false [2021-12-06 19:37:40,387 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_141| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_141| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((v_ArrVal_518 Int)) (= (+ (* 2 c_~N~0) 1) (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_141| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (<= c_~N~0 3) (exists ((|v_ULTIMATE.start_main_~i~0#1_136| Int) (|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse2 (* |v_ULTIMATE.start_main_~i~0#1_136| 8))) (let ((.cse1 (select .cse0 .cse2))) (and (= (select .cse0 0) 1) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_136| 1)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ .cse1 6)) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|) (< |v_ULTIMATE.start_main_~i~0#1_136| c_~N~0) (< (+ |ULTIMATE.start_main_~b~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) 0) (+ 5 .cse1)) (= .cse1 1) (= (select .cse0 (+ (- 8) .cse2)) 1))))) (< 2 c_~N~0)) is different from false [2021-12-06 19:37:41,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:37:41,258 INFO L93 Difference]: Finished difference Result 112 states and 126 transitions. [2021-12-06 19:37:41,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-12-06 19:37:41,259 INFO L78 Accepts]: Start accepts. Automaton has has 110 states, 110 states have (on average 1.209090909090909) internal successors, (133), 110 states have internal predecessors, (133), 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 48 [2021-12-06 19:37:41,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:37:41,260 INFO L225 Difference]: With dead ends: 112 [2021-12-06 19:37:41,260 INFO L226 Difference]: Without dead ends: 110 [2021-12-06 19:37:41,265 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 25 SyntacticMatches, 16 SemanticMatches, 130 ConstructedPredicates, 24 IntricatePredicates, 0 DeprecatedPredicates, 4794 ImplicationChecksByTransitivity, 304.8s TimeCoverageRelationStatistics Valid=951, Invalid=10612, Unknown=89, NotChecked=5640, Total=17292 [2021-12-06 19:37:41,266 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 1324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 978 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:37:41,266 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 356 Invalid, 1324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 327 Invalid, 0 Unknown, 978 Unchecked, 1.0s Time] [2021-12-06 19:37:41,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-12-06 19:37:41,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 100. [2021-12-06 19:37:41,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.1414141414141414) internal successors, (113), 99 states have internal predecessors, (113), 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) [2021-12-06 19:37:41,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2021-12-06 19:37:41,278 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 48 [2021-12-06 19:37:41,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:37:41,278 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2021-12-06 19:37:41,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 110 states, 110 states have (on average 1.209090909090909) internal successors, (133), 110 states have internal predecessors, (133), 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) [2021-12-06 19:37:41,278 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2021-12-06 19:37:41,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-06 19:37:41,279 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:37:41,279 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:37:41,299 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-06 19:37:41,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-12-06 19:37:41,481 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:37:41,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:37:41,483 INFO L85 PathProgramCache]: Analyzing trace with hash 686177872, now seen corresponding path program 7 times [2021-12-06 19:37:41,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:37:41,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387749134] [2021-12-06 19:37:41,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:37:41,484 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:37:41,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:37:41,772 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-06 19:37:41,773 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:37:41,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387749134] [2021-12-06 19:37:41,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387749134] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:37:41,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869962752] [2021-12-06 19:37:41,773 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-06 19:37:41,773 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:37:41,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:37:41,774 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:37:41,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-06 19:37:41,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:37:41,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-06 19:37:41,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:37:42,298 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-06 19:37:42,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:37:42,565 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-06 19:37:42,566 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869962752] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:37:42,566 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:37:42,566 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2021-12-06 19:37:42,566 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62608055] [2021-12-06 19:37:42,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:37:42,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-06 19:37:42,567 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:37:42,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-06 19:37:42,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-12-06 19:37:42,568 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 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) [2021-12-06 19:37:43,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:37:43,581 INFO L93 Difference]: Finished difference Result 236 states and 263 transitions. [2021-12-06 19:37:43,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-06 19:37:43,582 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 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) Word has length 50 [2021-12-06 19:37:43,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:37:43,583 INFO L225 Difference]: With dead ends: 236 [2021-12-06 19:37:43,583 INFO L226 Difference]: Without dead ends: 167 [2021-12-06 19:37:43,583 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2021-12-06 19:37:43,584 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 173 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-06 19:37:43,584 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 95 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-06 19:37:43,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-12-06 19:37:43,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 131. [2021-12-06 19:37:43,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.0923076923076922) internal successors, (142), 130 states have internal predecessors, (142), 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) [2021-12-06 19:37:43,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 142 transitions. [2021-12-06 19:37:43,600 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 142 transitions. Word has length 50 [2021-12-06 19:37:43,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:37:43,600 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 142 transitions. [2021-12-06 19:37:43,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 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) [2021-12-06 19:37:43,600 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2021-12-06 19:37:43,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-06 19:37:43,601 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:37:43,601 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:37:43,624 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-06 19:37:43,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-06 19:37:43,803 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:37:43,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:37:43,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1057566480, now seen corresponding path program 8 times [2021-12-06 19:37:43,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:37:43,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812619528] [2021-12-06 19:37:43,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:37:43,806 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:37:43,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:37:44,132 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-06 19:37:44,132 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:37:44,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812619528] [2021-12-06 19:37:44,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812619528] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:37:44,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920551352] [2021-12-06 19:37:44,133 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 19:37:44,133 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:37:44,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:37:44,133 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:37:44,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-06 19:37:44,191 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 19:37:44,191 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 19:37:44,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-06 19:37:44,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:37:44,663 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-06 19:37:44,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:37:44,921 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-06 19:37:44,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920551352] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:37:44,921 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:37:44,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2021-12-06 19:37:44,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672677726] [2021-12-06 19:37:44,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:37:44,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-06 19:37:44,922 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:37:44,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-06 19:37:44,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-12-06 19:37:44,922 INFO L87 Difference]: Start difference. First operand 131 states and 142 transitions. Second operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 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) [2021-12-06 19:37:46,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:37:46,977 INFO L93 Difference]: Finished difference Result 171 states and 180 transitions. [2021-12-06 19:37:46,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-06 19:37:46,977 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 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) Word has length 50 [2021-12-06 19:37:46,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:37:46,978 INFO L225 Difference]: With dead ends: 171 [2021-12-06 19:37:46,979 INFO L226 Difference]: Without dead ends: 134 [2021-12-06 19:37:46,979 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2021-12-06 19:37:46,980 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 151 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-12-06 19:37:46,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 170 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-12-06 19:37:46,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-12-06 19:37:46,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 104. [2021-12-06 19:37:46,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.0679611650485437) internal successors, (110), 103 states have internal predecessors, (110), 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) [2021-12-06 19:37:46,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 110 transitions. [2021-12-06 19:37:46,992 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 110 transitions. Word has length 50 [2021-12-06 19:37:46,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:37:46,992 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 110 transitions. [2021-12-06 19:37:46,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 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) [2021-12-06 19:37:46,992 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 110 transitions. [2021-12-06 19:37:46,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-06 19:37:46,993 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:37:46,993 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:37:47,027 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-06 19:37:47,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-12-06 19:37:47,195 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:37:47,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:37:47,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1433546370, now seen corresponding path program 2 times [2021-12-06 19:37:47,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:37:47,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20323185] [2021-12-06 19:37:47,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:37:47,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:37:47,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:37:53,017 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 19:37:53,018 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:37:53,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20323185] [2021-12-06 19:37:53,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20323185] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:37:53,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402603207] [2021-12-06 19:37:53,018 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 19:37:53,018 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:37:53,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:37:53,019 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:37:53,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-06 19:37:53,087 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 19:37:53,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 19:37:53,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 74 conjunts are in the unsatisfiable core [2021-12-06 19:37:53,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:37:53,116 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-06 19:37:53,116 INFO L388 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 54 treesize of output 50 [2021-12-06 19:37:53,349 INFO L388 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 15 treesize of output 11 [2021-12-06 19:37:53,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:37:53,733 INFO L388 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 [2021-12-06 19:37:53,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:37:53,976 INFO L388 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 21 treesize of output 20 [2021-12-06 19:37:54,297 INFO L388 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 23 [2021-12-06 19:37:54,368 INFO L388 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 23 [2021-12-06 19:37:54,446 INFO L388 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 23 [2021-12-06 19:37:54,693 INFO L388 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 27 treesize of output 27 [2021-12-06 19:37:54,923 INFO L388 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 28 treesize of output 28 [2021-12-06 19:37:55,059 INFO L388 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 23 [2021-12-06 19:37:55,170 INFO L388 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 23 [2021-12-06 19:37:55,228 INFO L388 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 23 [2021-12-06 19:37:55,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:37:55,296 INFO L388 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 28 treesize of output 30 [2021-12-06 19:37:55,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:37:55,489 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 36 [2021-12-06 19:37:55,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:37:55,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:37:55,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:37:55,663 INFO L388 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 41 treesize of output 46 [2021-12-06 19:37:55,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:37:55,916 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 34 [2021-12-06 19:37:57,720 INFO L388 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 0 case distinctions, treesize of input 68 treesize of output 40 [2021-12-06 19:37:57,905 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-06 19:37:57,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:38:18,346 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 19:38:18,346 INFO L388 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 317 treesize of output 266 [2021-12-06 19:38:18,379 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_795 Int) (v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_3))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)) (.cse2 (store (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_3 |ULTIMATE.start_main_~#sum~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8) v_ArrVal_795))) (let ((.cse1 (+ (select .cse2 .cse3) (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse0 (select (store .cse2 .cse3 .cse1) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (mod (+ .cse0 1) (- 2)) 0)) (= .cse1 (+ 1 (* 2 (div (+ (* .cse0 (- 1)) 1) (- 2))))))))))) is different from false [2021-12-06 19:38:18,751 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_795 Int) (v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_785 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_785) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_3))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)) (.cse2 (store (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_3 |ULTIMATE.start_main_~#sum~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8) v_ArrVal_795))) (let ((.cse1 (+ (select .cse2 .cse3) (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse0 (select (store .cse2 .cse3 .cse1) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (mod (+ .cse0 1) (- 2)) 0)) (= (+ (* 2 (div (+ (* .cse0 (- 1)) 1) (- 2))) 1) .cse1))))))) is different from false [2021-12-06 19:38:18,955 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_795 Int) (v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_785 (Array Int Int))) (let ((.cse4 (store (store (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|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 8)) 1)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_785) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_3))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)) (.cse2 (store (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_3 |ULTIMATE.start_main_~#sum~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8) v_ArrVal_795))) (let ((.cse0 (+ (select .cse2 .cse3) (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse1 (select (store .cse2 .cse3 .cse0) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 (+ (* 2 (div (+ 1 (* .cse1 (- 1))) (- 2))) 1)) (not (= (mod (+ .cse1 1) (- 2)) 0)))))))) is different from false [2021-12-06 19:38:18,997 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_795 Int) (v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_785 (Array Int Int))) (let ((.cse4 (store (store (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|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 8) 8) 1)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_785) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_3))) (let ((.cse2 (store (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select v_arrayElimArr_3 |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8) v_ArrVal_795)) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16))) (let ((.cse1 (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse2 .cse3)))) (let ((.cse0 (select (store .cse2 .cse3 .cse1) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (+ (* 2 (div (+ (* .cse0 (- 1)) 1) (- 2))) 1) .cse1) (not (= (mod (+ .cse0 1) (- 2)) 0)))))))) is different from false [2021-12-06 19:38:19,040 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_795 Int) (v_ArrVal_780 Int) (v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_785 (Array Int Int))) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse6 (* |c_ULTIMATE.start_main_~i~0#1| 8))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse6) v_ArrVal_780) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse6 8) 1))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_785) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_3))) (let ((.cse2 (store (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_3 |ULTIMATE.start_main_~#sum~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8) v_ArrVal_795)) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16))) (let ((.cse0 (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse2 .cse3)))) (let ((.cse1 (select (store .cse2 .cse3 .cse0) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 (+ (* 2 (div (+ (* .cse1 (- 1)) 1) (- 2))) 1)) (not (= (mod (+ .cse1 1) (- 2)) 0)))))))) is different from false [2021-12-06 19:38:19,082 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_795 Int) (v_ArrVal_780 Int) (v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_785 (Array Int Int))) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse6 (* |c_ULTIMATE.start_main_~i~0#1| 8))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse6 8) v_ArrVal_780) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse6 16) 1))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_785) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_3))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)) (.cse2 (store (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_3 |ULTIMATE.start_main_~#sum~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8) v_ArrVal_795))) (let ((.cse1 (+ (select .cse2 .cse3) (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse0 (select (store .cse2 .cse3 .cse1) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (+ (* 2 (div (+ (* .cse0 (- 1)) 1) (- 2))) 1) .cse1) (not (= (mod (+ .cse0 1) (- 2)) 0)))))))) is different from false [2021-12-06 19:38:19,235 INFO L354 Elim1Store]: treesize reduction 132, result has 22.8 percent of original size [2021-12-06 19:38:19,236 INFO L388 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 865 treesize of output 371 [2021-12-06 19:38:19,248 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2829 treesize of output 2721 [2021-12-06 19:38:19,258 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:38:19,258 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:38:19,259 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:38:19,265 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:38:19,326 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 19:38:19,327 INFO L388 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 2506 treesize of output 2448 [2021-12-06 19:38:19,339 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:38:19,339 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:38:19,340 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:38:19,359 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:38:19,425 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 19:38:19,426 INFO L388 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 3354 treesize of output 2784 [2021-12-06 19:38:19,446 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:38:19,447 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:38:19,448 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:38:19,468 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:38:19,830 INFO L354 Elim1Store]: treesize reduction 29, result has 74.8 percent of original size [2021-12-06 19:38:19,830 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 1822 treesize of output 1806 [2021-12-06 19:38:24,643 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 20 not checked. [2021-12-06 19:38:24,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402603207] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:38:24,643 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:38:24,643 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 20, 23] total 67 [2021-12-06 19:38:24,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902643354] [2021-12-06 19:38:24,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:38:24,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2021-12-06 19:38:24,644 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:38:24,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2021-12-06 19:38:24,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=3370, Unknown=12, NotChecked=738, Total=4422 [2021-12-06 19:38:24,646 INFO L87 Difference]: Start difference. First operand 104 states and 110 transitions. Second operand has 67 states, 67 states have (on average 2.074626865671642) internal successors, (139), 67 states have internal predecessors, (139), 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) [2021-12-06 19:38:48,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:38:48,725 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2021-12-06 19:38:48,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-12-06 19:38:48,726 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 2.074626865671642) internal successors, (139), 67 states have internal predecessors, (139), 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 56 [2021-12-06 19:38:48,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:38:48,727 INFO L225 Difference]: With dead ends: 127 [2021-12-06 19:38:48,727 INFO L226 Difference]: Without dead ends: 82 [2021-12-06 19:38:48,728 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 85 SyntacticMatches, 27 SemanticMatches, 80 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 2311 ImplicationChecksByTransitivity, 47.8s TimeCoverageRelationStatistics Valid=496, Invalid=5214, Unknown=14, NotChecked=918, Total=6642 [2021-12-06 19:38:48,729 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 98 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 1561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 567 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2021-12-06 19:38:48,729 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 283 Invalid, 1561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 769 Invalid, 0 Unknown, 567 Unchecked, 2.6s Time] [2021-12-06 19:38:48,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-12-06 19:38:48,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2021-12-06 19:38:48,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.1333333333333333) internal successors, (85), 75 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) [2021-12-06 19:38:48,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2021-12-06 19:38:48,737 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 56 [2021-12-06 19:38:48,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:38:48,737 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2021-12-06 19:38:48,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 2.074626865671642) internal successors, (139), 67 states have internal predecessors, (139), 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) [2021-12-06 19:38:48,738 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2021-12-06 19:38:48,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-06 19:38:48,738 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:38:48,738 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:38:48,760 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-12-06 19:38:48,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:38:48,940 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:38:48,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:38:48,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1839482760, now seen corresponding path program 9 times [2021-12-06 19:38:48,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:38:48,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127532594] [2021-12-06 19:38:48,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:38:48,942 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:38:48,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:39:02,574 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 2 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:39:02,575 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:39:02,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127532594] [2021-12-06 19:39:02,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127532594] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:39:02,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176769373] [2021-12-06 19:39:02,575 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-06 19:39:02,575 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:39:02,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:39:02,576 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:39:02,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0198bc36-85f9-4c78-a74f-c9776886d4b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-06 19:39:02,780 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-12-06 19:39:02,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 19:39:02,783 WARN L261 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 149 conjunts are in the unsatisfiable core [2021-12-06 19:39:02,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:39:02,819 INFO L388 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 [2021-12-06 19:39:02,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:02,839 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-06 19:39:02,840 INFO L388 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 [2021-12-06 19:39:03,202 INFO L388 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 [2021-12-06 19:39:03,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:03,893 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-06 19:39:03,893 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2021-12-06 19:39:04,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:04,405 INFO L354 Elim1Store]: treesize reduction 94, result has 20.3 percent of original size [2021-12-06 19:39:04,405 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 39 treesize of output 44 [2021-12-06 19:39:05,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:05,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:05,233 INFO L354 Elim1Store]: treesize reduction 139, result has 14.7 percent of original size [2021-12-06 19:39:05,233 INFO L388 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 8 case distinctions, treesize of input 51 treesize of output 59 [2021-12-06 19:39:07,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:07,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:07,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:07,057 INFO L354 Elim1Store]: treesize reduction 95, result has 1.0 percent of original size [2021-12-06 19:39:07,058 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 62 treesize of output 73 [2021-12-06 19:39:08,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:08,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:08,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:08,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:08,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:08,052 INFO L354 Elim1Store]: treesize reduction 67, result has 1.5 percent of original size [2021-12-06 19:39:08,053 INFO L388 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 6 new quantified variables, introduced 7 case distinctions, treesize of input 67 treesize of output 81 [2021-12-06 19:39:08,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:08,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:08,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:08,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:08,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:08,755 INFO L354 Elim1Store]: treesize reduction 121, result has 12.3 percent of original size [2021-12-06 19:39:08,756 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 78 treesize of output 95 [2021-12-06 19:39:09,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:09,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:09,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:09,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:09,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:09,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:09,905 INFO L354 Elim1Store]: treesize reduction 149, result has 10.2 percent of original size [2021-12-06 19:39:09,905 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 7 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 11 case distinctions, treesize of input 90 treesize of output 110 [2021-12-06 19:39:12,263 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:39:12,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:12,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:12,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:12,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:12,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:12,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:12,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:12,411 INFO L354 Elim1Store]: treesize reduction 172, result has 14.0 percent of original size [2021-12-06 19:39:12,411 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 8 disjoint index pairs (out of 45 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 111 treesize of output 123 [2021-12-06 19:39:13,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:13,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:13,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:13,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:13,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:13,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:13,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:13,607 INFO L354 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2021-12-06 19:39:13,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 9 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 115 [2021-12-06 19:39:14,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:14,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:14,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:14,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:14,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:14,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:14,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:14,517 INFO L354 Elim1Store]: treesize reduction 277, result has 11.2 percent of original size [2021-12-06 19:39:14,517 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 8 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 18 case distinctions, treesize of input 123 treesize of output 132 [2021-12-06 19:39:15,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:15,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:15,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:15,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:15,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:15,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:15,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:15,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:15,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:15,840 INFO L354 Elim1Store]: treesize reduction 189, result has 0.5 percent of original size [2021-12-06 19:39:15,840 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 11 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 13 case distinctions, treesize of input 129 treesize of output 141 [2021-12-06 19:39:18,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:18,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:18,705 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:39:18,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:18,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:18,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:18,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:18,742 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:39:18,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:18,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:18,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:18,756 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:39:18,867 INFO L354 Elim1Store]: treesize reduction 172, result has 10.4 percent of original size [2021-12-06 19:39:18,868 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 8 disjoint index pairs (out of 66 index pairs), introduced 9 new quantified variables, introduced 19 case distinctions, treesize of input 131 treesize of output 122 [2021-12-06 19:39:20,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:20,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:20,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:20,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:20,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:20,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:20,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:20,422 INFO L354 Elim1Store]: treesize reduction 168, result has 10.6 percent of original size [2021-12-06 19:39:20,422 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 8 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 12 case distinctions, treesize of input 124 treesize of output 118 [2021-12-06 19:39:21,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:21,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:21,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:21,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:21,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:21,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:21,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:21,364 INFO L354 Elim1Store]: treesize reduction 223, result has 9.7 percent of original size [2021-12-06 19:39:21,364 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 8 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 16 case distinctions, treesize of input 124 treesize of output 133 [2021-12-06 19:39:22,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:22,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:22,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:22,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:22,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:22,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:22,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:22,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:22,900 INFO L354 Elim1Store]: treesize reduction 162, result has 0.6 percent of original size [2021-12-06 19:39:22,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 11 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 13 case distinctions, treesize of input 114 treesize of output 132 [2021-12-06 19:39:26,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:26,363 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:39:26,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:26,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:26,370 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:39:26,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:26,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:26,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:26,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:26,423 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:39:26,518 INFO L354 Elim1Store]: treesize reduction 154, result has 16.3 percent of original size [2021-12-06 19:39:26,518 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 8 disjoint index pairs (out of 66 index pairs), introduced 9 new quantified variables, introduced 17 case distinctions, treesize of input 127 treesize of output 127 [2021-12-06 19:39:28,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:28,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:28,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:28,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:28,292 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:39:28,298 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:39:28,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:28,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:28,312 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:39:28,313 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:39:28,538 INFO L354 Elim1Store]: treesize reduction 388, result has 15.1 percent of original size [2021-12-06 19:39:28,539 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 5 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 34 case distinctions, treesize of input 125 treesize of output 148 [2021-12-06 19:39:30,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:30,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:30,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:30,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:30,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:30,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:30,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:30,544 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:39:30,551 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:39:30,751 INFO L354 Elim1Store]: treesize reduction 301, result has 17.1 percent of original size [2021-12-06 19:39:30,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 7 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 25 case distinctions, treesize of input 138 treesize of output 148 [2021-12-06 19:39:32,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:32,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:32,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:32,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:32,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:32,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:32,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:32,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:32,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:32,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:32,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:32,734 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:39:32,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:32,739 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:39:32,900 INFO L354 Elim1Store]: treesize reduction 171, result has 26.6 percent of original size [2021-12-06 19:39:32,900 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 11 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 22 case distinctions, treesize of input 114 treesize of output 152 [2021-12-06 19:39:36,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:36,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:36,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:36,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:36,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:36,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:39:36,128 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-12-06 19:39:36,128 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 81 treesize of output 51 [2021-12-06 19:39:36,578 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 10 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:39:36,578 INFO L328 TraceCheckSpWp]: Computing backward predicates...