./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/s12if.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/s12if.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R --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 82bfc5dbe63d3250f02def4ff730c5e861bce4a7ef8a101c197bc29dbc0e3123 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 17:16:30,969 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:16:30,972 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:16:31,013 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:16:31,013 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:16:31,017 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:16:31,019 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:16:31,023 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:16:31,025 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:16:31,030 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:16:31,032 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:16:31,034 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:16:31,034 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:16:31,037 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:16:31,038 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:16:31,042 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:16:31,045 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:16:31,046 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:16:31,047 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:16:31,054 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:16:31,056 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:16:31,059 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:16:31,060 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:16:31,061 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:16:31,072 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:16:31,073 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:16:31,073 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:16:31,075 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:16:31,075 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:16:31,076 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:16:31,077 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:16:31,078 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:16:31,080 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:16:31,080 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:16:31,083 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:16:31,083 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:16:31,084 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:16:31,085 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:16:31,085 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:16:31,087 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:16:31,087 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:16:31,088 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 17:16:31,129 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:16:31,129 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:16:31,130 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:16:31,130 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:16:31,131 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:16:31,131 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:16:31,132 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:16:31,132 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:16:31,132 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:16:31,132 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:16:31,133 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:16:31,134 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:16:31,134 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:16:31,134 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:16:31,134 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 17:16:31,134 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:16:31,135 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 17:16:31,135 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:16:31,135 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:16:31,135 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:16:31,135 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 17:16:31,136 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:16:31,136 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:16:31,136 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:16:31,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:16:31,136 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:16:31,137 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:16:31,137 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 17:16:31,138 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:16:31,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:16:31,138 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:16:31,138 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 17:16:31,139 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:16:31,139 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:16:31,139 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/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_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R 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 -> 82bfc5dbe63d3250f02def4ff730c5e861bce4a7ef8a101c197bc29dbc0e3123 [2022-11-25 17:16:31,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:16:31,468 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:16:31,471 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:16:31,472 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:16:31,473 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:16:31,474 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/array-fpi/s12if.c [2022-11-25 17:16:34,462 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:16:34,751 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:16:34,752 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/sv-benchmarks/c/array-fpi/s12if.c [2022-11-25 17:16:34,760 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/data/cf9cf89c8/29e48a1b53584ac39478dd9e5ce721e6/FLAG2528d6d3b [2022-11-25 17:16:34,780 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/data/cf9cf89c8/29e48a1b53584ac39478dd9e5ce721e6 [2022-11-25 17:16:34,783 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:16:34,784 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:16:34,787 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:16:34,788 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:16:34,792 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:16:34,793 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:16:34" (1/1) ... [2022-11-25 17:16:34,794 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2614c539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:16:34, skipping insertion in model container [2022-11-25 17:16:34,794 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:16:34" (1/1) ... [2022-11-25 17:16:34,802 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:16:34,824 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:16:35,019 WARN L237 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_64fa439c-236d-43dd-ac6d-7a75267cc3ac/sv-benchmarks/c/array-fpi/s12if.c[588,601] [2022-11-25 17:16:35,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:16:35,066 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:16:35,079 WARN L237 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_64fa439c-236d-43dd-ac6d-7a75267cc3ac/sv-benchmarks/c/array-fpi/s12if.c[588,601] [2022-11-25 17:16:35,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:16:35,109 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:16:35,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:16:35 WrapperNode [2022-11-25 17:16:35,109 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:16:35,110 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:16:35,110 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:16:35,111 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:16:35,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:16:35" (1/1) ... [2022-11-25 17:16:35,124 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:16:35" (1/1) ... [2022-11-25 17:16:35,154 INFO L138 Inliner]: procedures = 17, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2022-11-25 17:16:35,154 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:16:35,155 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:16:35,155 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:16:35,155 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:16:35,163 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:16:35" (1/1) ... [2022-11-25 17:16:35,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:16:35" (1/1) ... [2022-11-25 17:16:35,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:16:35" (1/1) ... [2022-11-25 17:16:35,166 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:16:35" (1/1) ... [2022-11-25 17:16:35,172 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:16:35" (1/1) ... [2022-11-25 17:16:35,176 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:16:35" (1/1) ... [2022-11-25 17:16:35,177 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:16:35" (1/1) ... [2022-11-25 17:16:35,178 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:16:35" (1/1) ... [2022-11-25 17:16:35,180 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:16:35,181 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:16:35,181 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:16:35,182 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:16:35,183 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:16:35" (1/1) ... [2022-11-25 17:16:35,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:16:35,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:16:35,220 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:16:35,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:16:35,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:16:35,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:16:35,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:16:35,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 17:16:35,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 17:16:35,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:16:35,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:16:35,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 17:16:35,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:16:35,372 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:16:35,374 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:16:35,628 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:16:35,634 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:16:35,634 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-25 17:16:35,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:16:35 BoogieIcfgContainer [2022-11-25 17:16:35,637 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:16:35,639 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:16:35,639 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:16:35,650 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:16:35,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:16:34" (1/3) ... [2022-11-25 17:16:35,651 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c9870ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:16:35, skipping insertion in model container [2022-11-25 17:16:35,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:16:35" (2/3) ... [2022-11-25 17:16:35,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c9870ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:16:35, skipping insertion in model container [2022-11-25 17:16:35,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:16:35" (3/3) ... [2022-11-25 17:16:35,653 INFO L112 eAbstractionObserver]: Analyzing ICFG s12if.c [2022-11-25 17:16:35,693 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:16:35,694 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 17:16:35,756 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:16:35,762 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@f2a8db1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:16:35,763 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 17:16:35,766 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:16:35,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 17:16:35,772 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:16:35,772 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:16:35,773 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:16:35,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:16:35,777 INFO L85 PathProgramCache]: Analyzing trace with hash -845308063, now seen corresponding path program 1 times [2022-11-25 17:16:35,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:16:35,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335484047] [2022-11-25 17:16:35,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:16:35,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:16:35,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:16:35,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:16:35,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:16:35,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335484047] [2022-11-25 17:16:35,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335484047] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:16:35,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:16:35,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:16:35,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734488800] [2022-11-25 17:16:35,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:16:35,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 17:16:35,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:16:35,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 17:16:35,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:16:35,991 INFO L87 Difference]: Start difference. First operand has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:16:36,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:16:36,016 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2022-11-25 17:16:36,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 17:16:36,021 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-25 17:16:36,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:16:36,031 INFO L225 Difference]: With dead ends: 42 [2022-11-25 17:16:36,032 INFO L226 Difference]: Without dead ends: 19 [2022-11-25 17:16:36,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:16:36,038 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:16:36,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:16:36,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-11-25 17:16:36,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-11-25 17:16:36,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:16:36,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-11-25 17:16:36,072 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 13 [2022-11-25 17:16:36,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:16:36,072 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-11-25 17:16:36,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:16:36,073 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-11-25 17:16:36,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 17:16:36,073 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:16:36,073 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:16:36,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:16:36,074 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:16:36,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:16:36,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1238662774, now seen corresponding path program 1 times [2022-11-25 17:16:36,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:16:36,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233966164] [2022-11-25 17:16:36,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:16:36,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:16:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:16:36,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:16:36,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:16:36,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233966164] [2022-11-25 17:16:36,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233966164] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:16:36,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:16:36,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:16:36,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974295243] [2022-11-25 17:16:36,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:16:36,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:16:36,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:16:36,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:16:36,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:16:36,255 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:16:36,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:16:36,326 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2022-11-25 17:16:36,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:16:36,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-25 17:16:36,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:16:36,328 INFO L225 Difference]: With dead ends: 39 [2022-11-25 17:16:36,328 INFO L226 Difference]: Without dead ends: 27 [2022-11-25 17:16:36,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:16:36,330 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 35 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:16:36,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 11 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:16:36,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-25 17:16:36,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2022-11-25 17:16:36,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:16:36,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-11-25 17:16:36,336 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 13 [2022-11-25 17:16:36,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:16:36,337 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-11-25 17:16:36,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:16:36,337 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-11-25 17:16:36,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 17:16:36,338 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:16:36,338 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:16:36,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:16:36,339 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:16:36,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:16:36,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1944018757, now seen corresponding path program 1 times [2022-11-25 17:16:36,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:16:36,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464909678] [2022-11-25 17:16:36,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:16:36,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:16:36,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:16:37,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:16:37,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:16:37,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464909678] [2022-11-25 17:16:37,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464909678] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:16:37,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288490141] [2022-11-25 17:16:37,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:16:37,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:16:37,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:16:37,296 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:16:37,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 17:16:37,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:16:37,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-25 17:16:37,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:16:37,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-25 17:16:37,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 17:16:37,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:16:37,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:16:37,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-11-25 17:16:38,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 23 [2022-11-25 17:16:38,096 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:16:38,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:16:38,240 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_45 (Array Int Int))) (let ((.cse0 (select v_ArrVal_45 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (or (not (= 2 .cse0)) (= (* c_~N~0 2) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_45) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse0))))) is different from false [2022-11-25 17:16:38,431 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:16:38,432 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-25 17:16:38,438 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:16:38,441 INFO L350 Elim1Store]: Elim1 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 26 treesize of output 18 [2022-11-25 17:16:38,448 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 10 [2022-11-25 17:16:38,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-25 17:16:38,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288490141] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:16:38,526 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:16:38,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 23 [2022-11-25 17:16:38,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973709415] [2022-11-25 17:16:38,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:16:38,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-25 17:16:38,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:16:38,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-25 17:16:38,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=357, Unknown=1, NotChecked=40, Total=506 [2022-11-25 17:16:38,534 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:16:44,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:16:44,875 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2022-11-25 17:16:44,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 17:16:44,876 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 states have internal predecessors, (50), 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 21 [2022-11-25 17:16:44,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:16:44,877 INFO L225 Difference]: With dead ends: 52 [2022-11-25 17:16:44,877 INFO L226 Difference]: Without dead ends: 48 [2022-11-25 17:16:44,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=296, Invalid=893, Unknown=5, NotChecked=66, Total=1260 [2022-11-25 17:16:44,879 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 110 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 28 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 17:16:44,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 51 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 264 Invalid, 19 Unknown, 51 Unchecked, 0.6s Time] [2022-11-25 17:16:44,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-25 17:16:44,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2022-11-25 17:16:44,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:16:44,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2022-11-25 17:16:44,893 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 21 [2022-11-25 17:16:44,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:16:44,895 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2022-11-25 17:16:44,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:16:44,895 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-11-25 17:16:44,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 17:16:44,898 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:16:44,898 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:16:44,907 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-25 17:16:45,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:16:45,104 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:16:45,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:16:45,105 INFO L85 PathProgramCache]: Analyzing trace with hash 2001277059, now seen corresponding path program 1 times [2022-11-25 17:16:45,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:16:45,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193708142] [2022-11-25 17:16:45,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:16:45,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:16:45,134 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:16:45,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1834522174] [2022-11-25 17:16:45,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:16:45,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:16:45,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:16:45,136 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:16:45,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 17:16:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:16:45,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-25 17:16:45,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:16:45,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-25 17:16:45,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 17:16:45,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:16:45,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:16:45,492 INFO L350 Elim1Store]: Elim1 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 37 treesize of output 31 [2022-11-25 17:16:45,500 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 17:16:45,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 24 [2022-11-25 17:16:45,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:16:45,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:16:45,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193708142] [2022-11-25 17:16:45,522 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:16:45,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834522174] [2022-11-25 17:16:45,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834522174] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:16:45,522 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:16:45,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2022-11-25 17:16:45,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132920554] [2022-11-25 17:16:45,523 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:16:45,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 17:16:45,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:16:45,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 17:16:45,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-11-25 17:16:45,524 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:16:45,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:16:45,877 INFO L93 Difference]: Finished difference Result 76 states and 100 transitions. [2022-11-25 17:16:45,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 17:16:45,878 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 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 21 [2022-11-25 17:16:45,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:16:45,879 INFO L225 Difference]: With dead ends: 76 [2022-11-25 17:16:45,879 INFO L226 Difference]: Without dead ends: 64 [2022-11-25 17:16:45,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2022-11-25 17:16:45,880 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 42 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:16:45,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 54 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:16:45,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-25 17:16:45,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 48. [2022-11-25 17:16:45,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 47 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) [2022-11-25 17:16:45,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2022-11-25 17:16:45,895 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 62 transitions. Word has length 21 [2022-11-25 17:16:45,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:16:45,896 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 62 transitions. [2022-11-25 17:16:45,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:16:45,896 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions. [2022-11-25 17:16:45,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 17:16:45,897 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:16:45,897 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:16:45,911 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-25 17:16:46,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:16:46,103 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:16:46,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:16:46,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1649883961, now seen corresponding path program 1 times [2022-11-25 17:16:46,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:16:46,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482628004] [2022-11-25 17:16:46,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:16:46,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:16:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:16:46,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:16:46,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:16:46,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482628004] [2022-11-25 17:16:46,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482628004] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:16:46,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179428613] [2022-11-25 17:16:46,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:16:46,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:16:46,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:16:46,723 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:16:46,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 17:16:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:16:46,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 17:16:46,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:16:46,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 17:16:46,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 17:16:46,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:16:46,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:16:47,014 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 12 [2022-11-25 17:16:47,020 INFO L350 Elim1Store]: Elim1 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 [2022-11-25 17:16:47,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:16:47,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179428613] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:16:47,046 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:16:47,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 17 [2022-11-25 17:16:47,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593489550] [2022-11-25 17:16:47,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:16:47,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-25 17:16:47,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:16:47,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-25 17:16:47,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2022-11-25 17:16:47,049 INFO L87 Difference]: Start difference. First operand 48 states and 62 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 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) [2022-11-25 17:16:48,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:16:48,117 INFO L93 Difference]: Finished difference Result 75 states and 95 transitions. [2022-11-25 17:16:48,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 17:16:48,118 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 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 21 [2022-11-25 17:16:48,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:16:48,120 INFO L225 Difference]: With dead ends: 75 [2022-11-25 17:16:48,120 INFO L226 Difference]: Without dead ends: 63 [2022-11-25 17:16:48,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=257, Invalid=933, Unknown=0, NotChecked=0, Total=1190 [2022-11-25 17:16:48,122 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 60 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:16:48,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 72 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 17:16:48,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-25 17:16:48,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 49. [2022-11-25 17:16:48,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 48 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) [2022-11-25 17:16:48,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2022-11-25 17:16:48,134 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 21 [2022-11-25 17:16:48,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:16:48,135 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2022-11-25 17:16:48,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 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) [2022-11-25 17:16:48,135 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2022-11-25 17:16:48,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 17:16:48,136 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:16:48,136 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:16:48,147 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-25 17:16:48,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:16:48,341 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:16:48,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:16:48,342 INFO L85 PathProgramCache]: Analyzing trace with hash -823792505, now seen corresponding path program 2 times [2022-11-25 17:16:48,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:16:48,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642594124] [2022-11-25 17:16:48,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:16:48,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:16:48,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:16:48,460 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:16:48,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:16:48,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642594124] [2022-11-25 17:16:48,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642594124] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:16:48,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131787737] [2022-11-25 17:16:48,461 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:16:48,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:16:48,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:16:48,463 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:16:48,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 17:16:48,543 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 17:16:48,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:16:48,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 17:16:48,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:16:48,665 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:16:48,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:16:48,762 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:16:48,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131787737] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:16:48,762 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:16:48,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-25 17:16:48,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562001952] [2022-11-25 17:16:48,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:16:48,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 17:16:48,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:16:48,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 17:16:48,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:16:48,764 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:16:49,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:16:49,126 INFO L93 Difference]: Finished difference Result 85 states and 108 transitions. [2022-11-25 17:16:49,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 17:16:49,126 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-25 17:16:49,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:16:49,127 INFO L225 Difference]: With dead ends: 85 [2022-11-25 17:16:49,127 INFO L226 Difference]: Without dead ends: 75 [2022-11-25 17:16:49,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-11-25 17:16:49,129 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 42 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:16:49,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 34 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 17:16:49,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-25 17:16:49,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 53. [2022-11-25 17:16:49,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:16:49,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2022-11-25 17:16:49,143 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 23 [2022-11-25 17:16:49,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:16:49,144 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2022-11-25 17:16:49,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:16:49,144 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2022-11-25 17:16:49,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 17:16:49,145 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:16:49,145 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:16:49,160 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 17:16:49,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-25 17:16:49,351 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:16:49,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:16:49,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1832157868, now seen corresponding path program 3 times [2022-11-25 17:16:49,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:16:49,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576477093] [2022-11-25 17:16:49,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:16:49,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:16:49,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:16:49,457 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:16:49,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:16:49,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576477093] [2022-11-25 17:16:49,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576477093] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:16:49,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287533505] [2022-11-25 17:16:49,458 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 17:16:49,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:16:49,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:16:49,460 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:16:49,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 17:16:49,541 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-25 17:16:49,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:16:49,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 17:16:49,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:16:49,630 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:16:49,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:16:49,713 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:16:49,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287533505] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:16:49,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:16:49,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-25 17:16:49,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613912670] [2022-11-25 17:16:49,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:16:49,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 17:16:49,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:16:49,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 17:16:49,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:16:49,715 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:16:49,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:16:49,953 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2022-11-25 17:16:49,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 17:16:49,954 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-25 17:16:49,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:16:49,955 INFO L225 Difference]: With dead ends: 78 [2022-11-25 17:16:49,955 INFO L226 Difference]: Without dead ends: 42 [2022-11-25 17:16:49,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-11-25 17:16:49,956 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 25 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:16:49,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 32 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:16:49,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-25 17:16:49,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2022-11-25 17:16:49,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:16:49,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-11-25 17:16:49,967 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 24 [2022-11-25 17:16:49,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:16:49,968 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-11-25 17:16:49,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:16:49,968 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-11-25 17:16:49,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-25 17:16:49,969 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:16:49,969 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:16:49,980 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 17:16:50,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:16:50,176 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:16:50,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:16:50,177 INFO L85 PathProgramCache]: Analyzing trace with hash -14433298, now seen corresponding path program 4 times [2022-11-25 17:16:50,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:16:50,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396639574] [2022-11-25 17:16:50,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:16:50,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:16:50,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:16:51,529 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 17:16:51,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:16:51,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396639574] [2022-11-25 17:16:51,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396639574] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:16:51,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597016146] [2022-11-25 17:16:51,530 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 17:16:51,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:16:51,530 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:16:51,535 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:16:51,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 17:16:51,623 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 17:16:51,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:16:51,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-25 17:16:51,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:16:51,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-25 17:16:51,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 17:16:51,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:16:51,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:16:51,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:16:52,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:16:52,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-11-25 17:16:52,494 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 17:16:52,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2022-11-25 17:16:52,682 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 17:16:52,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 32 [2022-11-25 17:16:52,735 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:16:52,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:16:53,342 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_208 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_64| Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_208))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse1 (select v_ArrVal_208 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_64| 4))))) (or (= (+ .cse0 .cse1 .cse2) (* c_~N~0 2)) (not (= 2 .cse1)) (not (= 2 .cse2)))))))) is different from false [2022-11-25 17:16:53,379 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_208 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_64| Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_208))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse1 (select v_ArrVal_208 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_64| 4))))) (or (= (+ .cse0 .cse1 .cse2) (* c_~N~0 2)) (not (= 2 .cse1)) (not (= 2 .cse2)))))))) (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) is different from false [2022-11-25 17:16:54,706 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-25 17:16:54,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597016146] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:16:54,706 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:16:54,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 38 [2022-11-25 17:16:54,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476643497] [2022-11-25 17:16:54,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:16:54,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-25 17:16:54,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:16:54,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-25 17:16:54,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1126, Unknown=5, NotChecked=138, Total=1406 [2022-11-25 17:16:54,709 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 38 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:17:01,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:17:01,687 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions. [2022-11-25 17:17:01,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-25 17:17:01,688 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 38 states have internal predecessors, (73), 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 29 [2022-11-25 17:17:01,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:17:01,689 INFO L225 Difference]: With dead ends: 86 [2022-11-25 17:17:01,689 INFO L226 Difference]: Without dead ends: 82 [2022-11-25 17:17:01,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=454, Invalid=2848, Unknown=12, NotChecked=226, Total=3540 [2022-11-25 17:17:01,692 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 91 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 90 mSolverCounterUnsat, 24 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 24 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:17:01,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 168 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 809 Invalid, 24 Unknown, 123 Unchecked, 2.1s Time] [2022-11-25 17:17:01,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-25 17:17:01,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 65. [2022-11-25 17:17:01,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.28125) internal successors, (82), 64 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:17:01,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 82 transitions. [2022-11-25 17:17:01,711 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 82 transitions. Word has length 29 [2022-11-25 17:17:01,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:17:01,712 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 82 transitions. [2022-11-25 17:17:01,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 38 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:17:01,712 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2022-11-25 17:17:01,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-25 17:17:01,713 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:17:01,713 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:17:01,726 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 17:17:01,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-25 17:17:01,919 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:17:01,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:17:01,920 INFO L85 PathProgramCache]: Analyzing trace with hash 42825004, now seen corresponding path program 1 times [2022-11-25 17:17:01,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:17:01,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484541202] [2022-11-25 17:17:01,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:17:01,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:17:01,934 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:17:01,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1219166601] [2022-11-25 17:17:01,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:17:01,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:17:01,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:17:01,936 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:17:01,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 17:17:02,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:02,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-25 17:17:02,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:17:02,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-25 17:17:02,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:17:02,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 17:17:02,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 17:17:02,449 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 17:17:02,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:17:02,505 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_253 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_253) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) is different from false [2022-11-25 17:17:02,626 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:17:02,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 31 [2022-11-25 17:17:02,640 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:17:02,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 34 [2022-11-25 17:17:02,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 17:17:02,781 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2022-11-25 17:17:02,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:17:02,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484541202] [2022-11-25 17:17:02,782 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:17:02,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219166601] [2022-11-25 17:17:02,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219166601] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:17:02,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:17:02,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2022-11-25 17:17:02,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644868470] [2022-11-25 17:17:02,783 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:17:02,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-25 17:17:02,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:17:02,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-25 17:17:02,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=244, Unknown=2, NotChecked=32, Total=342 [2022-11-25 17:17:02,790 INFO L87 Difference]: Start difference. First operand 65 states and 82 transitions. Second operand has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 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) [2022-11-25 17:17:03,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:17:03,665 INFO L93 Difference]: Finished difference Result 116 states and 145 transitions. [2022-11-25 17:17:03,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 17:17:03,666 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 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) Word has length 29 [2022-11-25 17:17:03,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:17:03,667 INFO L225 Difference]: With dead ends: 116 [2022-11-25 17:17:03,667 INFO L226 Difference]: Without dead ends: 109 [2022-11-25 17:17:03,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=397, Unknown=2, NotChecked=42, Total=552 [2022-11-25 17:17:03,668 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 74 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 17:17:03,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 99 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 378 Invalid, 0 Unknown, 63 Unchecked, 0.6s Time] [2022-11-25 17:17:03,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-25 17:17:03,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 71. [2022-11-25 17:17:03,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 70 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) [2022-11-25 17:17:03,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 88 transitions. [2022-11-25 17:17:03,691 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 88 transitions. Word has length 29 [2022-11-25 17:17:03,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:17:03,691 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 88 transitions. [2022-11-25 17:17:03,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 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) [2022-11-25 17:17:03,692 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2022-11-25 17:17:03,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-25 17:17:03,693 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:17:03,693 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:17:03,707 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 17:17:03,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-25 17:17:03,899 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:17:03,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:17:03,899 INFO L85 PathProgramCache]: Analyzing trace with hash -968292246, now seen corresponding path program 1 times [2022-11-25 17:17:03,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:17:03,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007380975] [2022-11-25 17:17:03,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:17:03,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:17:03,921 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:17:03,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [559303054] [2022-11-25 17:17:03,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:17:03,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:17:03,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:17:03,925 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:17:03,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 17:17:04,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:04,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-25 17:17:04,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:17:04,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 17:17:04,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:17:04,143 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 24 [2022-11-25 17:17:04,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 17:17:04,193 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 17:17:04,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:17:04,273 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 14 [2022-11-25 17:17:04,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2022-11-25 17:17:04,323 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 17:17:04,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:17:04,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007380975] [2022-11-25 17:17:04,323 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:17:04,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559303054] [2022-11-25 17:17:04,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559303054] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:17:04,323 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:17:04,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2022-11-25 17:17:04,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187624077] [2022-11-25 17:17:04,324 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:17:04,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 17:17:04,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:17:04,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 17:17:04,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-11-25 17:17:04,326 INFO L87 Difference]: Start difference. First operand 71 states and 88 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:17:04,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:17:04,651 INFO L93 Difference]: Finished difference Result 115 states and 148 transitions. [2022-11-25 17:17:04,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 17:17:04,655 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 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 29 [2022-11-25 17:17:04,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:17:04,656 INFO L225 Difference]: With dead ends: 115 [2022-11-25 17:17:04,656 INFO L226 Difference]: Without dead ends: 84 [2022-11-25 17:17:04,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-11-25 17:17:04,658 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 11 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:17:04,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 66 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:17:04,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-25 17:17:04,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 73. [2022-11-25 17:17:04,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.25) internal successors, (90), 72 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:17:04,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2022-11-25 17:17:04,680 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 29 [2022-11-25 17:17:04,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:17:04,681 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2022-11-25 17:17:04,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:17:04,681 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2022-11-25 17:17:04,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-25 17:17:04,682 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:17:04,682 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:17:04,694 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-25 17:17:04,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:17:04,891 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:17:04,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:17:04,892 INFO L85 PathProgramCache]: Analyzing trace with hash -554569936, now seen corresponding path program 5 times [2022-11-25 17:17:04,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:17:04,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942873927] [2022-11-25 17:17:04,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:17:04,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:17:04,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:05,067 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 17:17:05,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:17:05,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942873927] [2022-11-25 17:17:05,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942873927] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:17:05,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580305057] [2022-11-25 17:17:05,068 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 17:17:05,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:17:05,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:17:05,071 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:17:05,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 17:17:05,205 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-11-25 17:17:05,205 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:17:05,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 17:17:05,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:17:05,362 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 17:17:05,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:17:05,470 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 17:17:05,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580305057] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:17:05,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:17:05,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-11-25 17:17:05,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820693611] [2022-11-25 17:17:05,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:17:05,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 17:17:05,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:17:05,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 17:17:05,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-11-25 17:17:05,473 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:17:05,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:17:05,939 INFO L93 Difference]: Finished difference Result 121 states and 151 transitions. [2022-11-25 17:17:05,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 17:17:05,940 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-25 17:17:05,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:17:05,940 INFO L225 Difference]: With dead ends: 121 [2022-11-25 17:17:05,940 INFO L226 Difference]: Without dead ends: 108 [2022-11-25 17:17:05,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 51 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-11-25 17:17:05,941 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 68 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:17:05,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 37 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 17:17:05,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-11-25 17:17:05,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 75. [2022-11-25 17:17:05,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 74 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:17:05,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 94 transitions. [2022-11-25 17:17:05,962 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 94 transitions. Word has length 31 [2022-11-25 17:17:05,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:17:05,962 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 94 transitions. [2022-11-25 17:17:05,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:17:05,963 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 94 transitions. [2022-11-25 17:17:05,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-25 17:17:05,963 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:17:05,964 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:17:05,975 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-25 17:17:06,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-25 17:17:06,170 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:17:06,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:17:06,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1053387787, now seen corresponding path program 6 times [2022-11-25 17:17:06,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:17:06,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314038985] [2022-11-25 17:17:06,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:17:06,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:17:06,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:06,353 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 17:17:06,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:17:06,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314038985] [2022-11-25 17:17:06,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314038985] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:17:06,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947869033] [2022-11-25 17:17:06,354 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-25 17:17:06,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:17:06,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:17:06,355 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:17:06,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 17:17:06,456 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-11-25 17:17:06,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:17:06,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 17:17:06,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:17:06,605 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 17:17:06,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:17:06,708 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 17:17:06,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947869033] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:17:06,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:17:06,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-11-25 17:17:06,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397017244] [2022-11-25 17:17:06,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:17:06,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 17:17:06,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:17:06,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 17:17:06,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-11-25 17:17:06,710 INFO L87 Difference]: Start difference. First operand 75 states and 94 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 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) [2022-11-25 17:17:06,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:17:06,960 INFO L93 Difference]: Finished difference Result 109 states and 133 transitions. [2022-11-25 17:17:06,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 17:17:06,961 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 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) Word has length 32 [2022-11-25 17:17:06,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:17:06,962 INFO L225 Difference]: With dead ends: 109 [2022-11-25 17:17:06,962 INFO L226 Difference]: Without dead ends: 53 [2022-11-25 17:17:06,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 53 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-11-25 17:17:06,963 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 54 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:17:06,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 30 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:17:06,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-25 17:17:06,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2022-11-25 17:17:06,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:17:06,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2022-11-25 17:17:06,985 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 32 [2022-11-25 17:17:06,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:17:06,985 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2022-11-25 17:17:06,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 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) [2022-11-25 17:17:06,985 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-11-25 17:17:06,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-25 17:17:06,988 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:17:06,988 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:17:06,999 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-25 17:17:07,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:17:07,194 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:17:07,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:17:07,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1383779305, now seen corresponding path program 7 times [2022-11-25 17:17:07,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:17:07,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398177460] [2022-11-25 17:17:07,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:17:07,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:17:07,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:08,862 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 17:17:08,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:17:08,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398177460] [2022-11-25 17:17:08,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398177460] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:17:08,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127906239] [2022-11-25 17:17:08,863 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 17:17:08,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:17:08,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:17:08,867 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:17:08,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-25 17:17:08,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:08,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-25 17:17:08,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:17:09,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-25 17:17:09,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 17:17:09,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:17:09,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:17:09,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:17:09,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:17:09,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:17:09,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:17:09,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-11-25 17:17:09,958 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 17:17:09,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2022-11-25 17:17:10,177 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 17:17:10,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-11-25 17:17:10,344 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 17:17:10,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 28 [2022-11-25 17:17:10,400 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 17:17:10,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:17:11,428 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_438 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_131| Int) (|v_ULTIMATE.start_main_~i~0#1_129| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select v_ArrVal_438 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_131| 4))))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_129| 4))))) (or (not (= .cse0 2)) (not (= .cse1 2)) (not (= .cse2 2)) (= (+ .cse0 .cse2 .cse1 .cse3) (* c_~N~0 2))))))))) is different from false [2022-11-25 17:17:12,764 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 17:17:12,764 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 407 treesize of output 1 [2022-11-25 17:17:12,765 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 5 not checked. [2022-11-25 17:17:12,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127906239] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:17:12,766 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:17:12,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 16] total 46 [2022-11-25 17:17:12,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809171389] [2022-11-25 17:17:12,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:17:12,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-25 17:17:12,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:17:12,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-25 17:17:12,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1782, Unknown=2, NotChecked=86, Total=2070 [2022-11-25 17:17:12,769 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 46 states, 46 states have (on average 1.826086956521739) internal successors, (84), 46 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:17:50,109 WARN L233 SmtUtils]: Spent 14.21s on a formula simplification. DAG size of input: 110 DAG size of output: 68 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:18:03,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:18:05,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:18:07,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:18:09,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2022-11-25 17:18:11,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2022-11-25 17:18:13,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2022-11-25 17:18:21,643 WARN L233 SmtUtils]: Spent 8.17s on a formula simplification. DAG size of input: 112 DAG size of output: 74 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:18:23,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:18:38,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:18:40,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2022-11-25 17:18:53,353 WARN L233 SmtUtils]: Spent 12.28s on a formula simplification. DAG size of input: 113 DAG size of output: 98 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:19:01,838 WARN L233 SmtUtils]: Spent 8.17s on a formula simplification. DAG size of input: 81 DAG size of output: 71 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:19:14,825 WARN L233 SmtUtils]: Spent 12.25s on a formula simplification. DAG size of input: 85 DAG size of output: 75 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:19:27,177 WARN L233 SmtUtils]: Spent 12.25s on a formula simplification. DAG size of input: 85 DAG size of output: 75 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:19:43,570 WARN L233 SmtUtils]: Spent 14.27s on a formula simplification. DAG size of input: 104 DAG size of output: 67 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:19:46,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:19:48,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:19:50,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:19:52,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2022-11-25 17:19:54,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2022-11-25 17:19:56,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2022-11-25 17:19:57,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:19:57,268 INFO L93 Difference]: Finished difference Result 132 states and 158 transitions. [2022-11-25 17:19:57,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-25 17:19:57,269 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.826086956521739) internal successors, (84), 46 states have internal predecessors, (84), 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 37 [2022-11-25 17:19:57,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:19:57,270 INFO L225 Difference]: With dead ends: 132 [2022-11-25 17:19:57,270 INFO L226 Difference]: Without dead ends: 128 [2022-11-25 17:19:57,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 88 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2199 ImplicationChecksByTransitivity, 133.8s TimeCoverageRelationStatistics Valid=979, Invalid=6847, Unknown=10, NotChecked=174, Total=8010 [2022-11-25 17:19:57,274 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 162 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 1578 mSolverCounterSat, 139 mSolverCounterUnsat, 31 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 1809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1578 IncrementalHoareTripleChecker+Invalid, 31 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 33.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:19:57,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 233 Invalid, 1809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1578 Invalid, 31 Unknown, 61 Unchecked, 33.5s Time] [2022-11-25 17:19:57,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-11-25 17:19:57,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 93. [2022-11-25 17:19:57,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.25) internal successors, (115), 92 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:19:57,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 115 transitions. [2022-11-25 17:19:57,306 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 115 transitions. Word has length 37 [2022-11-25 17:19:57,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:19:57,306 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 115 transitions. [2022-11-25 17:19:57,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.826086956521739) internal successors, (84), 46 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:19:57,306 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 115 transitions. [2022-11-25 17:19:57,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-25 17:19:57,307 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:19:57,307 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:19:57,315 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-25 17:19:57,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-25 17:19:57,513 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:19:57,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:19:57,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1441037607, now seen corresponding path program 2 times [2022-11-25 17:19:57,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:19:57,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388903344] [2022-11-25 17:19:57,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:19:57,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:19:57,528 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:19:57,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1365149177] [2022-11-25 17:19:57,528 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:19:57,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:19:57,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:19:57,529 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:19:57,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-25 17:19:57,641 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 17:19:57,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:19:57,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-25 17:19:57,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:19:57,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-25 17:19:58,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:19:58,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 17:19:58,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:19:58,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 17:19:58,254 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:19:58,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-25 17:19:58,379 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:19:58,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:20:03,973 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:20:03,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 33 [2022-11-25 17:20:04,008 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:20:04,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 38 [2022-11-25 17:20:04,016 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 7 [2022-11-25 17:20:04,603 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:20:04,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:20:04,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388903344] [2022-11-25 17:20:04,604 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:20:04,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365149177] [2022-11-25 17:20:04,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365149177] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:20:04,604 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:20:04,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2022-11-25 17:20:04,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333408663] [2022-11-25 17:20:04,605 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:20:04,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-25 17:20:04,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:20:04,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-25 17:20:04,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=914, Unknown=7, NotChecked=0, Total=1122 [2022-11-25 17:20:04,607 INFO L87 Difference]: Start difference. First operand 93 states and 115 transitions. Second operand has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 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) [2022-11-25 17:20:08,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:20:08,285 INFO L93 Difference]: Finished difference Result 263 states and 341 transitions. [2022-11-25 17:20:08,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-25 17:20:08,285 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 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) Word has length 37 [2022-11-25 17:20:08,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:20:08,287 INFO L225 Difference]: With dead ends: 263 [2022-11-25 17:20:08,287 INFO L226 Difference]: Without dead ends: 256 [2022-11-25 17:20:08,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 801 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=678, Invalid=2507, Unknown=7, NotChecked=0, Total=3192 [2022-11-25 17:20:08,290 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 351 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:20:08,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 104 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-25 17:20:08,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-11-25 17:20:08,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 157. [2022-11-25 17:20:08,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.3012820512820513) internal successors, (203), 156 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:08,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 203 transitions. [2022-11-25 17:20:08,346 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 203 transitions. Word has length 37 [2022-11-25 17:20:08,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:20:08,346 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 203 transitions. [2022-11-25 17:20:08,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 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) [2022-11-25 17:20:08,347 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 203 transitions. [2022-11-25 17:20:08,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-25 17:20:08,348 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:20:08,348 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:20:08,359 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-25 17:20:08,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-25 17:20:08,559 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:20:08,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:20:08,559 INFO L85 PathProgramCache]: Analyzing trace with hash -147310295, now seen corresponding path program 2 times [2022-11-25 17:20:08,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:20:08,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714540898] [2022-11-25 17:20:08,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:20:08,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:20:08,575 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:20:08,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1596939169] [2022-11-25 17:20:08,576 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:20:08,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:20:08,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:20:08,577 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:20:08,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-25 17:20:08,701 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 17:20:08,701 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:20:08,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-25 17:20:08,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:20:08,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 17:20:08,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:20:08,871 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 24 [2022-11-25 17:20:08,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:20:08,943 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 24 [2022-11-25 17:20:08,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 17:20:09,014 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 17:20:09,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:20:09,154 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 14 [2022-11-25 17:20:09,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2022-11-25 17:20:09,248 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 17:20:09,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:20:09,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714540898] [2022-11-25 17:20:09,249 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:20:09,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596939169] [2022-11-25 17:20:09,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596939169] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:20:09,249 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:20:09,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2022-11-25 17:20:09,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922695891] [2022-11-25 17:20:09,250 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:20:09,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-25 17:20:09,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:20:09,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-25 17:20:09,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-11-25 17:20:09,251 INFO L87 Difference]: Start difference. First operand 157 states and 203 transitions. Second operand has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:09,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:20:09,893 INFO L93 Difference]: Finished difference Result 276 states and 365 transitions. [2022-11-25 17:20:09,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 17:20:09,894 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-11-25 17:20:09,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:20:09,895 INFO L225 Difference]: With dead ends: 276 [2022-11-25 17:20:09,895 INFO L226 Difference]: Without dead ends: 187 [2022-11-25 17:20:09,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2022-11-25 17:20:09,897 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:20:09,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 82 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:20:09,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-11-25 17:20:09,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 157. [2022-11-25 17:20:09,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.2884615384615385) internal successors, (201), 156 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:09,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 201 transitions. [2022-11-25 17:20:09,950 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 201 transitions. Word has length 37 [2022-11-25 17:20:09,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:20:09,950 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 201 transitions. [2022-11-25 17:20:09,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:09,951 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 201 transitions. [2022-11-25 17:20:09,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-25 17:20:09,952 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:20:09,952 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:20:09,959 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-25 17:20:10,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-25 17:20:10,152 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:20:10,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:20:10,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1016239403, now seen corresponding path program 8 times [2022-11-25 17:20:10,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:20:10,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040573624] [2022-11-25 17:20:10,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:20:10,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:20:10,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:20:10,389 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 17:20:10,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:20:10,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040573624] [2022-11-25 17:20:10,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040573624] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:20:10,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118920677] [2022-11-25 17:20:10,389 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:20:10,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:20:10,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:20:10,391 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:20:10,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-25 17:20:10,509 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 17:20:10,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:20:10,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 17:20:10,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:20:10,727 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 17:20:10,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:20:10,892 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 17:20:10,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118920677] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:20:10,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:20:10,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-11-25 17:20:10,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186186876] [2022-11-25 17:20:10,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:20:10,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-25 17:20:10,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:20:10,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-25 17:20:10,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-11-25 17:20:10,894 INFO L87 Difference]: Start difference. First operand 157 states and 201 transitions. Second operand has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:11,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:20:11,639 INFO L93 Difference]: Finished difference Result 212 states and 274 transitions. [2022-11-25 17:20:11,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 17:20:11,640 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 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 39 [2022-11-25 17:20:11,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:20:11,641 INFO L225 Difference]: With dead ends: 212 [2022-11-25 17:20:11,641 INFO L226 Difference]: Without dead ends: 196 [2022-11-25 17:20:11,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 64 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-11-25 17:20:11,643 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 84 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:20:11,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 39 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:20:11,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-11-25 17:20:11,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 108. [2022-11-25 17:20:11,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.2429906542056075) internal successors, (133), 107 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) [2022-11-25 17:20:11,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 133 transitions. [2022-11-25 17:20:11,689 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 133 transitions. Word has length 39 [2022-11-25 17:20:11,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:20:11,690 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 133 transitions. [2022-11-25 17:20:11,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:11,690 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 133 transitions. [2022-11-25 17:20:11,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-25 17:20:11,691 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:20:11,692 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:20:11,703 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-25 17:20:11,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-25 17:20:11,897 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:20:11,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:20:11,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1682760144, now seen corresponding path program 9 times [2022-11-25 17:20:11,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:20:11,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113763897] [2022-11-25 17:20:11,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:20:11,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:20:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:20:12,114 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 17:20:12,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:20:12,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113763897] [2022-11-25 17:20:12,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113763897] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:20:12,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310161291] [2022-11-25 17:20:12,115 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 17:20:12,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:20:12,115 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:20:12,117 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:20:12,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-25 17:20:12,262 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-25 17:20:12,262 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:20:12,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 17:20:12,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:20:12,470 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 17:20:12,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:20:12,634 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 17:20:12,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310161291] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:20:12,634 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:20:12,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-11-25 17:20:12,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477333187] [2022-11-25 17:20:12,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:20:12,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-25 17:20:12,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:20:12,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-25 17:20:12,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-11-25 17:20:12,636 INFO L87 Difference]: Start difference. First operand 108 states and 133 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) [2022-11-25 17:20:13,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:20:13,004 INFO L93 Difference]: Finished difference Result 137 states and 167 transitions. [2022-11-25 17:20:13,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 17:20:13,005 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 40 [2022-11-25 17:20:13,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:20:13,005 INFO L225 Difference]: With dead ends: 137 [2022-11-25 17:20:13,005 INFO L226 Difference]: Without dead ends: 61 [2022-11-25 17:20:13,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 66 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2022-11-25 17:20:13,007 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 52 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:20:13,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 41 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 17:20:13,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-25 17:20:13,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2022-11-25 17:20:13,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 54 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:13,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2022-11-25 17:20:13,027 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 40 [2022-11-25 17:20:13,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:20:13,027 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2022-11-25 17:20:13,028 INFO L496 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) [2022-11-25 17:20:13,028 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2022-11-25 17:20:13,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-25 17:20:13,028 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:20:13,029 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:20:13,045 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-25 17:20:13,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-25 17:20:13,239 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:20:13,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:20:13,239 INFO L85 PathProgramCache]: Analyzing trace with hash -2111860654, now seen corresponding path program 10 times [2022-11-25 17:20:13,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:20:13,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630452807] [2022-11-25 17:20:13,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:20:13,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:20:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:20:15,225 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-25 17:20:15,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:20:15,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630452807] [2022-11-25 17:20:15,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630452807] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:20:15,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332629386] [2022-11-25 17:20:15,225 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 17:20:15,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:20:15,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:20:15,227 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:20:15,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-25 17:20:15,369 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 17:20:15,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:20:15,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-25 17:20:15,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:20:15,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 17:20:15,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-25 17:20:15,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:20:15,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:20:15,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:20:15,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:20:15,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:20:15,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:20:15,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:20:15,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:20:16,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-11-25 17:20:16,225 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 17:20:16,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2022-11-25 17:20:16,450 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-25 17:20:16,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 59 [2022-11-25 17:20:16,708 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-25 17:20:16,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 60 [2022-11-25 17:20:16,908 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-25 17:20:16,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:20:19,137 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_224| Int) (|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_226| Int) (v_ArrVal_736 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_228| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_736))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (select v_ArrVal_736 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_228| 4))))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse0 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_226| 4))))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse0 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_224| 4))))) (or (not (= .cse0 2)) (= (* c_~N~0 2) (+ .cse1 .cse2 .cse0 .cse3 .cse4)) (not (= 2 .cse4)) (not (= 2 .cse3)) (not (= .cse2 2)))))))))) is different from false [2022-11-25 17:20:21,447 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (* 2 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_236| Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse0 (select v_ArrVal_736 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_236| 4))))) (or (not (= 2 .cse0)) (forall ((|v_ULTIMATE.start_main_~i~0#1_228| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_736))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_228| 4))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_226| Int)) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_226| 4))))) (or (not (= 2 .cse1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_224| Int)) (let ((.cse2 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse1 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_224| 4))))) (or (not (= 2 .cse2)) (< (+ .cse3 1) (+ .cse4 .cse5 .cse1 .cse0 .cse2)))))))) (not (= .cse5 2))))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_236| Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse8 (select v_ArrVal_736 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_236| 4))))) (or (not (= 2 .cse8)) (forall ((|v_ULTIMATE.start_main_~i~0#1_228| Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_736))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse11 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse9 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_228| 4))))) (or (not (= .cse9 2)) (forall ((|v_ULTIMATE.start_main_~i~0#1_226| Int)) (let ((.cse10 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse9 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_226| 4))))) (or (not (= 2 .cse10)) (forall ((|v_ULTIMATE.start_main_~i~0#1_224| Int)) (let ((.cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse9 .cse10 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_224| 4))))) (or (< (+ .cse11 .cse9 .cse10 .cse8 .cse12) (+ .cse3 3)) (not (= 2 .cse12))))))))))))))))))) is different from false [2022-11-25 17:20:21,570 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (* 2 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_236| Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse3 (select v_ArrVal_736 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_236| 4))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_228| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_736))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_228| 4))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_226| Int)) (let ((.cse2 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_226| 4))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_224| Int)) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_224| 4))))) (or (< (+ .cse0 .cse1 .cse2 .cse3 .cse4) (+ .cse5 5)) (not (= 2 .cse4))))) (not (= 2 .cse2))))) (not (= .cse1 2)))))))) (not (= 2 .cse3))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_236| Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse8 (select v_ArrVal_736 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_236| 4))))) (or (not (= 2 .cse8)) (forall ((|v_ULTIMATE.start_main_~i~0#1_228| Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_736))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse9 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_228| 4))))) (or (not (= .cse9 2)) (forall ((|v_ULTIMATE.start_main_~i~0#1_226| Int)) (let ((.cse11 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse9 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_226| 4))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_224| Int)) (let ((.cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse9 .cse11 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_224| 4))))) (or (< (+ .cse5 3) (+ .cse10 .cse9 .cse11 .cse8 .cse12)) (not (= 2 .cse12))))) (not (= 2 .cse11)))))))))))))))) is different from false [2022-11-25 17:20:21,792 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* 2 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_236| Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse5 (select v_ArrVal_736 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_236| 4))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_228| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_736))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_228| 4))))) (or (not (= .cse0 2)) (forall ((|v_ULTIMATE.start_main_~i~0#1_226| Int)) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_226| 4))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_224| Int)) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_224| 4))))) (or (not (= 2 .cse1)) (< (+ .cse2 5) (+ .cse3 .cse0 .cse4 .cse5 .cse1))))) (not (= 2 .cse4))))))))))) (not (= 2 .cse5))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_236| Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse12 (select v_ArrVal_736 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_236| 4))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_228| Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_736))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse11 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_228| 4))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_226| Int)) (let ((.cse8 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_226| 4))))) (or (not (= 2 .cse8)) (forall ((|v_ULTIMATE.start_main_~i~0#1_224| Int)) (let ((.cse9 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse8 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_224| 4))))) (or (not (= 2 .cse9)) (< (+ .cse10 .cse11 .cse8 .cse12 .cse9) (+ .cse2 7)))))))) (not (= .cse11 2)))))))) (not (= 2 .cse12))))))) is different from false [2022-11-25 17:20:22,006 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (* 2 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_236| Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse0 (select v_ArrVal_736 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_236| 4))))) (or (not (= 2 .cse0)) (forall ((|v_ULTIMATE.start_main_~i~0#1_228| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_736))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_228| 4))))) (or (not (= .cse1 2)) (forall ((|v_ULTIMATE.start_main_~i~0#1_226| Int)) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse1 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_226| 4))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_224| Int)) (let ((.cse2 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse1 .cse5 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_224| 4))))) (or (not (= 2 .cse2)) (< (+ .cse3 7) (+ .cse4 .cse1 .cse5 .cse0 .cse2))))) (not (= 2 .cse5)))))))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_236| Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse12 (select v_ArrVal_736 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_236| 4))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_228| Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_736))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse9 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_228| 4))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_226| Int)) (let ((.cse11 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_226| 4))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_224| Int)) (let ((.cse8 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_224| 4))))) (or (not (= 2 .cse8)) (< (+ .cse9 .cse10 .cse11 .cse12 .cse8) (+ .cse3 9))))) (not (= 2 .cse11))))) (not (= .cse10 2)))))))) (not (= 2 .cse12))))))) is different from false [2022-11-25 17:20:22,185 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 23 not checked. [2022-11-25 17:20:22,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332629386] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:20:22,185 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:20:22,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 19] total 52 [2022-11-25 17:20:22,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407563431] [2022-11-25 17:20:22,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:20:22,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-25 17:20:22,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:20:22,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-25 17:20:22,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1992, Unknown=5, NotChecked=470, Total=2652 [2022-11-25 17:20:22,188 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 52 states, 52 states have (on average 1.7692307692307692) internal successors, (92), 52 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:41,882 WARN L233 SmtUtils]: Spent 6.25s on a formula simplification. DAG size of input: 66 DAG size of output: 59 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:20:43,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:20:45,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:20:47,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:20:49,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:20:51,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:20:58,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:21:01,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2022-11-25 17:21:15,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:21:15,000 INFO L93 Difference]: Finished difference Result 155 states and 181 transitions. [2022-11-25 17:21:15,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-25 17:21:15,001 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.7692307692307692) internal successors, (92), 52 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-25 17:21:15,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:21:15,002 INFO L225 Difference]: With dead ends: 155 [2022-11-25 17:21:15,002 INFO L226 Difference]: Without dead ends: 151 [2022-11-25 17:21:15,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 67 SyntacticMatches, 9 SemanticMatches, 84 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1846 ImplicationChecksByTransitivity, 40.0s TimeCoverageRelationStatistics Valid=650, Invalid=5842, Unknown=8, NotChecked=810, Total=7310 [2022-11-25 17:21:15,004 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 65 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 1598 mSolverCounterSat, 104 mSolverCounterUnsat, 45 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 2185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1598 IncrementalHoareTripleChecker+Invalid, 45 IncrementalHoareTripleChecker+Unknown, 438 IncrementalHoareTripleChecker+Unchecked, 17.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:21:15,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 314 Invalid, 2185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1598 Invalid, 45 Unknown, 438 Unchecked, 17.4s Time] [2022-11-25 17:21:15,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-25 17:21:15,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 118. [2022-11-25 17:21:15,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.2478632478632479) internal successors, (146), 117 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:21:15,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 146 transitions. [2022-11-25 17:21:15,051 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 146 transitions. Word has length 45 [2022-11-25 17:21:15,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:21:15,052 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 146 transitions. [2022-11-25 17:21:15,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.7692307692307692) internal successors, (92), 52 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:21:15,052 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 146 transitions. [2022-11-25 17:21:15,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-25 17:21:15,053 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:21:15,053 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:21:15,063 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-25 17:21:15,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:21:15,259 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:21:15,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:21:15,259 INFO L85 PathProgramCache]: Analyzing trace with hash -2054602352, now seen corresponding path program 3 times [2022-11-25 17:21:15,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:21:15,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159110094] [2022-11-25 17:21:15,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:21:15,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:21:15,271 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:21:15,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1719294978] [2022-11-25 17:21:15,271 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 17:21:15,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:21:15,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:21:15,273 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:21:15,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-25 17:21:15,430 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-25 17:21:15,430 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:21:15,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-25 17:21:15,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:21:15,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2022-11-25 17:21:15,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:21:15,669 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 20 [2022-11-25 17:21:15,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:21:15,716 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 20 [2022-11-25 17:21:15,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:21:15,772 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 20 [2022-11-25 17:21:15,833 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:21:15,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2022-11-25 17:21:15,911 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-25 17:21:15,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:21:16,052 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_811 (Array Int Int))) (or (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) c_~N~0) (not (< |ULTIMATE.start_main_~i~0#1| c_~N~0)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_811) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 2))) is different from false [2022-11-25 17:21:16,354 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:21:16,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 33 [2022-11-25 17:21:16,366 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-25 17:21:16,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 30 [2022-11-25 17:21:16,424 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 35 trivial. 13 not checked. [2022-11-25 17:21:16,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:21:16,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159110094] [2022-11-25 17:21:16,425 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:21:16,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719294978] [2022-11-25 17:21:16,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719294978] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:21:16,425 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:21:16,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2022-11-25 17:21:16,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374126683] [2022-11-25 17:21:16,426 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:21:16,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-25 17:21:16,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:21:16,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-25 17:21:16,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=207, Unknown=2, NotChecked=30, Total=306 [2022-11-25 17:21:16,427 INFO L87 Difference]: Start difference. First operand 118 states and 146 transitions. Second operand has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:21:17,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:21:17,331 INFO L93 Difference]: Finished difference Result 192 states and 242 transitions. [2022-11-25 17:21:17,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 17:21:17,332 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-25 17:21:17,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:21:17,333 INFO L225 Difference]: With dead ends: 192 [2022-11-25 17:21:17,333 INFO L226 Difference]: Without dead ends: 188 [2022-11-25 17:21:17,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 70 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=167, Invalid=435, Unknown=2, NotChecked=46, Total=650 [2022-11-25 17:21:17,334 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 42 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:21:17,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 42 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 197 Invalid, 0 Unknown, 31 Unchecked, 0.3s Time] [2022-11-25 17:21:17,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-11-25 17:21:17,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 169. [2022-11-25 17:21:17,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.2857142857142858) internal successors, (216), 168 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:21:17,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 216 transitions. [2022-11-25 17:21:17,405 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 216 transitions. Word has length 45 [2022-11-25 17:21:17,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:21:17,405 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 216 transitions. [2022-11-25 17:21:17,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:21:17,405 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 216 transitions. [2022-11-25 17:21:17,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-25 17:21:17,406 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:21:17,406 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:21:17,415 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-11-25 17:21:17,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:21:17,612 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:21:17,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:21:17,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1431802284, now seen corresponding path program 4 times [2022-11-25 17:21:17,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:21:17,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479162128] [2022-11-25 17:21:17,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:21:17,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:21:17,625 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:21:17,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1684680308] [2022-11-25 17:21:17,625 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 17:21:17,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:21:17,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:21:17,627 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:21:17,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-25 17:21:17,787 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 17:21:17,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:21:17,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-25 17:21:17,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:21:17,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-25 17:21:17,920 INFO L350 Elim1Store]: Elim1 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 37 treesize of output 17 [2022-11-25 17:21:17,994 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-25 17:21:17,994 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 25 treesize of output 24 [2022-11-25 17:21:18,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 17:21:18,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 17:21:18,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-25 17:21:18,228 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 13 proven. 29 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-25 17:21:18,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:21:18,292 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_880 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 2)) is different from false [2022-11-25 17:21:18,783 INFO L350 Elim1Store]: Elim1 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 58 treesize of output 52 [2022-11-25 17:21:18,797 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:21:18,797 INFO L350 Elim1Store]: Elim1 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 164 treesize of output 148 [2022-11-25 17:21:18,919 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 13 proven. 25 refuted. 0 times theorem prover too weak. 18 trivial. 4 not checked. [2022-11-25 17:21:18,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:21:18,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479162128] [2022-11-25 17:21:18,919 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:21:18,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684680308] [2022-11-25 17:21:18,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684680308] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:21:18,920 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:21:18,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2022-11-25 17:21:18,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909986420] [2022-11-25 17:21:18,920 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:21:18,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-25 17:21:18,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:21:18,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-25 17:21:18,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=346, Unknown=1, NotChecked=38, Total=462 [2022-11-25 17:21:18,921 INFO L87 Difference]: Start difference. First operand 169 states and 216 transitions. Second operand has 22 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 22 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:21:19,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:21:19,671 INFO L93 Difference]: Finished difference Result 202 states and 263 transitions. [2022-11-25 17:21:19,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 17:21:19,672 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 22 states have internal predecessors, (51), 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 45 [2022-11-25 17:21:19,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:21:19,673 INFO L225 Difference]: With dead ends: 202 [2022-11-25 17:21:19,673 INFO L226 Difference]: Without dead ends: 162 [2022-11-25 17:21:19,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=93, Invalid=416, Unknown=1, NotChecked=42, Total=552 [2022-11-25 17:21:19,674 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 44 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:21:19,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 59 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 466 Invalid, 0 Unknown, 43 Unchecked, 0.5s Time] [2022-11-25 17:21:19,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-11-25 17:21:19,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2022-11-25 17:21:19,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 1.2264150943396226) internal successors, (195), 159 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:21:19,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 195 transitions. [2022-11-25 17:21:19,761 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 195 transitions. Word has length 45 [2022-11-25 17:21:19,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:21:19,761 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 195 transitions. [2022-11-25 17:21:19,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 22 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:21:19,762 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 195 transitions. [2022-11-25 17:21:19,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-25 17:21:19,762 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:21:19,762 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:21:19,767 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-25 17:21:19,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:21:19,963 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:21:19,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:21:19,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1422716494, now seen corresponding path program 3 times [2022-11-25 17:21:19,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:21:19,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537416557] [2022-11-25 17:21:19,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:21:19,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:21:19,975 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:21:19,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2140811575] [2022-11-25 17:21:19,976 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 17:21:19,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:21:19,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:21:19,977 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:21:19,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-25 17:21:20,149 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-25 17:21:20,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:21:20,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-25 17:21:20,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:21:20,221 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 11 [2022-11-25 17:21:20,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:21:20,431 INFO L350 Elim1Store]: Elim1 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 26 [2022-11-25 17:21:20,580 INFO L321 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-11-25 17:21:20,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 34 [2022-11-25 17:21:20,720 INFO L321 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-11-25 17:21:20,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 47 [2022-11-25 17:21:20,888 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:21:20,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 32 [2022-11-25 17:21:21,198 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 20 proven. 38 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 17:21:21,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:21:45,117 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 23 [2022-11-25 17:21:45,123 INFO L350 Elim1Store]: Elim1 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 68 treesize of output 62 [2022-11-25 17:21:45,134 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 29 proven. 22 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 17:21:45,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:21:45,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537416557] [2022-11-25 17:21:45,134 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:21:45,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140811575] [2022-11-25 17:21:45,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140811575] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:21:45,135 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:21:45,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 36 [2022-11-25 17:21:45,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281262226] [2022-11-25 17:21:45,135 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:21:45,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-25 17:21:45,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:21:45,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-25 17:21:45,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=979, Unknown=5, NotChecked=0, Total=1260 [2022-11-25 17:21:45,137 INFO L87 Difference]: Start difference. First operand 160 states and 195 transitions. Second operand has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 36 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:21:47,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:21:47,353 INFO L93 Difference]: Finished difference Result 164 states and 198 transitions. [2022-11-25 17:21:47,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-25 17:21:47,355 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 36 states have internal predecessors, (75), 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 45 [2022-11-25 17:21:47,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:21:47,356 INFO L225 Difference]: With dead ends: 164 [2022-11-25 17:21:47,356 INFO L226 Difference]: Without dead ends: 115 [2022-11-25 17:21:47,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1082 ImplicationChecksByTransitivity, 25.5s TimeCoverageRelationStatistics Valid=759, Invalid=2658, Unknown=5, NotChecked=0, Total=3422 [2022-11-25 17:21:47,357 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 98 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 17:21:47,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 41 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 17:21:47,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-25 17:21:47,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-11-25 17:21:47,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 114 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:21:47,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 136 transitions. [2022-11-25 17:21:47,399 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 136 transitions. Word has length 45 [2022-11-25 17:21:47,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:21:47,399 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 136 transitions. [2022-11-25 17:21:47,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 36 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:21:47,400 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 136 transitions. [2022-11-25 17:21:47,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-25 17:21:47,400 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:21:47,401 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:21:47,407 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-25 17:21:47,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:21:47,607 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:21:47,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:21:47,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1510143892, now seen corresponding path program 11 times [2022-11-25 17:21:47,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:21:47,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253486418] [2022-11-25 17:21:47,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:21:47,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:21:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:21:47,883 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-25 17:21:47,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:21:47,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253486418] [2022-11-25 17:21:47,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253486418] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:21:47,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934879037] [2022-11-25 17:21:47,883 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 17:21:47,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:21:47,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:21:47,887 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:21:47,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-25 17:21:48,096 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-11-25 17:21:48,097 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:21:48,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 17:21:48,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:21:48,354 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-25 17:21:48,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:21:48,559 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-25 17:21:48,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934879037] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:21:48,560 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:21:48,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2022-11-25 17:21:48,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960675235] [2022-11-25 17:21:48,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:21:48,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-25 17:21:48,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:21:48,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-25 17:21:48,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-11-25 17:21:48,561 INFO L87 Difference]: Start difference. First operand 115 states and 136 transitions. Second operand has 20 states, 20 states have (on average 3.7) internal successors, (74), 20 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:21:49,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:21:49,309 INFO L93 Difference]: Finished difference Result 177 states and 213 transitions. [2022-11-25 17:21:49,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 17:21:49,309 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.7) internal successors, (74), 20 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-11-25 17:21:49,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:21:49,310 INFO L225 Difference]: With dead ends: 177 [2022-11-25 17:21:49,311 INFO L226 Difference]: Without dead ends: 159 [2022-11-25 17:21:49,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 77 SyntacticMatches, 10 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2022-11-25 17:21:49,312 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 102 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:21:49,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 31 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:21:49,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-11-25 17:21:49,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 107. [2022-11-25 17:21:49,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.2075471698113207) internal successors, (128), 106 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:21:49,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 128 transitions. [2022-11-25 17:21:49,350 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 128 transitions. Word has length 47 [2022-11-25 17:21:49,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:21:49,350 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 128 transitions. [2022-11-25 17:21:49,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.7) internal successors, (74), 20 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:21:49,350 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 128 transitions. [2022-11-25 17:21:49,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-25 17:21:49,351 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:21:49,351 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:21:49,363 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-25 17:21:49,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:21:49,557 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:21:49,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:21:49,557 INFO L85 PathProgramCache]: Analyzing trace with hash -220752601, now seen corresponding path program 12 times [2022-11-25 17:21:49,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:21:49,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596667418] [2022-11-25 17:21:49,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:21:49,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:21:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:21:49,839 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-25 17:21:49,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:21:49,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596667418] [2022-11-25 17:21:49,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596667418] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:21:49,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408085171] [2022-11-25 17:21:49,839 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-25 17:21:49,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:21:49,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:21:49,841 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:21:49,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-25 17:21:50,042 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-11-25 17:21:50,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:21:50,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 17:21:50,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:21:50,304 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 35 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-25 17:21:50,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:21:50,483 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 35 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-25 17:21:50,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408085171] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:21:50,484 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:21:50,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2022-11-25 17:21:50,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057646124] [2022-11-25 17:21:50,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:21:50,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-25 17:21:50,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:21:50,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-25 17:21:50,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-11-25 17:21:50,490 INFO L87 Difference]: Start difference. First operand 107 states and 128 transitions. Second operand has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:21:50,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:21:50,918 INFO L93 Difference]: Finished difference Result 163 states and 193 transitions. [2022-11-25 17:21:50,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 17:21:50,919 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 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 [2022-11-25 17:21:50,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:21:50,922 INFO L225 Difference]: With dead ends: 163 [2022-11-25 17:21:50,923 INFO L226 Difference]: Without dead ends: 78 [2022-11-25 17:21:50,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 79 SyntacticMatches, 10 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2022-11-25 17:21:50,924 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 93 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:21:50,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 26 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 17:21:50,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-25 17:21:50,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 65. [2022-11-25 17:21:50,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.171875) internal successors, (75), 64 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:21:50,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2022-11-25 17:21:50,958 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 48 [2022-11-25 17:21:50,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:21:50,958 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2022-11-25 17:21:50,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:21:50,958 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2022-11-25 17:21:50,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-25 17:21:50,959 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:21:50,959 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:21:50,965 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-25 17:21:51,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-25 17:21:51,165 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:21:51,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:21:51,166 INFO L85 PathProgramCache]: Analyzing trace with hash 663114381, now seen corresponding path program 13 times [2022-11-25 17:21:51,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:21:51,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718785440] [2022-11-25 17:21:51,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:21:51,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:21:51,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:21:53,181 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-25 17:21:53,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:21:53,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718785440] [2022-11-25 17:21:53,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718785440] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:21:53,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449971372] [2022-11-25 17:21:53,182 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 17:21:53,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:21:53,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:21:53,191 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:21:53,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-25 17:21:53,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:21:53,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 84 conjunts are in the unsatisfiable core [2022-11-25 17:21:53,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:21:53,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 17:21:53,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-25 17:21:53,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:21:53,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:21:53,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:21:53,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:21:53,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:21:54,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:21:54,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:21:54,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:21:54,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:21:54,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:21:54,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-11-25 17:21:54,713 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 17:21:54,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2022-11-25 17:21:55,053 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-25 17:21:55,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 59 [2022-11-25 17:21:55,433 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-11-25 17:21:55,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 119 treesize of output 75 [2022-11-25 17:21:55,802 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-25 17:21:55,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 60 [2022-11-25 17:21:56,024 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-25 17:21:56,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 40 [2022-11-25 17:21:56,096 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-25 17:21:56,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:22:08,222 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_356| Int) (|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_358| Int) (v_ArrVal_1169 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_354| Int) (|v_ULTIMATE.start_main_~i~0#1_360| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1169))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select v_ArrVal_1169 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (.cse5 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_360| 4))))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse5 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_358| 4))))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse5 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_356| 4))))) (let ((.cse2 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse0 .cse5 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_354| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 2 .cse0)) (not (= 2 .cse1)) (not (= .cse2 2)) (not (= 2 .cse3)) (= (* c_~N~0 2) (+ .cse2 .cse3 .cse4 .cse0 .cse5 .cse1)) (not (= 2 .cse4))))))))))) is different from false [2022-11-25 17:22:13,437 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 17:22:13,438 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 1901 treesize of output 1 [2022-11-25 17:22:13,442 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 26 trivial. 9 not checked. [2022-11-25 17:22:13,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449971372] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:22:13,442 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:22:13,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 23, 22] total 65 [2022-11-25 17:22:13,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855207481] [2022-11-25 17:22:13,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:22:13,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-11-25 17:22:13,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:22:13,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-11-25 17:22:13,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=3771, Unknown=6, NotChecked=124, Total=4160 [2022-11-25 17:22:13,446 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand has 65 states, 65 states have (on average 1.7076923076923076) internal successors, (111), 65 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) [2022-11-25 17:22:46,578 WARN L233 SmtUtils]: Spent 15.02s on a formula simplification. DAG size of input: 89 DAG size of output: 74 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:23:11,003 WARN L233 SmtUtils]: Spent 7.95s on a formula simplification. DAG size of input: 132 DAG size of output: 30 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:23:13,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-11-25 17:23:27,794 WARN L233 SmtUtils]: Spent 11.90s on a formula simplification. DAG size of input: 154 DAG size of output: 125 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:23:34,732 WARN L233 SmtUtils]: Spent 6.42s on a formula simplification. DAG size of input: 146 DAG size of output: 37 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:23:40,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:23:47,639 WARN L233 SmtUtils]: Spent 6.33s on a formula simplification. DAG size of input: 132 DAG size of output: 34 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:24:25,560 WARN L233 SmtUtils]: Spent 9.06s on a formula simplification. DAG size of input: 145 DAG size of output: 116 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:24:38,105 WARN L233 SmtUtils]: Spent 7.04s on a formula simplification. DAG size of input: 152 DAG size of output: 123 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:24:45,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:24:47,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:24:58,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:25:00,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:25:14,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:25:16,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2022-11-25 17:25:25,995 WARN L233 SmtUtils]: Spent 5.84s on a formula simplification. DAG size of input: 149 DAG size of output: 83 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:25:27,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:25:27,949 INFO L93 Difference]: Finished difference Result 180 states and 211 transitions. [2022-11-25 17:25:27,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-11-25 17:25:27,950 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 1.7076923076923076) internal successors, (111), 65 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 53 [2022-11-25 17:25:27,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:25:27,951 INFO L225 Difference]: With dead ends: 180 [2022-11-25 17:25:27,951 INFO L226 Difference]: Without dead ends: 174 [2022-11-25 17:25:27,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 140 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5668 ImplicationChecksByTransitivity, 183.0s TimeCoverageRelationStatistics Valid=1414, Invalid=18209, Unknown=121, NotChecked=278, Total=20022 [2022-11-25 17:25:27,956 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 137 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 3110 mSolverCounterSat, 277 mSolverCounterUnsat, 38 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 3529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 3110 IncrementalHoareTripleChecker+Invalid, 38 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 28.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:25:27,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 268 Invalid, 3529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 3110 Invalid, 38 Unknown, 104 Unchecked, 28.0s Time] [2022-11-25 17:25:27,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-11-25 17:25:28,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 132. [2022-11-25 17:25:28,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.2061068702290076) internal successors, (158), 131 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:25:28,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 158 transitions. [2022-11-25 17:25:28,012 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 158 transitions. Word has length 53 [2022-11-25 17:25:28,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:25:28,012 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 158 transitions. [2022-11-25 17:25:28,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 1.7076923076923076) internal successors, (111), 65 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) [2022-11-25 17:25:28,012 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 158 transitions. [2022-11-25 17:25:28,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-25 17:25:28,012 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:25:28,012 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:25:28,019 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-25 17:25:28,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-25 17:25:28,213 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:25:28,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:25:28,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1343172751, now seen corresponding path program 5 times [2022-11-25 17:25:28,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:25:28,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236103361] [2022-11-25 17:25:28,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:25:28,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:25:28,229 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:25:28,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1213400825] [2022-11-25 17:25:28,229 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 17:25:28,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:25:28,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:25:28,231 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:25:28,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-25 17:25:28,581 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-11-25 17:25:28,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:25:28,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-25 17:25:28,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:25:28,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-25 17:25:28,881 INFO L350 Elim1Store]: Elim1 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 37 treesize of output 17 [2022-11-25 17:25:28,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:25:28,985 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 24 [2022-11-25 17:25:29,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 17:25:29,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 17:25:29,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 17:25:29,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 17:25:29,323 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 18 proven. 71 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 17:25:29,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:25:29,391 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1261 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1261) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) is different from false [2022-11-25 17:25:29,406 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1261 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1261) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 2)) is different from false [2022-11-25 17:25:29,423 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1261 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1261) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 2)) is different from false [2022-11-25 17:25:29,440 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1261 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1261) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-11-25 17:25:31,828 INFO L321 Elim1Store]: treesize reduction 29, result has 48.2 percent of original size [2022-11-25 17:25:31,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 43 [2022-11-25 17:25:31,842 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:25:31,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 34 [2022-11-25 17:25:31,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 17:25:32,111 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 18 proven. 26 refuted. 0 times theorem prover too weak. 27 trivial. 24 not checked. [2022-11-25 17:25:32,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:25:32,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236103361] [2022-11-25 17:25:32,112 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:25:32,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213400825] [2022-11-25 17:25:32,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213400825] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:25:32,112 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:25:32,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2022-11-25 17:25:32,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709687417] [2022-11-25 17:25:32,112 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:25:32,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-25 17:25:32,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:25:32,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-25 17:25:32,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=590, Unknown=7, NotChecked=212, Total=930 [2022-11-25 17:25:32,114 INFO L87 Difference]: Start difference. First operand 132 states and 158 transitions. Second operand has 31 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 31 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:25:33,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:25:33,478 INFO L93 Difference]: Finished difference Result 223 states and 272 transitions. [2022-11-25 17:25:33,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 17:25:33,479 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 31 states have internal predecessors, (82), 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 53 [2022-11-25 17:25:33,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:25:33,480 INFO L225 Difference]: With dead ends: 223 [2022-11-25 17:25:33,481 INFO L226 Difference]: Without dead ends: 214 [2022-11-25 17:25:33,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 75 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=141, Invalid=680, Unknown=7, NotChecked=228, Total=1056 [2022-11-25 17:25:33,482 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 116 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 287 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:25:33,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 109 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 894 Invalid, 0 Unknown, 287 Unchecked, 1.1s Time] [2022-11-25 17:25:33,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-11-25 17:25:33,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 178. [2022-11-25 17:25:33,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 177 states have (on average 1.2033898305084745) internal successors, (213), 177 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:25:33,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 213 transitions. [2022-11-25 17:25:33,575 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 213 transitions. Word has length 53 [2022-11-25 17:25:33,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:25:33,576 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 213 transitions. [2022-11-25 17:25:33,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 31 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:25:33,576 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 213 transitions. [2022-11-25 17:25:33,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-25 17:25:33,577 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:25:33,577 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:25:33,584 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-25 17:25:33,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:25:33,785 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:25:33,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:25:33,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1405212365, now seen corresponding path program 4 times [2022-11-25 17:25:33,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:25:33,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493882146] [2022-11-25 17:25:33,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:25:33,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:25:33,806 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:25:33,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1081402330] [2022-11-25 17:25:33,806 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 17:25:33,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:25:33,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:25:33,808 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:25:33,826 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-25 17:25:33,963 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 17:25:33,964 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:25:33,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-25 17:25:33,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:25:33,973 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 11 [2022-11-25 17:25:34,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-25 17:25:34,164 INFO L321 Elim1Store]: treesize reduction 24, result has 47.8 percent of original size [2022-11-25 17:25:34,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 37 [2022-11-25 17:25:34,370 INFO L321 Elim1Store]: treesize reduction 24, result has 47.8 percent of original size [2022-11-25 17:25:34,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 52 [2022-11-25 17:25:34,510 INFO L321 Elim1Store]: treesize reduction 24, result has 47.8 percent of original size [2022-11-25 17:25:34,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 52 [2022-11-25 17:25:34,580 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:25:34,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 36 [2022-11-25 17:25:34,743 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 14 proven. 32 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-11-25 17:25:34,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:25:56,590 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 19 proven. 32 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-25 17:25:56,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:25:56,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493882146] [2022-11-25 17:25:56,591 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:25:56,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081402330] [2022-11-25 17:25:56,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081402330] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:25:56,591 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:25:56,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 23 [2022-11-25 17:25:56,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582185205] [2022-11-25 17:25:56,591 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:25:56,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-25 17:25:56,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:25:56,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-25 17:25:56,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=406, Unknown=8, NotChecked=0, Total=506 [2022-11-25 17:25:56,594 INFO L87 Difference]: Start difference. First operand 178 states and 213 transitions. Second operand has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:25:59,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:25:59,953 INFO L93 Difference]: Finished difference Result 292 states and 354 transitions. [2022-11-25 17:25:59,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 17:25:59,954 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 states have internal predecessors, (50), 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 53 [2022-11-25 17:25:59,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:25:59,955 INFO L225 Difference]: With dead ends: 292 [2022-11-25 17:25:59,955 INFO L226 Difference]: Without dead ends: 198 [2022-11-25 17:25:59,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 77 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 24.7s TimeCoverageRelationStatistics Valid=350, Invalid=1201, Unknown=9, NotChecked=0, Total=1560 [2022-11-25 17:25:59,956 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 39 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:25:59,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 33 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 17:25:59,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-11-25 17:26:00,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 190. [2022-11-25 17:26:00,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 189 states have (on average 1.2116402116402116) internal successors, (229), 189 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:26:00,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 229 transitions. [2022-11-25 17:26:00,036 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 229 transitions. Word has length 53 [2022-11-25 17:26:00,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:26:00,037 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 229 transitions. [2022-11-25 17:26:00,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:26:00,037 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 229 transitions. [2022-11-25 17:26:00,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-25 17:26:00,037 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:26:00,038 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:26:00,048 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-11-25 17:26:00,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:26:00,243 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:26:00,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:26:00,243 INFO L85 PathProgramCache]: Analyzing trace with hash 783767503, now seen corresponding path program 14 times [2022-11-25 17:26:00,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:26:00,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602077821] [2022-11-25 17:26:00,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:26:00,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:26:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:26:00,614 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 16 proven. 55 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-25 17:26:00,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:26:00,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602077821] [2022-11-25 17:26:00,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602077821] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:26:00,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307502875] [2022-11-25 17:26:00,615 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:26:00,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:26:00,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:26:00,619 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:26:00,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-25 17:26:00,788 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 17:26:00,788 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:26:00,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 17:26:00,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:26:01,123 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 25 proven. 46 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-25 17:26:01,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:26:01,412 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 25 proven. 46 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-25 17:26:01,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307502875] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:26:01,412 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:26:01,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23 [2022-11-25 17:26:01,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600624503] [2022-11-25 17:26:01,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:26:01,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-25 17:26:01,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:26:01,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-25 17:26:01,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2022-11-25 17:26:01,414 INFO L87 Difference]: Start difference. First operand 190 states and 229 transitions. Second operand has 23 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 23 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) [2022-11-25 17:26:02,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:26:02,526 INFO L93 Difference]: Finished difference Result 283 states and 341 transitions. [2022-11-25 17:26:02,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-25 17:26:02,527 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 23 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) Word has length 55 [2022-11-25 17:26:02,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:26:02,529 INFO L225 Difference]: With dead ends: 283 [2022-11-25 17:26:02,529 INFO L226 Difference]: Without dead ends: 262 [2022-11-25 17:26:02,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 90 SyntacticMatches, 12 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=274, Invalid=916, Unknown=0, NotChecked=0, Total=1190 [2022-11-25 17:26:02,530 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 107 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 17:26:02,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 34 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 17:26:02,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-11-25 17:26:02,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 171. [2022-11-25 17:26:02,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.2176470588235293) internal successors, (207), 170 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:26:02,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 207 transitions. [2022-11-25 17:26:02,655 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 207 transitions. Word has length 55 [2022-11-25 17:26:02,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:26:02,656 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 207 transitions. [2022-11-25 17:26:02,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 23 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) [2022-11-25 17:26:02,656 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 207 transitions. [2022-11-25 17:26:02,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-25 17:26:02,657 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:26:02,657 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:26:02,668 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-11-25 17:26:02,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-25 17:26:02,863 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:26:02,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:26:02,863 INFO L85 PathProgramCache]: Analyzing trace with hash -469998324, now seen corresponding path program 15 times [2022-11-25 17:26:02,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:26:02,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852683283] [2022-11-25 17:26:02,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:26:02,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:26:02,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:26:03,198 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 38 proven. 38 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-25 17:26:03,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:26:03,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852683283] [2022-11-25 17:26:03,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852683283] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:26:03,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168079582] [2022-11-25 17:26:03,199 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 17:26:03,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:26:03,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:26:03,200 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:26:03,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-25 17:26:03,431 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-11-25 17:26:03,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:26:03,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 17:26:03,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:26:03,749 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 51 proven. 35 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-25 17:26:03,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:26:04,004 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 51 proven. 35 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-25 17:26:04,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168079582] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:26:04,005 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:26:04,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23 [2022-11-25 17:26:04,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124413710] [2022-11-25 17:26:04,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:26:04,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-25 17:26:04,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:26:04,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-25 17:26:04,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2022-11-25 17:26:04,007 INFO L87 Difference]: Start difference. First operand 171 states and 207 transitions. Second operand has 23 states, 23 states have (on average 3.739130434782609) internal successors, (86), 23 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:26:04,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:26:04,585 INFO L93 Difference]: Finished difference Result 261 states and 312 transitions. [2022-11-25 17:26:04,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 17:26:04,586 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.739130434782609) internal successors, (86), 23 states have internal predecessors, (86), 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 [2022-11-25 17:26:04,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:26:04,587 INFO L225 Difference]: With dead ends: 261 [2022-11-25 17:26:04,587 INFO L226 Difference]: Without dead ends: 121 [2022-11-25 17:26:04,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 92 SyntacticMatches, 12 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2022-11-25 17:26:04,588 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 145 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:26:04,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 25 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 17:26:04,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-11-25 17:26:04,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 96. [2022-11-25 17:26:04,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.2) internal successors, (114), 95 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:26:04,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 114 transitions. [2022-11-25 17:26:04,636 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 114 transitions. Word has length 56 [2022-11-25 17:26:04,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:26:04,636 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 114 transitions. [2022-11-25 17:26:04,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.739130434782609) internal successors, (86), 23 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:26:04,636 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 114 transitions. [2022-11-25 17:26:04,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-25 17:26:04,637 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:26:04,637 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:26:04,646 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-11-25 17:26:04,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-25 17:26:04,843 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:26:04,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:26:04,844 INFO L85 PathProgramCache]: Analyzing trace with hash -844503370, now seen corresponding path program 16 times [2022-11-25 17:26:04,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:26:04,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666381386] [2022-11-25 17:26:04,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:26:04,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:26:04,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:26:08,235 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-25 17:26:08,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:26:08,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666381386] [2022-11-25 17:26:08,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666381386] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:26:08,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30259137] [2022-11-25 17:26:08,235 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 17:26:08,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:26:08,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:26:08,237 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:26:08,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fa439c-236d-43dd-ac6d-7a75267cc3ac/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-25 17:26:08,443 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 17:26:08,443 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:26:08,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 95 conjunts are in the unsatisfiable core [2022-11-25 17:26:08,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:26:08,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-25 17:26:08,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 17:26:08,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:26:08,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:26:08,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:26:08,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:26:08,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:26:09,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:26:09,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:26:09,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:26:09,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:26:09,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:26:09,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:26:10,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:26:10,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-11-25 17:26:10,460 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 17:26:10,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-11-25 17:26:10,793 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 17:26:10,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2022-11-25 17:26:11,147 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-25 17:26:11,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 58 [2022-11-25 17:26:11,525 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 17:26:11,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2022-11-25 17:26:11,837 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 17:26:11,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-11-25 17:26:12,045 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 17:26:12,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 28 [2022-11-25 17:26:12,131 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 35 proven. 103 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:26:12,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:26:40,455 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|v_ULTIMATE.start_main_~i~0#1_498| Int) (v_ArrVal_1602 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_500| Int) (|v_ULTIMATE.start_main_~i~0#1_494| Int) (|v_ULTIMATE.start_main_~i~0#1_496| Int) (|v_ULTIMATE.start_main_~i~0#1_502| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1602))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_1602 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_502| 4))))) (let ((.cse2 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_500| 4))))) (let ((.cse1 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse2 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_498| 4))))) (let ((.cse3 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4 .cse5 .cse2 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_496| 4))))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse4 .cse5 .cse2 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_494| 4))))) (or (not (= 2 .cse0)) (not (= .cse1 2)) (not (= 2 .cse2)) (= (* c_~N~0 2) (+ .cse1 .cse3 .cse4 .cse5 .cse6 .cse2 .cse0)) (not (= 2 .cse5)) (not (= 2 .cse6)) (not (= .cse3 2)))))))))))) is different from false [2022-11-25 17:26:40,672 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|v_ULTIMATE.start_main_~i~0#1_498| Int) (v_ArrVal_1602 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_500| Int) (|v_ULTIMATE.start_main_~i~0#1_494| Int) (|v_ULTIMATE.start_main_~i~0#1_496| Int) (|v_ULTIMATE.start_main_~i~0#1_502| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1602))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_1602 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_502| 4))))) (let ((.cse2 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_500| 4))))) (let ((.cse1 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse2 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_498| 4))))) (let ((.cse3 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4 .cse5 .cse2 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_496| 4))))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse4 .cse5 .cse2 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_494| 4))))) (or (not (= 2 .cse0)) (not (= .cse1 2)) (not (= 2 .cse2)) (= (* c_~N~0 2) (+ .cse1 .cse3 .cse4 .cse5 .cse6 .cse2 .cse0)) (not (= 2 .cse5)) (not (= 2 .cse6)) (not (= .cse3 2)))))))))))) (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) is different from false [2022-11-25 17:27:08,173 WARN L233 SmtUtils]: Spent 10.88s on a formula simplification that was a NOOP. DAG size: 85 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:27:22,968 WARN L233 SmtUtils]: Spent 5.61s on a formula simplification that was a NOOP. DAG size: 84 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:27:42,725 WARN L233 SmtUtils]: Spent 8.80s on a formula simplification that was a NOOP. DAG size: 85 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:28:04,534 WARN L233 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 84 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:28:45,976 WARN L233 SmtUtils]: Spent 7.43s on a formula simplification that was a NOOP. DAG size: 84 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:28:46,511 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 30 proven. 97 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-11-25 17:28:46,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30259137] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:28:46,512 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:28:46,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 32] total 88 [2022-11-25 17:28:46,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729181005] [2022-11-25 17:28:46,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:28:46,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2022-11-25 17:28:46,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:28:46,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2022-11-25 17:28:46,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=460, Invalid=6819, Unknown=39, NotChecked=338, Total=7656 [2022-11-25 17:28:46,515 INFO L87 Difference]: Start difference. First operand 96 states and 114 transitions. Second operand has 88 states, 88 states have (on average 1.7840909090909092) internal successors, (157), 88 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:29:01,998 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse34 (* 2 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse10 (< |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse41 (< |c_ULTIMATE.start_main_~i~0#1| 5)) (.cse49 (+ .cse34 3)) (.cse0 (+ .cse34 9)) (.cse11 (< |c_ULTIMATE.start_main_~i~0#1| 3)) (.cse88 (+ .cse34 7)) (.cse71 (< |c_ULTIMATE.start_main_~i~0#1| 2)) (.cse61 (< |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse15 (+ .cse34 5))) (and (or (forall ((|v_ULTIMATE.start_main_~i~0#1_498| Int) (v_ArrVal_1602 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_500| Int) (|v_ULTIMATE.start_main_~i~0#1_494| Int) (|v_ULTIMATE.start_main_~i~0#1_496| Int) (|v_ULTIMATE.start_main_~i~0#1_506| Int) (|v_ULTIMATE.start_main_~i~0#1_502| Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1602))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select v_ArrVal_1602 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_506| 4)))) (.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| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_502| 4))))) (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 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_500| 4))))) (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 .cse5 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_498| 4))))) (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_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_496| 4))))) (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_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_494| 4))))) (or (< .cse0 (+ .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)) (not (= .cse2 2)) (not (= 2 .cse5)) (not (= 2 .cse7)) (not (= .cse1 2)) (not (= 2 .cse6)) (not (= 2 .cse4)))))))))))) .cse10) (or .cse11 (forall ((|v_ULTIMATE.start_main_~i~0#1_498| Int) (v_ArrVal_1602 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_500| Int) (|v_ULTIMATE.start_main_~i~0#1_494| Int) (|v_ULTIMATE.start_main_~i~0#1_496| Int) (|v_ULTIMATE.start_main_~i~0#1_506| Int) (|v_ULTIMATE.start_main_~i~0#1_502| Int)) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1602))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse12 (select v_ArrVal_1602 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_506| 4)))) (.cse17 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse14 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_502| 4))))) (let ((.cse13 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse17 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_500| 4))))) (let ((.cse19 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse17 .cse13 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_498| 4))))) (let ((.cse16 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse17 .cse13 .cse19 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_496| 4))))) (let ((.cse18 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse12 .cse17 .cse13 .cse19 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_494| 4))))) (or (not (= .cse12 2)) (not (= 2 .cse13)) (not (= 2 .cse14)) (< .cse15 (+ .cse16 .cse12 .cse17 .cse18 .cse13 .cse19 .cse14)) (not (= .cse16 2)) (not (= 2 .cse19)) (not (= 2 .cse18))))))))))))) (or .cse10 (forall ((|v_ULTIMATE.start_main_~i~0#1_498| Int) (v_ArrVal_1602 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_500| Int) (|v_ULTIMATE.start_main_~i~0#1_494| Int) (|v_ULTIMATE.start_main_~i~0#1_496| Int) (|v_ULTIMATE.start_main_~i~0#1_506| Int) (|v_ULTIMATE.start_main_~i~0#1_502| Int)) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1602))) (let ((.cse30 (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse22 (select v_ArrVal_1602 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_506| 4)))) (.cse27 (select .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse24 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse22 .cse27))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_502| 4))))) (let ((.cse23 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse22 .cse27 .cse24))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_500| 4))))) (let ((.cse26 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse22 .cse27 .cse23 .cse24))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_498| 4))))) (let ((.cse25 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse22 .cse27 .cse23 .cse26 .cse24))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_496| 4))))) (let ((.cse28 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse22 .cse27 .cse23 .cse26 .cse24))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_494| 4))))) (or (not (= .cse22 2)) (not (= 2 .cse23)) (not (= 2 .cse24)) (not (= .cse25 2)) (not (= 2 .cse26)) (< (+ .cse25 .cse22 .cse27 .cse28 .cse23 .cse26 .cse24) 13) (not (= 2 .cse28))))))))))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_498| Int) (v_ArrVal_1602 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_500| Int) (|v_ULTIMATE.start_main_~i~0#1_494| Int) (|v_ULTIMATE.start_main_~i~0#1_496| Int) (|v_ULTIMATE.start_main_~i~0#1_506| Int) (|v_ULTIMATE.start_main_~i~0#1_502| Int)) (let ((.cse39 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1602))) (let ((.cse40 (select .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse31 (select v_ArrVal_1602 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_506| 4)))) (.cse36 (select .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse33 (select (select (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse31 .cse36))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_502| 4))))) (let ((.cse32 (select (select (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse31 .cse36 .cse33))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_500| 4))))) (let ((.cse38 (select (select (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse31 .cse36 .cse32 .cse33))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_498| 4))))) (let ((.cse35 (select (select (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse31 .cse36 .cse32 .cse38 .cse33))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_496| 4))))) (let ((.cse37 (select (select (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse35 .cse31 .cse36 .cse32 .cse38 .cse33))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_494| 4))))) (or (not (= .cse31 2)) (not (= 2 .cse32)) (not (= 2 .cse33)) (< (+ .cse34 1) (+ .cse35 .cse31 .cse36 .cse37 .cse32 .cse38 .cse33)) (not (= .cse35 2)) (not (= 2 .cse38)) (not (= 2 .cse37)))))))))))) .cse41) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_498| Int) (v_ArrVal_1602 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_500| Int) (|v_ULTIMATE.start_main_~i~0#1_494| Int) (|v_ULTIMATE.start_main_~i~0#1_496| Int) (|v_ULTIMATE.start_main_~i~0#1_506| Int) (|v_ULTIMATE.start_main_~i~0#1_502| Int)) (let ((.cse50 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1602))) (let ((.cse51 (select .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse42 (select v_ArrVal_1602 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_506| 4)))) (.cse47 (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse44 (select (select (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse42 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_502| 4))))) (let ((.cse43 (select (select (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse42 .cse47 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_500| 4))))) (let ((.cse46 (select (select (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse42 .cse47 .cse43 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_498| 4))))) (let ((.cse45 (select (select (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse42 .cse47 .cse43 .cse46 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_496| 4))))) (let ((.cse48 (select (select (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse45 .cse42 .cse47 .cse43 .cse46 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_494| 4))))) (or (not (= .cse42 2)) (not (= 2 .cse43)) (not (= 2 .cse44)) (not (= .cse45 2)) (not (= 2 .cse46)) (< (+ .cse45 .cse42 .cse47 .cse48 .cse43 .cse46 .cse44) .cse49) (not (= 2 .cse48)))))))))))) .cse41) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0) (< c_~N~0 6) (forall ((|v_ULTIMATE.start_main_~i~0#1_498| Int) (v_ArrVal_1602 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_500| Int) (|v_ULTIMATE.start_main_~i~0#1_494| Int) (|v_ULTIMATE.start_main_~i~0#1_496| Int) (|v_ULTIMATE.start_main_~i~0#1_506| Int) (|v_ULTIMATE.start_main_~i~0#1_502| Int)) (let ((.cse59 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1602))) (let ((.cse60 (select .cse59 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse52 (select v_ArrVal_1602 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_506| 4)))) (.cse57 (select .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse54 (select (select (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse57))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_502| 4))))) (let ((.cse53 (select (select (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse57 .cse54))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_500| 4))))) (let ((.cse56 (select (select (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse57 .cse53 .cse54))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_498| 4))))) (let ((.cse55 (select (select (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse57 .cse53 .cse56 .cse54))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_496| 4))))) (let ((.cse58 (select (select (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse55 .cse52 .cse57 .cse53 .cse56 .cse54))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_494| 4))))) (or (not (= .cse52 2)) (not (= 2 .cse53)) (not (= 2 .cse54)) (not (= .cse55 2)) (not (= 2 .cse56)) (= (* c_~N~0 2) (+ .cse55 .cse52 .cse57 .cse58 .cse53 .cse56 .cse54)) (not (= 2 .cse58))))))))))))) (or .cse61 (forall ((|v_ULTIMATE.start_main_~i~0#1_498| Int) (v_ArrVal_1602 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_500| Int) (|v_ULTIMATE.start_main_~i~0#1_494| Int) (|v_ULTIMATE.start_main_~i~0#1_496| Int) (|v_ULTIMATE.start_main_~i~0#1_506| Int) (|v_ULTIMATE.start_main_~i~0#1_502| Int)) (let ((.cse69 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1602))) (let ((.cse70 (select .cse69 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse62 (select v_ArrVal_1602 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_506| 4)))) (.cse67 (select .cse70 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse64 (select (select (store .cse69 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse62 .cse67))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_502| 4))))) (let ((.cse63 (select (select (store .cse69 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse62 .cse67 .cse64))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_500| 4))))) (let ((.cse66 (select (select (store .cse69 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse62 .cse67 .cse63 .cse64))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_498| 4))))) (let ((.cse65 (select (select (store .cse69 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse62 .cse67 .cse63 .cse66 .cse64))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_496| 4))))) (let ((.cse68 (select (select (store .cse69 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse65 .cse62 .cse67 .cse63 .cse66 .cse64))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_494| 4))))) (or (not (= .cse62 2)) (not (= 2 .cse63)) (not (= 2 .cse64)) (not (= .cse65 2)) (not (= 2 .cse66)) (< .cse49 (+ .cse65 .cse62 .cse67 .cse68 .cse63 .cse66 .cse64)) (not (= 2 .cse68))))))))))))) (or .cse71 (forall ((|v_ULTIMATE.start_main_~i~0#1_498| Int) (v_ArrVal_1602 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_500| Int) (|v_ULTIMATE.start_main_~i~0#1_494| Int) (|v_ULTIMATE.start_main_~i~0#1_496| Int) (|v_ULTIMATE.start_main_~i~0#1_506| Int) (|v_ULTIMATE.start_main_~i~0#1_502| Int)) (let ((.cse79 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1602))) (let ((.cse80 (select .cse79 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse72 (select v_ArrVal_1602 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_506| 4)))) (.cse76 (select .cse80 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse74 (select (select (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse72 .cse76))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_502| 4))))) (let ((.cse73 (select (select (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse72 .cse76 .cse74))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_500| 4))))) (let ((.cse78 (select (select (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse72 .cse76 .cse73 .cse74))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_498| 4))))) (let ((.cse75 (select (select (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse72 .cse76 .cse73 .cse78 .cse74))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_496| 4))))) (let ((.cse77 (select (select (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse75 .cse72 .cse76 .cse73 .cse78 .cse74))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_494| 4))))) (or (not (= .cse72 2)) (not (= 2 .cse73)) (not (= 2 .cse74)) (< (+ .cse75 .cse72 .cse76 .cse77 .cse73 .cse78 .cse74) .cse0) (not (= .cse75 2)) (not (= 2 .cse78)) (not (= 2 .cse77))))))))))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_498| Int) (v_ArrVal_1602 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_500| Int) (|v_ULTIMATE.start_main_~i~0#1_494| Int) (|v_ULTIMATE.start_main_~i~0#1_496| Int) (|v_ULTIMATE.start_main_~i~0#1_506| Int) (|v_ULTIMATE.start_main_~i~0#1_502| Int)) (let ((.cse89 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1602))) (let ((.cse90 (select .cse89 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse82 (select v_ArrVal_1602 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_506| 4)))) (.cse83 (select .cse90 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse87 (select (select (store .cse89 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse90 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse82 .cse83))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_502| 4))))) (let ((.cse85 (select (select (store .cse89 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse90 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse82 .cse83 .cse87))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_500| 4))))) (let ((.cse86 (select (select (store .cse89 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse90 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse82 .cse83 .cse85 .cse87))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_498| 4))))) (let ((.cse81 (select (select (store .cse89 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse90 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse82 .cse83 .cse85 .cse86 .cse87))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_496| 4))))) (let ((.cse84 (select (select (store .cse89 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse90 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse81 .cse82 .cse83 .cse85 .cse86 .cse87))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_494| 4))))) (or (< (+ .cse81 .cse82 .cse83 .cse84 .cse85 .cse86 .cse87) .cse88) (not (= .cse82 2)) (not (= 2 .cse85)) (not (= 2 .cse87)) (not (= .cse81 2)) (not (= 2 .cse86)) (not (= 2 .cse84)))))))))))) .cse11) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_498| Int) (v_ArrVal_1602 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_500| Int) (|v_ULTIMATE.start_main_~i~0#1_494| Int) (|v_ULTIMATE.start_main_~i~0#1_496| Int) (|v_ULTIMATE.start_main_~i~0#1_506| Int) (|v_ULTIMATE.start_main_~i~0#1_502| Int)) (let ((.cse98 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1602))) (let ((.cse99 (select .cse98 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse91 (select v_ArrVal_1602 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_506| 4)))) (.cse95 (select .cse99 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse93 (select (select (store .cse98 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse99 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse91 .cse95))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_502| 4))))) (let ((.cse92 (select (select (store .cse98 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse99 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse91 .cse95 .cse93))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_500| 4))))) (let ((.cse97 (select (select (store .cse98 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse99 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse91 .cse95 .cse92 .cse93))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_498| 4))))) (let ((.cse94 (select (select (store .cse98 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse99 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse91 .cse95 .cse92 .cse97 .cse93))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_496| 4))))) (let ((.cse96 (select (select (store .cse98 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse99 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse94 .cse91 .cse95 .cse92 .cse97 .cse93))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_494| 4))))) (or (not (= .cse91 2)) (not (= 2 .cse92)) (not (= 2 .cse93)) (< .cse88 (+ .cse94 .cse91 .cse95 .cse96 .cse92 .cse97 .cse93)) (not (= .cse94 2)) (not (= 2 .cse97)) (not (= 2 .cse96)))))))))))) .cse71) (or .cse61 (forall ((|v_ULTIMATE.start_main_~i~0#1_498| Int) (v_ArrVal_1602 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_500| Int) (|v_ULTIMATE.start_main_~i~0#1_494| Int) (|v_ULTIMATE.start_main_~i~0#1_496| Int) (|v_ULTIMATE.start_main_~i~0#1_506| Int) (|v_ULTIMATE.start_main_~i~0#1_502| Int)) (let ((.cse107 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1602))) (let ((.cse108 (select .cse107 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse100 (select v_ArrVal_1602 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_506| 4)))) (.cse104 (select .cse108 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse102 (select (select (store .cse107 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse108 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse100 .cse104))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_502| 4))))) (let ((.cse101 (select (select (store .cse107 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse108 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse100 .cse104 .cse102))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_500| 4))))) (let ((.cse106 (select (select (store .cse107 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse108 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse100 .cse104 .cse101 .cse102))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_498| 4))))) (let ((.cse103 (select (select (store .cse107 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse108 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse100 .cse104 .cse101 .cse106 .cse102))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_496| 4))))) (let ((.cse105 (select (select (store .cse107 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse108 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse103 .cse100 .cse104 .cse101 .cse106 .cse102))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_494| 4))))) (or (not (= .cse100 2)) (not (= 2 .cse101)) (not (= 2 .cse102)) (not (= .cse103 2)) (< (+ .cse103 .cse100 .cse104 .cse105 .cse101 .cse106 .cse102) .cse15) (not (= 2 .cse106)) (not (= 2 .cse105)))))))))))))))) is different from true [2022-11-25 17:29:51,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:30:22,584 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse104 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse105 (select .cse104 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse60 (* c_~N~0 2)) (.cse37 (* 2 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse10 (< |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse32 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse44 (< |c_ULTIMATE.start_main_~i~0#1| 5)) (.cse52 (+ .cse37 3)) (.cse0 (+ .cse37 9)) (.cse11 (< |c_ULTIMATE.start_main_~i~0#1| 3)) (.cse92 (+ .cse37 7)) (.cse75 (< |c_ULTIMATE.start_main_~i~0#1| 2)) (.cse33 (= .cse60 12)) (.cse31 (= 2 .cse105)) (.cse65 (< |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse15 (+ .cse37 5))) (and (or (forall ((|v_ULTIMATE.start_main_~i~0#1_498| Int) (v_ArrVal_1602 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_500| Int) (|v_ULTIMATE.start_main_~i~0#1_494| Int) (|v_ULTIMATE.start_main_~i~0#1_496| Int) (|v_ULTIMATE.start_main_~i~0#1_506| Int) (|v_ULTIMATE.start_main_~i~0#1_502| Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1602))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select v_ArrVal_1602 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_506| 4)))) (.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| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_502| 4))))) (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 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_500| 4))))) (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 .cse5 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_498| 4))))) (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_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_496| 4))))) (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_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_494| 4))))) (or (< .cse0 (+ .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)) (not (= .cse2 2)) (not (= 2 .cse5)) (not (= 2 .cse7)) (not (= .cse1 2)) (not (= 2 .cse6)) (not (= 2 .cse4)))))))))))) .cse10) (or .cse11 (forall ((|v_ULTIMATE.start_main_~i~0#1_498| Int) (v_ArrVal_1602 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_500| Int) (|v_ULTIMATE.start_main_~i~0#1_494| Int) (|v_ULTIMATE.start_main_~i~0#1_496| Int) (|v_ULTIMATE.start_main_~i~0#1_506| Int) (|v_ULTIMATE.start_main_~i~0#1_502| Int)) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1602))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse12 (select v_ArrVal_1602 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_506| 4)))) (.cse17 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse14 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_502| 4))))) (let ((.cse13 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse17 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_500| 4))))) (let ((.cse19 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse17 .cse13 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_498| 4))))) (let ((.cse16 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse17 .cse13 .cse19 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_496| 4))))) (let ((.cse18 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse12 .cse17 .cse13 .cse19 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_494| 4))))) (or (not (= .cse12 2)) (not (= 2 .cse13)) (not (= 2 .cse14)) (< .cse15 (+ .cse16 .cse12 .cse17 .cse18 .cse13 .cse19 .cse14)) (not (= .cse16 2)) (not (= 2 .cse19)) (not (= 2 .cse18))))))))))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (or .cse10 (forall ((|v_ULTIMATE.start_main_~i~0#1_498| Int) (v_ArrVal_1602 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_500| Int) (|v_ULTIMATE.start_main_~i~0#1_494| Int) (|v_ULTIMATE.start_main_~i~0#1_496| Int) (|v_ULTIMATE.start_main_~i~0#1_506| Int) (|v_ULTIMATE.start_main_~i~0#1_502| Int)) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1602))) (let ((.cse30 (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse22 (select v_ArrVal_1602 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_506| 4)))) (.cse27 (select .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse24 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse22 .cse27))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_502| 4))))) (let ((.cse23 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse22 .cse27 .cse24))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_500| 4))))) (let ((.cse26 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse22 .cse27 .cse23 .cse24))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_498| 4))))) (let ((.cse25 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse22 .cse27 .cse23 .cse26 .cse24))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_496| 4))))) (let ((.cse28 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse22 .cse27 .cse23 .cse26 .cse24))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_494| 4))))) (or (not (= .cse22 2)) (not (= 2 .cse23)) (not (= 2 .cse24)) (not (= .cse25 2)) (not (= 2 .cse26)) (< (+ .cse25 .cse22 .cse27 .cse28 .cse23 .cse26 .cse24) 13) (not (= 2 .cse28))))))))))))) (or (not .cse31) (and (<= 2 .cse32) (<= .cse32 2) .cse33)) (= .cse32 2) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_498| Int) (v_ArrVal_1602 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_500| Int) (|v_ULTIMATE.start_main_~i~0#1_494| Int) (|v_ULTIMATE.start_main_~i~0#1_496| Int) (|v_ULTIMATE.start_main_~i~0#1_506| Int) (|v_ULTIMATE.start_main_~i~0#1_502| Int)) (let ((.cse42 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1602))) (let ((.cse43 (select .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse34 (select v_ArrVal_1602 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_506| 4)))) (.cse39 (select .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse36 (select (select (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse39))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_502| 4))))) (let ((.cse35 (select (select (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse39 .cse36))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_500| 4))))) (let ((.cse41 (select (select (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse39 .cse35 .cse36))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_498| 4))))) (let ((.cse38 (select (select (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse39 .cse35 .cse41 .cse36))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_496| 4))))) (let ((.cse40 (select (select (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse38 .cse34 .cse39 .cse35 .cse41 .cse36))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_494| 4))))) (or (not (= .cse34 2)) (not (= 2 .cse35)) (not (= 2 .cse36)) (< (+ .cse37 1) (+ .cse38 .cse34 .cse39 .cse40 .cse35 .cse41 .cse36)) (not (= .cse38 2)) (not (= 2 .cse41)) (not (= 2 .cse40)))))))))))) .cse44) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_498| Int) (v_ArrVal_1602 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_500| Int) (|v_ULTIMATE.start_main_~i~0#1_494| Int) (|v_ULTIMATE.start_main_~i~0#1_496| Int) (|v_ULTIMATE.start_main_~i~0#1_506| Int) (|v_ULTIMATE.start_main_~i~0#1_502| Int)) (let ((.cse53 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1602))) (let ((.cse54 (select .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse45 (select v_ArrVal_1602 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_506| 4)))) (.cse50 (select .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse47 (select (select (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse45 .cse50))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_502| 4))))) (let ((.cse46 (select (select (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse45 .cse50 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_500| 4))))) (let ((.cse49 (select (select (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse45 .cse50 .cse46 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_498| 4))))) (let ((.cse48 (select (select (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse45 .cse50 .cse46 .cse49 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_496| 4))))) (let ((.cse51 (select (select (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse45 .cse50 .cse46 .cse49 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_494| 4))))) (or (not (= .cse45 2)) (not (= 2 .cse46)) (not (= 2 .cse47)) (not (= .cse48 2)) (not (= 2 .cse49)) (< (+ .cse48 .cse45 .cse50 .cse51 .cse46 .cse49 .cse47) .cse52) (not (= 2 .cse51)))))))))))) .cse44) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0) (< c_~N~0 6) (forall ((|v_ULTIMATE.start_main_~i~0#1_498| Int) (v_ArrVal_1602 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_500| Int) (|v_ULTIMATE.start_main_~i~0#1_494| Int) (|v_ULTIMATE.start_main_~i~0#1_496| Int) (|v_ULTIMATE.start_main_~i~0#1_506| Int) (|v_ULTIMATE.start_main_~i~0#1_502| Int)) (let ((.cse63 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1602))) (let ((.cse64 (select .cse63 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse55 (select v_ArrVal_1602 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_506| 4)))) (.cse61 (select .cse64 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse57 (select (select (store .cse63 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse55 .cse61))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_502| 4))))) (let ((.cse56 (select (select (store .cse63 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse55 .cse61 .cse57))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_500| 4))))) (let ((.cse59 (select (select (store .cse63 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse55 .cse61 .cse56 .cse57))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_498| 4))))) (let ((.cse58 (select (select (store .cse63 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse55 .cse61 .cse56 .cse59 .cse57))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_496| 4))))) (let ((.cse62 (select (select (store .cse63 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse58 .cse55 .cse61 .cse56 .cse59 .cse57))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_494| 4))))) (or (not (= .cse55 2)) (not (= 2 .cse56)) (not (= 2 .cse57)) (not (= .cse58 2)) (not (= 2 .cse59)) (= .cse60 (+ .cse58 .cse55 .cse61 .cse62 .cse56 .cse59 .cse57)) (not (= 2 .cse62))))))))))))) (or .cse65 (forall ((|v_ULTIMATE.start_main_~i~0#1_498| Int) (v_ArrVal_1602 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_500| Int) (|v_ULTIMATE.start_main_~i~0#1_494| Int) (|v_ULTIMATE.start_main_~i~0#1_496| Int) (|v_ULTIMATE.start_main_~i~0#1_506| Int) (|v_ULTIMATE.start_main_~i~0#1_502| Int)) (let ((.cse73 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1602))) (let ((.cse74 (select .cse73 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse66 (select v_ArrVal_1602 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_506| 4)))) (.cse71 (select .cse74 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse68 (select (select (store .cse73 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse66 .cse71))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_502| 4))))) (let ((.cse67 (select (select (store .cse73 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse66 .cse71 .cse68))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_500| 4))))) (let ((.cse70 (select (select (store .cse73 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse66 .cse71 .cse67 .cse68))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_498| 4))))) (let ((.cse69 (select (select (store .cse73 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse66 .cse71 .cse67 .cse70 .cse68))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_496| 4))))) (let ((.cse72 (select (select (store .cse73 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse69 .cse66 .cse71 .cse67 .cse70 .cse68))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_494| 4))))) (or (not (= .cse66 2)) (not (= 2 .cse67)) (not (= 2 .cse68)) (not (= .cse69 2)) (not (= 2 .cse70)) (< .cse52 (+ .cse69 .cse66 .cse71 .cse72 .cse67 .cse70 .cse68)) (not (= 2 .cse72))))))))))))) (or .cse75 (forall ((|v_ULTIMATE.start_main_~i~0#1_498| Int) (v_ArrVal_1602 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_500| Int) (|v_ULTIMATE.start_main_~i~0#1_494| Int) (|v_ULTIMATE.start_main_~i~0#1_496| Int) (|v_ULTIMATE.start_main_~i~0#1_506| Int) (|v_ULTIMATE.start_main_~i~0#1_502| Int)) (let ((.cse83 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1602))) (let ((.cse84 (select .cse83 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse76 (select v_ArrVal_1602 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_506| 4)))) (.cse80 (select .cse84 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse78 (select (select (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse76 .cse80))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_502| 4))))) (let ((.cse77 (select (select (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse76 .cse80 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_500| 4))))) (let ((.cse82 (select (select (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse76 .cse80 .cse77 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_498| 4))))) (let ((.cse79 (select (select (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse76 .cse80 .cse77 .cse82 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_496| 4))))) (let ((.cse81 (select (select (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse79 .cse76 .cse80 .cse77 .cse82 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_494| 4))))) (or (not (= .cse76 2)) (not (= 2 .cse77)) (not (= 2 .cse78)) (< (+ .cse79 .cse76 .cse80 .cse81 .cse77 .cse82 .cse78) .cse0) (not (= .cse79 2)) (not (= 2 .cse82)) (not (= 2 .cse81))))))))))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_498| Int) (v_ArrVal_1602 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_500| Int) (|v_ULTIMATE.start_main_~i~0#1_494| Int) (|v_ULTIMATE.start_main_~i~0#1_496| Int) (|v_ULTIMATE.start_main_~i~0#1_506| Int) (|v_ULTIMATE.start_main_~i~0#1_502| Int)) (let ((.cse93 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1602))) (let ((.cse94 (select .cse93 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse86 (select v_ArrVal_1602 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_506| 4)))) (.cse87 (select .cse94 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse91 (select (select (store .cse93 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse94 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse86 .cse87))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_502| 4))))) (let ((.cse89 (select (select (store .cse93 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse94 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse86 .cse87 .cse91))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_500| 4))))) (let ((.cse90 (select (select (store .cse93 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse94 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse86 .cse87 .cse89 .cse91))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_498| 4))))) (let ((.cse85 (select (select (store .cse93 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse94 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse86 .cse87 .cse89 .cse90 .cse91))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_496| 4))))) (let ((.cse88 (select (select (store .cse93 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse94 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse85 .cse86 .cse87 .cse89 .cse90 .cse91))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_494| 4))))) (or (< (+ .cse85 .cse86 .cse87 .cse88 .cse89 .cse90 .cse91) .cse92) (not (= .cse86 2)) (not (= 2 .cse89)) (not (= 2 .cse91)) (not (= .cse85 2)) (not (= 2 .cse90)) (not (= 2 .cse88)))))))))))) .cse11) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_498| Int) (v_ArrVal_1602 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_500| Int) (|v_ULTIMATE.start_main_~i~0#1_494| Int) (|v_ULTIMATE.start_main_~i~0#1_496| Int) (|v_ULTIMATE.start_main_~i~0#1_506| Int) (|v_ULTIMATE.start_main_~i~0#1_502| Int)) (let ((.cse102 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1602))) (let ((.cse103 (select .cse102 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse95 (select v_ArrVal_1602 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_506| 4)))) (.cse99 (select .cse103 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse97 (select (select (store .cse102 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse103 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse95 .cse99))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_502| 4))))) (let ((.cse96 (select (select (store .cse102 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse103 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse95 .cse99 .cse97))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_500| 4))))) (let ((.cse101 (select (select (store .cse102 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse103 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse95 .cse99 .cse96 .cse97))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_498| 4))))) (let ((.cse98 (select (select (store .cse102 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse103 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse95 .cse99 .cse96 .cse101 .cse97))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_496| 4))))) (let ((.cse100 (select (select (store .cse102 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse103 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse98 .cse95 .cse99 .cse96 .cse101 .cse97))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_494| 4))))) (or (not (= .cse95 2)) (not (= 2 .cse96)) (not (= 2 .cse97)) (< .cse92 (+ .cse98 .cse95 .cse99 .cse100 .cse96 .cse101 .cse97)) (not (= .cse98 2)) (not (= 2 .cse101)) (not (= 2 .cse100)))))))))))) .cse75) .cse33 (exists ((|ULTIMATE.start_main_~i~0#1| Int)) (= 2 (select .cse104 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or .cse31 (= .cse105 |c_ULTIMATE.start_main_#t~mem12#1|)) (or .cse65 (forall ((|v_ULTIMATE.start_main_~i~0#1_498| Int) (v_ArrVal_1602 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_500| Int) (|v_ULTIMATE.start_main_~i~0#1_494| Int) (|v_ULTIMATE.start_main_~i~0#1_496| Int) (|v_ULTIMATE.start_main_~i~0#1_506| Int) (|v_ULTIMATE.start_main_~i~0#1_502| Int)) (let ((.cse113 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1602))) (let ((.cse114 (select .cse113 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse106 (select v_ArrVal_1602 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_506| 4)))) (.cse110 (select .cse114 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse108 (select (select (store .cse113 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse114 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse106 .cse110))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_502| 4))))) (let ((.cse107 (select (select (store .cse113 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse114 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse106 .cse110 .cse108))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_500| 4))))) (let ((.cse112 (select (select (store .cse113 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse114 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse106 .cse110 .cse107 .cse108))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_498| 4))))) (let ((.cse109 (select (select (store .cse113 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse114 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse106 .cse110 .cse107 .cse112 .cse108))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_496| 4))))) (let ((.cse111 (select (select (store .cse113 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse114 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse109 .cse106 .cse110 .cse107 .cse112 .cse108))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_494| 4))))) (or (not (= .cse106 2)) (not (= 2 .cse107)) (not (= 2 .cse108)) (not (= .cse109 2)) (< (+ .cse109 .cse106 .cse110 .cse111 .cse107 .cse112 .cse108) .cse15) (not (= 2 .cse112)) (not (= 2 .cse111))))))))))))))))) is different from true [2022-11-25 17:30:45,650 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse75 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse76 (select .cse75 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse18 (* 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse86 (* c_~N~0 2))) (let ((.cse13 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse25 (< |c_ULTIMATE.start_main_~i~0#1| 5)) (.cse11 (forall ((|v_ULTIMATE.start_main_~i~0#1_498| Int) (v_ArrVal_1602 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_500| Int) (|v_ULTIMATE.start_main_~i~0#1_494| Int) (|v_ULTIMATE.start_main_~i~0#1_496| Int) (|v_ULTIMATE.start_main_~i~0#1_506| Int) (|v_ULTIMATE.start_main_~i~0#1_502| Int)) (let ((.cse94 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1602))) (let ((.cse95 (select .cse94 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse87 (select v_ArrVal_1602 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_506| 4)))) (.cse92 (select .cse95 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse89 (select (select (store .cse94 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse95 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse87 .cse92))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_502| 4))))) (let ((.cse88 (select (select (store .cse94 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse95 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse87 .cse92 .cse89))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_500| 4))))) (let ((.cse91 (select (select (store .cse94 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse95 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse87 .cse92 .cse88 .cse89))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_498| 4))))) (let ((.cse90 (select (select (store .cse94 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse95 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse87 .cse92 .cse88 .cse91 .cse89))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_496| 4))))) (let ((.cse93 (select (select (store .cse94 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse95 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse90 .cse87 .cse92 .cse88 .cse91 .cse89))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_494| 4))))) (or (not (= .cse87 2)) (not (= 2 .cse88)) (not (= 2 .cse89)) (not (= .cse90 2)) (not (= 2 .cse91)) (= .cse86 (+ .cse90 .cse87 .cse92 .cse93 .cse88 .cse91 .cse89)) (not (= 2 .cse93))))))))))))) (.cse33 (+ .cse18 3)) (.cse0 (< |c_ULTIMATE.start_main_~i~0#1| 3)) (.cse63 (+ .cse18 7)) (.cse46 (< |c_ULTIMATE.start_main_~i~0#1| 2)) (.cse14 (= .cse86 12)) (.cse12 (= 2 .cse76)) (.cse36 (< |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse4 (+ .cse18 5))) (and (or .cse0 (forall ((|v_ULTIMATE.start_main_~i~0#1_498| Int) (v_ArrVal_1602 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_500| Int) (|v_ULTIMATE.start_main_~i~0#1_494| Int) (|v_ULTIMATE.start_main_~i~0#1_496| Int) (|v_ULTIMATE.start_main_~i~0#1_506| Int) (|v_ULTIMATE.start_main_~i~0#1_502| Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1602))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_ArrVal_1602 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_506| 4)))) (.cse6 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_502| 4))))) (let ((.cse2 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse6 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_500| 4))))) (let ((.cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse6 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_498| 4))))) (let ((.cse5 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse6 .cse2 .cse8 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_496| 4))))) (let ((.cse7 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse1 .cse6 .cse2 .cse8 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_494| 4))))) (or (not (= .cse1 2)) (not (= 2 .cse2)) (not (= 2 .cse3)) (< .cse4 (+ .cse5 .cse1 .cse6 .cse7 .cse2 .cse8 .cse3)) (not (= .cse5 2)) (not (= 2 .cse8)) (not (= 2 .cse7))))))))))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (or (< c_~N~0 (+ 6 |c_ULTIMATE.start_main_~i~0#1|)) .cse11) (or (not .cse12) (and (<= 2 .cse13) (<= .cse13 2) .cse14)) (= .cse13 2) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_498| Int) (v_ArrVal_1602 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_500| Int) (|v_ULTIMATE.start_main_~i~0#1_494| Int) (|v_ULTIMATE.start_main_~i~0#1_496| Int) (|v_ULTIMATE.start_main_~i~0#1_506| Int) (|v_ULTIMATE.start_main_~i~0#1_502| Int)) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1602))) (let ((.cse24 (select .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (select v_ArrVal_1602 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_506| 4)))) (.cse20 (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse17 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_502| 4))))) (let ((.cse16 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse20 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_500| 4))))) (let ((.cse22 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse20 .cse16 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_498| 4))))) (let ((.cse19 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse20 .cse16 .cse22 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_496| 4))))) (let ((.cse21 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse15 .cse20 .cse16 .cse22 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_494| 4))))) (or (not (= .cse15 2)) (not (= 2 .cse16)) (not (= 2 .cse17)) (< (+ .cse18 1) (+ .cse19 .cse15 .cse20 .cse21 .cse16 .cse22 .cse17)) (not (= .cse19 2)) (not (= 2 .cse22)) (not (= 2 .cse21)))))))))))) .cse25) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_498| Int) (v_ArrVal_1602 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_500| Int) (|v_ULTIMATE.start_main_~i~0#1_494| Int) (|v_ULTIMATE.start_main_~i~0#1_496| Int) (|v_ULTIMATE.start_main_~i~0#1_506| Int) (|v_ULTIMATE.start_main_~i~0#1_502| Int)) (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1602))) (let ((.cse35 (select .cse34 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse26 (select v_ArrVal_1602 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_506| 4)))) (.cse31 (select .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse28 (select (select (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse26 .cse31))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_502| 4))))) (let ((.cse27 (select (select (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse26 .cse31 .cse28))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_500| 4))))) (let ((.cse30 (select (select (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse26 .cse31 .cse27 .cse28))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_498| 4))))) (let ((.cse29 (select (select (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse26 .cse31 .cse27 .cse30 .cse28))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_496| 4))))) (let ((.cse32 (select (select (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse29 .cse26 .cse31 .cse27 .cse30 .cse28))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_494| 4))))) (or (not (= .cse26 2)) (not (= 2 .cse27)) (not (= 2 .cse28)) (not (= .cse29 2)) (not (= 2 .cse30)) (< (+ .cse29 .cse26 .cse31 .cse32 .cse27 .cse30 .cse28) .cse33) (not (= 2 .cse32)))))))))))) .cse25) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0) (< c_~N~0 6) .cse11) (or .cse36 (forall ((|v_ULTIMATE.start_main_~i~0#1_498| Int) (v_ArrVal_1602 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_500| Int) (|v_ULTIMATE.start_main_~i~0#1_494| Int) (|v_ULTIMATE.start_main_~i~0#1_496| Int) (|v_ULTIMATE.start_main_~i~0#1_506| Int) (|v_ULTIMATE.start_main_~i~0#1_502| Int)) (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1602))) (let ((.cse45 (select .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse37 (select v_ArrVal_1602 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_506| 4)))) (.cse42 (select .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse39 (select (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse37 .cse42))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_502| 4))))) (let ((.cse38 (select (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse37 .cse42 .cse39))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_500| 4))))) (let ((.cse41 (select (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse37 .cse42 .cse38 .cse39))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_498| 4))))) (let ((.cse40 (select (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse37 .cse42 .cse38 .cse41 .cse39))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_496| 4))))) (let ((.cse43 (select (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse40 .cse37 .cse42 .cse38 .cse41 .cse39))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_494| 4))))) (or (not (= .cse37 2)) (not (= 2 .cse38)) (not (= 2 .cse39)) (not (= .cse40 2)) (not (= 2 .cse41)) (< .cse33 (+ .cse40 .cse37 .cse42 .cse43 .cse38 .cse41 .cse39)) (not (= 2 .cse43))))))))))))) (or .cse46 (forall ((|v_ULTIMATE.start_main_~i~0#1_498| Int) (v_ArrVal_1602 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_500| Int) (|v_ULTIMATE.start_main_~i~0#1_494| Int) (|v_ULTIMATE.start_main_~i~0#1_496| Int) (|v_ULTIMATE.start_main_~i~0#1_506| Int) (|v_ULTIMATE.start_main_~i~0#1_502| Int)) (let ((.cse54 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1602))) (let ((.cse55 (select .cse54 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse47 (select v_ArrVal_1602 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_506| 4)))) (.cse51 (select .cse55 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse49 (select (select (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse55 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse47 .cse51))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_502| 4))))) (let ((.cse48 (select (select (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse55 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse47 .cse51 .cse49))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_500| 4))))) (let ((.cse53 (select (select (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse55 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse47 .cse51 .cse48 .cse49))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_498| 4))))) (let ((.cse50 (select (select (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse55 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse47 .cse51 .cse48 .cse53 .cse49))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_496| 4))))) (let ((.cse52 (select (select (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse55 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse50 .cse47 .cse51 .cse48 .cse53 .cse49))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_494| 4))))) (or (not (= .cse47 2)) (not (= 2 .cse48)) (not (= 2 .cse49)) (< (+ .cse50 .cse47 .cse51 .cse52 .cse48 .cse53 .cse49) (+ .cse18 9)) (not (= .cse50 2)) (not (= 2 .cse53)) (not (= 2 .cse52))))))))))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_498| Int) (v_ArrVal_1602 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_500| Int) (|v_ULTIMATE.start_main_~i~0#1_494| Int) (|v_ULTIMATE.start_main_~i~0#1_496| Int) (|v_ULTIMATE.start_main_~i~0#1_506| Int) (|v_ULTIMATE.start_main_~i~0#1_502| Int)) (let ((.cse64 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1602))) (let ((.cse65 (select .cse64 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse57 (select v_ArrVal_1602 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_506| 4)))) (.cse58 (select .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse62 (select (select (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse57 .cse58))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_502| 4))))) (let ((.cse60 (select (select (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse57 .cse58 .cse62))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_500| 4))))) (let ((.cse61 (select (select (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse57 .cse58 .cse60 .cse62))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_498| 4))))) (let ((.cse56 (select (select (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse57 .cse58 .cse60 .cse61 .cse62))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_496| 4))))) (let ((.cse59 (select (select (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse56 .cse57 .cse58 .cse60 .cse61 .cse62))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_494| 4))))) (or (< (+ .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62) .cse63) (not (= .cse57 2)) (not (= 2 .cse60)) (not (= 2 .cse62)) (not (= .cse56 2)) (not (= 2 .cse61)) (not (= 2 .cse59)))))))))))) .cse0) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_498| Int) (v_ArrVal_1602 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_500| Int) (|v_ULTIMATE.start_main_~i~0#1_494| Int) (|v_ULTIMATE.start_main_~i~0#1_496| Int) (|v_ULTIMATE.start_main_~i~0#1_506| Int) (|v_ULTIMATE.start_main_~i~0#1_502| Int)) (let ((.cse73 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1602))) (let ((.cse74 (select .cse73 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse66 (select v_ArrVal_1602 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_506| 4)))) (.cse70 (select .cse74 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse68 (select (select (store .cse73 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse66 .cse70))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_502| 4))))) (let ((.cse67 (select (select (store .cse73 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse66 .cse70 .cse68))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_500| 4))))) (let ((.cse72 (select (select (store .cse73 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse66 .cse70 .cse67 .cse68))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_498| 4))))) (let ((.cse69 (select (select (store .cse73 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse66 .cse70 .cse67 .cse72 .cse68))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_496| 4))))) (let ((.cse71 (select (select (store .cse73 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse69 .cse66 .cse70 .cse67 .cse72 .cse68))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_494| 4))))) (or (not (= .cse66 2)) (not (= 2 .cse67)) (not (= 2 .cse68)) (< .cse63 (+ .cse69 .cse66 .cse70 .cse71 .cse67 .cse72 .cse68)) (not (= .cse69 2)) (not (= 2 .cse72)) (not (= 2 .cse71)))))))))))) .cse46) .cse14 (exists ((|ULTIMATE.start_main_~i~0#1| Int)) (= 2 (select .cse75 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or .cse12 (= .cse76 |c_ULTIMATE.start_main_#t~mem12#1|)) (or .cse36 (forall ((|v_ULTIMATE.start_main_~i~0#1_498| Int) (v_ArrVal_1602 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_500| Int) (|v_ULTIMATE.start_main_~i~0#1_494| Int) (|v_ULTIMATE.start_main_~i~0#1_496| Int) (|v_ULTIMATE.start_main_~i~0#1_506| Int) (|v_ULTIMATE.start_main_~i~0#1_502| Int)) (let ((.cse84 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1602))) (let ((.cse85 (select .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse77 (select v_ArrVal_1602 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_506| 4)))) (.cse81 (select .cse85 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse79 (select (select (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse77 .cse81))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_502| 4))))) (let ((.cse78 (select (select (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse77 .cse81 .cse79))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_500| 4))))) (let ((.cse83 (select (select (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse77 .cse81 .cse78 .cse79))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_498| 4))))) (let ((.cse80 (select (select (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse77 .cse81 .cse78 .cse83 .cse79))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_496| 4))))) (let ((.cse82 (select (select (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse80 .cse77 .cse81 .cse78 .cse83 .cse79))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_494| 4))))) (or (not (= .cse77 2)) (not (= 2 .cse78)) (not (= 2 .cse79)) (not (= .cse80 2)) (< (+ .cse80 .cse77 .cse81 .cse82 .cse78 .cse83 .cse79) .cse4) (not (= 2 .cse83)) (not (= 2 .cse82))))))))))))))))) is different from true [2022-11-25 17:30:57,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:30:59,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-11-25 17:31:09,774 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse55 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse56 (select .cse55 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse18 (* 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse66 (* c_~N~0 2))) (let ((.cse13 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse25 (< |c_ULTIMATE.start_main_~i~0#1| 5)) (.cse0 (forall ((|v_ULTIMATE.start_main_~i~0#1_498| Int) (v_ArrVal_1602 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_500| Int) (|v_ULTIMATE.start_main_~i~0#1_494| Int) (|v_ULTIMATE.start_main_~i~0#1_496| Int) (|v_ULTIMATE.start_main_~i~0#1_506| Int) (|v_ULTIMATE.start_main_~i~0#1_502| Int)) (let ((.cse74 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1602))) (let ((.cse75 (select .cse74 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse67 (select v_ArrVal_1602 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_506| 4)))) (.cse72 (select .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse69 (select (select (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse67 .cse72))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_502| 4))))) (let ((.cse68 (select (select (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse67 .cse72 .cse69))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_500| 4))))) (let ((.cse71 (select (select (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse67 .cse72 .cse68 .cse69))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_498| 4))))) (let ((.cse70 (select (select (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse67 .cse72 .cse68 .cse71 .cse69))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_496| 4))))) (let ((.cse73 (select (select (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse70 .cse67 .cse72 .cse68 .cse71 .cse69))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_494| 4))))) (or (not (= .cse67 2)) (not (= 2 .cse68)) (not (= 2 .cse69)) (not (= .cse70 2)) (not (= 2 .cse71)) (= .cse66 (+ .cse70 .cse67 .cse72 .cse73 .cse68 .cse71 .cse69)) (not (= 2 .cse73))))))))))))) (.cse33 (+ .cse18 3)) (.cse1 (< |c_ULTIMATE.start_main_~i~0#1| 3)) (.cse14 (= .cse66 12)) (.cse12 (= 2 .cse56)) (.cse36 (< |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse5 (+ .cse18 5))) (and (or (< c_~N~0 (+ 5 |c_ULTIMATE.start_main_~i~0#1|)) .cse0) (or .cse1 (forall ((|v_ULTIMATE.start_main_~i~0#1_498| Int) (v_ArrVal_1602 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_500| Int) (|v_ULTIMATE.start_main_~i~0#1_494| Int) (|v_ULTIMATE.start_main_~i~0#1_496| Int) (|v_ULTIMATE.start_main_~i~0#1_506| Int) (|v_ULTIMATE.start_main_~i~0#1_502| Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1602))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select v_ArrVal_1602 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_506| 4)))) (.cse7 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_502| 4))))) (let ((.cse3 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse7 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_500| 4))))) (let ((.cse9 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse7 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_498| 4))))) (let ((.cse6 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse7 .cse3 .cse9 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_496| 4))))) (let ((.cse8 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse2 .cse7 .cse3 .cse9 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_494| 4))))) (or (not (= .cse2 2)) (not (= 2 .cse3)) (not (= 2 .cse4)) (< .cse5 (+ .cse6 .cse2 .cse7 .cse8 .cse3 .cse9 .cse4)) (not (= .cse6 2)) (not (= 2 .cse9)) (not (= 2 .cse8))))))))))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (or (not .cse12) (and (<= 2 .cse13) (<= .cse13 2) .cse14)) (= .cse13 2) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_498| Int) (v_ArrVal_1602 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_500| Int) (|v_ULTIMATE.start_main_~i~0#1_494| Int) (|v_ULTIMATE.start_main_~i~0#1_496| Int) (|v_ULTIMATE.start_main_~i~0#1_506| Int) (|v_ULTIMATE.start_main_~i~0#1_502| Int)) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1602))) (let ((.cse24 (select .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (select v_ArrVal_1602 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_506| 4)))) (.cse20 (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse17 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_502| 4))))) (let ((.cse16 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse20 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_500| 4))))) (let ((.cse22 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse20 .cse16 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_498| 4))))) (let ((.cse19 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse20 .cse16 .cse22 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_496| 4))))) (let ((.cse21 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse15 .cse20 .cse16 .cse22 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_494| 4))))) (or (not (= .cse15 2)) (not (= 2 .cse16)) (not (= 2 .cse17)) (< (+ .cse18 1) (+ .cse19 .cse15 .cse20 .cse21 .cse16 .cse22 .cse17)) (not (= .cse19 2)) (not (= 2 .cse22)) (not (= 2 .cse21)))))))))))) .cse25) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_498| Int) (v_ArrVal_1602 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_500| Int) (|v_ULTIMATE.start_main_~i~0#1_494| Int) (|v_ULTIMATE.start_main_~i~0#1_496| Int) (|v_ULTIMATE.start_main_~i~0#1_506| Int) (|v_ULTIMATE.start_main_~i~0#1_502| Int)) (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1602))) (let ((.cse35 (select .cse34 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse26 (select v_ArrVal_1602 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_506| 4)))) (.cse31 (select .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse28 (select (select (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse26 .cse31))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_502| 4))))) (let ((.cse27 (select (select (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse26 .cse31 .cse28))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_500| 4))))) (let ((.cse30 (select (select (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse26 .cse31 .cse27 .cse28))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_498| 4))))) (let ((.cse29 (select (select (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse26 .cse31 .cse27 .cse30 .cse28))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_496| 4))))) (let ((.cse32 (select (select (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse29 .cse26 .cse31 .cse27 .cse30 .cse28))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_494| 4))))) (or (not (= .cse26 2)) (not (= 2 .cse27)) (not (= 2 .cse28)) (not (= .cse29 2)) (not (= 2 .cse30)) (< (+ .cse29 .cse26 .cse31 .cse32 .cse27 .cse30 .cse28) .cse33) (not (= 2 .cse32)))))))))))) .cse25) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0) (< c_~N~0 6) .cse0) (or .cse36 (forall ((|v_ULTIMATE.start_main_~i~0#1_498| Int) (v_ArrVal_1602 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_500| Int) (|v_ULTIMATE.start_main_~i~0#1_494| Int) (|v_ULTIMATE.start_main_~i~0#1_496| Int) (|v_ULTIMATE.start_main_~i~0#1_506| Int) (|v_ULTIMATE.start_main_~i~0#1_502| Int)) (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1602))) (let ((.cse45 (select .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse37 (select v_ArrVal_1602 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_506| 4)))) (.cse42 (select .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse39 (select (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse37 .cse42))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_502| 4))))) (let ((.cse38 (select (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse37 .cse42 .cse39))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_500| 4))))) (let ((.cse41 (select (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse37 .cse42 .cse38 .cse39))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_498| 4))))) (let ((.cse40 (select (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse37 .cse42 .cse38 .cse41 .cse39))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_496| 4))))) (let ((.cse43 (select (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse40 .cse37 .cse42 .cse38 .cse41 .cse39))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_494| 4))))) (or (not (= .cse37 2)) (not (= 2 .cse38)) (not (= 2 .cse39)) (not (= .cse40 2)) (not (= 2 .cse41)) (< .cse33 (+ .cse40 .cse37 .cse42 .cse43 .cse38 .cse41 .cse39)) (not (= 2 .cse43))))))))))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_498| Int) (v_ArrVal_1602 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_500| Int) (|v_ULTIMATE.start_main_~i~0#1_494| Int) (|v_ULTIMATE.start_main_~i~0#1_496| Int) (|v_ULTIMATE.start_main_~i~0#1_506| Int) (|v_ULTIMATE.start_main_~i~0#1_502| Int)) (let ((.cse53 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1602))) (let ((.cse54 (select .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse47 (select v_ArrVal_1602 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_506| 4)))) (.cse48 (select .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse52 (select (select (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse47 .cse48))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_502| 4))))) (let ((.cse50 (select (select (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse47 .cse48 .cse52))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_500| 4))))) (let ((.cse51 (select (select (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse47 .cse48 .cse50 .cse52))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_498| 4))))) (let ((.cse46 (select (select (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse47 .cse48 .cse50 .cse51 .cse52))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_496| 4))))) (let ((.cse49 (select (select (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse46 .cse47 .cse48 .cse50 .cse51 .cse52))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_494| 4))))) (or (< (+ .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52) (+ .cse18 7)) (not (= .cse47 2)) (not (= 2 .cse50)) (not (= 2 .cse52)) (not (= .cse46 2)) (not (= 2 .cse51)) (not (= 2 .cse49)))))))))))) .cse1) .cse14 (exists ((|ULTIMATE.start_main_~i~0#1| Int)) (= 2 (select .cse55 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or .cse12 (= .cse56 |c_ULTIMATE.start_main_#t~mem12#1|)) (or .cse36 (forall ((|v_ULTIMATE.start_main_~i~0#1_498| Int) (v_ArrVal_1602 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_500| Int) (|v_ULTIMATE.start_main_~i~0#1_494| Int) (|v_ULTIMATE.start_main_~i~0#1_496| Int) (|v_ULTIMATE.start_main_~i~0#1_506| Int) (|v_ULTIMATE.start_main_~i~0#1_502| Int)) (let ((.cse64 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1602))) (let ((.cse65 (select .cse64 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse57 (select v_ArrVal_1602 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_506| 4)))) (.cse61 (select .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse59 (select (select (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse57 .cse61))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_502| 4))))) (let ((.cse58 (select (select (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse57 .cse61 .cse59))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_500| 4))))) (let ((.cse63 (select (select (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse57 .cse61 .cse58 .cse59))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_498| 4))))) (let ((.cse60 (select (select (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse57 .cse61 .cse58 .cse63 .cse59))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_496| 4))))) (let ((.cse62 (select (select (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse60 .cse57 .cse61 .cse58 .cse63 .cse59))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_494| 4))))) (or (not (= .cse57 2)) (not (= 2 .cse58)) (not (= 2 .cse59)) (not (= .cse60 2)) (< (+ .cse60 .cse57 .cse61 .cse62 .cse58 .cse63 .cse59) .cse5) (not (= 2 .cse63)) (not (= 2 .cse62))))))))))))))))) is different from true