./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/mods.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/array-fpi/mods.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f15d84a1f588b4a2fae1a1f53311fed1d9572550b31409f886696465cdc8f8ba --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 04:02:12,431 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 04:02:12,434 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 04:02:12,486 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 04:02:12,487 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 04:02:12,490 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 04:02:12,493 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 04:02:12,497 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 04:02:12,499 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 04:02:12,505 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 04:02:12,506 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 04:02:12,509 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 04:02:12,509 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 04:02:12,512 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 04:02:12,514 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 04:02:12,516 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 04:02:12,518 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 04:02:12,520 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 04:02:12,522 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 04:02:12,533 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 04:02:12,535 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 04:02:12,537 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 04:02:12,541 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 04:02:12,543 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 04:02:12,553 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 04:02:12,553 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 04:02:12,554 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 04:02:12,556 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 04:02:12,556 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 04:02:12,557 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 04:02:12,558 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 04:02:12,559 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 04:02:12,562 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 04:02:12,563 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 04:02:12,566 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 04:02:12,566 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 04:02:12,567 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 04:02:12,568 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 04:02:12,568 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 04:02:12,569 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 04:02:12,570 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 04:02:12,572 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 04:02:12,611 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 04:02:12,611 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 04:02:12,612 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 04:02:12,612 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 04:02:12,613 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 04:02:12,614 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 04:02:12,614 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 04:02:12,614 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 04:02:12,614 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 04:02:12,615 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 04:02:12,616 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 04:02:12,616 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 04:02:12,616 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 04:02:12,617 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 04:02:12,617 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 04:02:12,617 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 04:02:12,617 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 04:02:12,618 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 04:02:12,618 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 04:02:12,619 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 04:02:12,619 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 04:02:12,619 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 04:02:12,619 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 04:02:12,620 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 04:02:12,620 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 04:02:12,620 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 04:02:12,620 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 04:02:12,620 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 04:02:12,621 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 04:02:12,621 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 04:02:12,621 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 04:02:12,622 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 04:02:12,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 04:02:12,622 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 04:02:12,622 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 04:02:12,623 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 04:02:12,623 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 04:02:12,623 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 04:02:12,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 04:02:12,624 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 04:02:12,624 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 04:02:12,624 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/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_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI 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 -> Taipan 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 -> f15d84a1f588b4a2fae1a1f53311fed1d9572550b31409f886696465cdc8f8ba [2022-11-03 04:02:12,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 04:02:12,945 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 04:02:12,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 04:02:12,949 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 04:02:12,950 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 04:02:12,952 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/array-fpi/mods.c [2022-11-03 04:02:13,035 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/data/82ae4574d/ec9bab66b71c42f5a16618b51281f5d6/FLAG6c62f851e [2022-11-03 04:02:13,506 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 04:02:13,507 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/sv-benchmarks/c/array-fpi/mods.c [2022-11-03 04:02:13,514 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/data/82ae4574d/ec9bab66b71c42f5a16618b51281f5d6/FLAG6c62f851e [2022-11-03 04:02:13,891 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/data/82ae4574d/ec9bab66b71c42f5a16618b51281f5d6 [2022-11-03 04:02:13,896 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 04:02:13,899 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 04:02:13,904 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 04:02:13,904 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 04:02:13,908 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 04:02:13,909 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:02:13" (1/1) ... [2022-11-03 04:02:13,910 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74a5824c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:02:13, skipping insertion in model container [2022-11-03 04:02:13,911 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:02:13" (1/1) ... [2022-11-03 04:02:13,920 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 04:02:13,938 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 04:02:14,177 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/sv-benchmarks/c/array-fpi/mods.c[587,600] [2022-11-03 04:02:14,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 04:02:14,232 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 04:02:14,252 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/sv-benchmarks/c/array-fpi/mods.c[587,600] [2022-11-03 04:02:14,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 04:02:14,295 INFO L208 MainTranslator]: Completed translation [2022-11-03 04:02:14,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:02:14 WrapperNode [2022-11-03 04:02:14,296 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 04:02:14,297 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 04:02:14,298 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 04:02:14,298 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 04:02:14,305 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:02:14" (1/1) ... [2022-11-03 04:02:14,324 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:02:14" (1/1) ... [2022-11-03 04:02:14,363 INFO L138 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 104 [2022-11-03 04:02:14,363 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 04:02:14,364 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 04:02:14,365 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 04:02:14,365 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 04:02:14,376 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:02:14" (1/1) ... [2022-11-03 04:02:14,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:02:14" (1/1) ... [2022-11-03 04:02:14,384 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:02:14" (1/1) ... [2022-11-03 04:02:14,384 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:02:14" (1/1) ... [2022-11-03 04:02:14,400 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:02:14" (1/1) ... [2022-11-03 04:02:14,405 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:02:14" (1/1) ... [2022-11-03 04:02:14,406 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:02:14" (1/1) ... [2022-11-03 04:02:14,407 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:02:14" (1/1) ... [2022-11-03 04:02:14,410 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 04:02:14,411 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 04:02:14,411 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 04:02:14,411 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 04:02:14,412 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:02:14" (1/1) ... [2022-11-03 04:02:14,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 04:02:14,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:02:14,449 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 04:02:14,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 04:02:14,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 04:02:14,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 04:02:14,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 04:02:14,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 04:02:14,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 04:02:14,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 04:02:14,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 04:02:14,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 04:02:14,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 04:02:14,583 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 04:02:14,585 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 04:02:14,882 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 04:02:14,950 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 04:02:14,950 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-03 04:02:14,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:02:14 BoogieIcfgContainer [2022-11-03 04:02:14,953 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 04:02:14,955 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 04:02:14,955 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 04:02:14,959 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 04:02:14,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 04:02:13" (1/3) ... [2022-11-03 04:02:14,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f7bf15b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:02:14, skipping insertion in model container [2022-11-03 04:02:14,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:02:14" (2/3) ... [2022-11-03 04:02:14,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f7bf15b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:02:14, skipping insertion in model container [2022-11-03 04:02:14,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:02:14" (3/3) ... [2022-11-03 04:02:14,963 INFO L112 eAbstractionObserver]: Analyzing ICFG mods.c [2022-11-03 04:02:14,984 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 04:02:14,984 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 04:02:15,035 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 04:02:15,042 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=FINITE_AUTOMATA, 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;@e370ddf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 04:02:15,043 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 04:02:15,047 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 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-03 04:02:15,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 04:02:15,053 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:02:15,054 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:02:15,055 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:02:15,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:02:15,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1473824747, now seen corresponding path program 1 times [2022-11-03 04:02:15,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:02:15,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33308731] [2022-11-03 04:02:15,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:02:15,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:02:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:02:15,570 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-03 04:02:15,574 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:02:15,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33308731] [2022-11-03 04:02:15,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33308731] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:02:15,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:02:15,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 04:02:15,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393067992] [2022-11-03 04:02:15,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:02:15,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:02:15,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:02:15,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:02:15,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:02:15,629 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 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 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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-03 04:02:15,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:02:15,700 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2022-11-03 04:02:15,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:02:15,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-11-03 04:02:15,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:02:15,712 INFO L225 Difference]: With dead ends: 24 [2022-11-03 04:02:15,712 INFO L226 Difference]: Without dead ends: 12 [2022-11-03 04:02:15,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:02:15,719 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:02:15,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:02:15,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-11-03 04:02:15,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-11-03 04:02:15,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:02:15,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2022-11-03 04:02:15,755 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 9 [2022-11-03 04:02:15,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:02:15,755 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-11-03 04:02:15,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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-03 04:02:15,756 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2022-11-03 04:02:15,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 04:02:15,757 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:02:15,757 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:02:15,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 04:02:15,758 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:02:15,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:02:15,759 INFO L85 PathProgramCache]: Analyzing trace with hash -332942029, now seen corresponding path program 1 times [2022-11-03 04:02:15,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:02:15,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150397895] [2022-11-03 04:02:15,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:02:15,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:02:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:02:15,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:02:15,919 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:02:15,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150397895] [2022-11-03 04:02:15,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150397895] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:02:15,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:02:15,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 04:02:15,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279656386] [2022-11-03 04:02:15,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:02:15,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 04:02:15,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:02:15,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 04:02:15,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 04:02:15,923 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:02:15,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:02:15,969 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-11-03 04:02:15,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 04:02:15,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-03 04:02:15,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:02:15,970 INFO L225 Difference]: With dead ends: 27 [2022-11-03 04:02:15,970 INFO L226 Difference]: Without dead ends: 20 [2022-11-03 04:02:15,971 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-03 04:02:15,972 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 04:02:15,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 6 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 04:02:15,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-03 04:02:15,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2022-11-03 04:02:15,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 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-03 04:02:15,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2022-11-03 04:02:15,988 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 10 [2022-11-03 04:02:15,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:02:15,990 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2022-11-03 04:02:15,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:02:15,994 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2022-11-03 04:02:15,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 04:02:15,996 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:02:15,996 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:02:15,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 04:02:15,997 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:02:15,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:02:15,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1080912201, now seen corresponding path program 1 times [2022-11-03 04:02:16,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:02:16,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006367640] [2022-11-03 04:02:16,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:02:16,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:02:16,034 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 04:02:16,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [52024204] [2022-11-03 04:02:16,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:02:16,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:02:16,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:02:16,037 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:02:16,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 04:02:16,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:02:16,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-03 04:02:16,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:02:16,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-03 04:02:16,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:02:16,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-03 04:02:16,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2022-11-03 04:02:16,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 04:02:16,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 51 [2022-11-03 04:02:16,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 53 treesize of output 29 [2022-11-03 04:02:16,944 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:02:16,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:02:19,525 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_54 Int)) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (= (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_54)))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse0 (+ (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_54))) (mod .cse0 (+ 1 (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| .cse0)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) 0) (not (<= (+ (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_54))))) is different from false [2022-11-03 04:02:21,572 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_54 Int)) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (= (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_54)))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse0 (+ (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_54))) (mod .cse0 (+ 1 (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| .cse0)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) 0) (not (<= (+ (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_54))))) is different from false [2022-11-03 04:02:25,886 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 04:02:25,886 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:02:25,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006367640] [2022-11-03 04:02:25,887 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 04:02:25,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52024204] [2022-11-03 04:02:25,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52024204] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:02:25,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1533459825] [2022-11-03 04:02:25,906 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-03 04:02:25,906 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 04:02:25,910 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 04:02:25,915 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 04:02:25,916 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 04:02:25,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:25,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:25,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:26,079 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 04:02:26,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-03 04:02:26,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:26,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:26,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 39 [2022-11-03 04:02:26,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:26,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 25 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 98 [2022-11-03 04:02:26,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:26,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:26,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 30 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 113 [2022-11-03 04:02:26,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:26,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:26,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:26,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:26,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:26,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:26,397 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:02:26,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:26,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:26,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:26,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:26,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:26,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:26,478 INFO L356 Elim1Store]: treesize reduction 166, result has 11.7 percent of original size [2022-11-03 04:02:26,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 34 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 22 case distinctions, treesize of input 434 treesize of output 423 [2022-11-03 04:02:26,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-03 04:02:26,639 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:02:26,670 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 04:02:26,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-03 04:02:26,782 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 04:02:26,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 54 [2022-11-03 04:02:26,850 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:02:26,886 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 04:02:26,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 34 [2022-11-03 04:02:26,992 INFO L356 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-03 04:02:26,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 54 [2022-11-03 04:02:27,054 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:02:27,164 INFO L356 Elim1Store]: treesize reduction 53, result has 27.4 percent of original size [2022-11-03 04:02:27,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 73 [2022-11-03 04:02:27,448 INFO L356 Elim1Store]: treesize reduction 63, result has 38.8 percent of original size [2022-11-03 04:02:27,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 93 [2022-11-03 04:02:27,525 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 04:02:28,252 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '234#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= |ULTIMATE.start_main_#t~mem17#1| 0) 1 0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8))) |ULTIMATE.start_main_#t~mem17#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-03 04:02:28,252 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 04:02:28,253 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 04:02:28,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2022-11-03 04:02:28,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987206208] [2022-11-03 04:02:28,253 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 04:02:28,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-03 04:02:28,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:02:28,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-03 04:02:28,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=474, Unknown=3, NotChecked=90, Total=650 [2022-11-03 04:02:28,256 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 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-03 04:02:37,296 WARN L234 SmtUtils]: Spent 8.62s on a formula simplification. DAG size of input: 46 DAG size of output: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 04:02:39,335 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 [] [2022-11-03 04:02:40,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-03 04:02:42,739 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 [] [2022-11-03 04:02:43,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:02:43,764 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2022-11-03 04:02:43,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 04:02:43,765 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 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) Word has length 13 [2022-11-03 04:02:43,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:02:43,766 INFO L225 Difference]: With dead ends: 29 [2022-11-03 04:02:43,766 INFO L226 Difference]: Without dead ends: 27 [2022-11-03 04:02:43,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=103, Invalid=604, Unknown=3, NotChecked=102, Total=812 [2022-11-03 04:02:43,768 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 6 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 19 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-11-03 04:02:43,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 34 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 153 Invalid, 2 Unknown, 59 Unchecked, 5.9s Time] [2022-11-03 04:02:43,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-03 04:02:43,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2022-11-03 04:02:43,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 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-03 04:02:43,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2022-11-03 04:02:43,776 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 13 [2022-11-03 04:02:43,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:02:43,776 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2022-11-03 04:02:43,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 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-03 04:02:43,777 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2022-11-03 04:02:43,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 04:02:43,777 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:02:43,777 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:02:43,811 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-03 04:02:43,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:02:43,999 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:02:44,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:02:44,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1737417492, now seen corresponding path program 2 times [2022-11-03 04:02:44,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:02:44,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329573539] [2022-11-03 04:02:44,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:02:44,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:02:44,021 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 04:02:44,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [617335577] [2022-11-03 04:02:44,022 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:02:44,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:02:44,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:02:44,023 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:02:44,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 04:02:44,114 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 04:02:44,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:02:44,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 04:02:44,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:02:44,154 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 04:02:44,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:02:44,184 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 04:02:44,185 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:02:44,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329573539] [2022-11-03 04:02:44,185 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 04:02:44,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617335577] [2022-11-03 04:02:44,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617335577] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:02:44,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1905933955] [2022-11-03 04:02:44,187 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-03 04:02:44,188 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 04:02:44,188 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 04:02:44,188 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 04:02:44,188 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 04:02:44,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:44,231 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 04:02:44,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 23 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 102 [2022-11-03 04:02:44,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:44,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:44,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:44,361 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 04:02:44,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-03 04:02:44,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:44,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:44,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 39 [2022-11-03 04:02:44,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:44,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:44,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 30 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 108 [2022-11-03 04:02:44,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:44,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:44,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:44,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:44,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:44,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:44,610 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:02:44,610 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:02:44,682 INFO L356 Elim1Store]: treesize reduction 154, result has 18.5 percent of original size [2022-11-03 04:02:44,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 27 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 23 case distinctions, treesize of input 429 treesize of output 424 [2022-11-03 04:02:44,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-03 04:02:44,910 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:02:44,937 INFO L356 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-03 04:02:44,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 34 [2022-11-03 04:02:45,022 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 04:02:45,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 54 [2022-11-03 04:02:45,079 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:02:45,107 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 04:02:45,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 34 [2022-11-03 04:02:45,215 INFO L356 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-03 04:02:45,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 54 [2022-11-03 04:02:45,265 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:02:45,420 INFO L356 Elim1Store]: treesize reduction 53, result has 27.4 percent of original size [2022-11-03 04:02:45,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 68 [2022-11-03 04:02:45,848 INFO L356 Elim1Store]: treesize reduction 63, result has 38.8 percent of original size [2022-11-03 04:02:45,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 93 [2022-11-03 04:02:45,908 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 04:02:46,490 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '423#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= |ULTIMATE.start_main_#t~mem17#1| 0) 1 0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8))) |ULTIMATE.start_main_#t~mem17#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-03 04:02:46,490 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 04:02:46,490 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 04:02:46,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-11-03 04:02:46,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052250347] [2022-11-03 04:02:46,491 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 04:02:46,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 04:02:46,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:02:46,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 04:02:46,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-11-03 04:02:46,492 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:02:46,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:02:46,635 INFO L93 Difference]: Finished difference Result 61 states and 79 transitions. [2022-11-03 04:02:46,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 04:02:46,637 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-03 04:02:46,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:02:46,637 INFO L225 Difference]: With dead ends: 61 [2022-11-03 04:02:46,637 INFO L226 Difference]: Without dead ends: 35 [2022-11-03 04:02:46,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 9 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-11-03 04:02:46,639 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 24 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:02:46,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 21 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:02:46,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-03 04:02:46,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 23. [2022-11-03 04:02:46,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 0 states have call successors, (0), 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-03 04:02:46,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2022-11-03 04:02:46,645 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 14 [2022-11-03 04:02:46,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:02:46,645 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-11-03 04:02:46,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:02:46,646 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-11-03 04:02:46,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 04:02:46,646 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:02:46,646 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:02:46,687 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 04:02:46,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:02:46,847 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:02:46,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:02:46,848 INFO L85 PathProgramCache]: Analyzing trace with hash 996737740, now seen corresponding path program 3 times [2022-11-03 04:02:46,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:02:46,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554517357] [2022-11-03 04:02:46,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:02:46,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:02:46,869 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 04:02:46,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [431143102] [2022-11-03 04:02:46,877 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 04:02:46,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:02:46,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:02:46,881 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:02:46,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 04:02:46,945 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 04:02:46,945 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:02:46,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 04:02:46,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:02:46,994 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 04:02:46,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:02:47,039 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 04:02:47,040 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:02:47,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554517357] [2022-11-03 04:02:47,040 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 04:02:47,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431143102] [2022-11-03 04:02:47,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431143102] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:02:47,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [504262690] [2022-11-03 04:02:47,042 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-03 04:02:47,043 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 04:02:47,043 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 04:02:47,043 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 04:02:47,043 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 04:02:47,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:47,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:47,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:47,159 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 04:02:47,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-03 04:02:47,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:47,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:47,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 39 [2022-11-03 04:02:47,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:47,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 25 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 98 [2022-11-03 04:02:47,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:47,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:47,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 30 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 108 [2022-11-03 04:02:47,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:47,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:47,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:47,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:47,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:47,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:47,421 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:02:47,422 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:02:47,496 INFO L356 Elim1Store]: treesize reduction 154, result has 18.5 percent of original size [2022-11-03 04:02:47,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 27 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 23 case distinctions, treesize of input 429 treesize of output 424 [2022-11-03 04:02:47,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-03 04:02:47,713 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:02:47,738 INFO L356 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-03 04:02:47,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 34 [2022-11-03 04:02:47,814 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 04:02:47,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 54 [2022-11-03 04:02:47,857 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:02:47,883 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 04:02:47,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 34 [2022-11-03 04:02:47,974 INFO L356 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-03 04:02:47,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 54 [2022-11-03 04:02:48,047 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:02:48,084 INFO L356 Elim1Store]: treesize reduction 53, result has 27.4 percent of original size [2022-11-03 04:02:48,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 68 [2022-11-03 04:02:48,399 INFO L356 Elim1Store]: treesize reduction 63, result has 38.8 percent of original size [2022-11-03 04:02:48,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 93 [2022-11-03 04:02:48,452 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 04:02:48,999 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '662#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= |ULTIMATE.start_main_#t~mem17#1| 0) 1 0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8))) |ULTIMATE.start_main_#t~mem17#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-03 04:02:48,999 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 04:02:48,999 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 04:02:48,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-11-03 04:02:48,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189986602] [2022-11-03 04:02:48,999 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 04:02:49,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 04:02:49,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:02:49,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 04:02:49,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-11-03 04:02:49,001 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:02:49,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:02:49,185 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-11-03 04:02:49,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 04:02:49,186 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 04:02:49,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:02:49,187 INFO L225 Difference]: With dead ends: 35 [2022-11-03 04:02:49,187 INFO L226 Difference]: Without dead ends: 29 [2022-11-03 04:02:49,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 10 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2022-11-03 04:02:49,188 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 35 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:02:49,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 18 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:02:49,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-03 04:02:49,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 19. [2022-11-03 04:02:49,197 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-03 04:02:49,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-11-03 04:02:49,203 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 15 [2022-11-03 04:02:49,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:02:49,203 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-11-03 04:02:49,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:02:49,203 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-11-03 04:02:49,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 04:02:49,204 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:02:49,204 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:02:49,248 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 04:02:49,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:02:49,431 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:02:49,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:02:49,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1834853461, now seen corresponding path program 4 times [2022-11-03 04:02:49,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:02:49,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833542760] [2022-11-03 04:02:49,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:02:49,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:02:49,449 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 04:02:49,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1019782920] [2022-11-03 04:02:49,463 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 04:02:49,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:02:49,463 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:02:49,464 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:02:49,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 04:02:49,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:02:49,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-03 04:02:49,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:02:49,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-03 04:02:49,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:02:49,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-03 04:02:49,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:49,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 04:02:49,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:49,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2022-11-03 04:02:49,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:49,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2022-11-03 04:02:49,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:49,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 39 [2022-11-03 04:02:49,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:49,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 39 [2022-11-03 04:02:49,984 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:02:49,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:49,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 87 [2022-11-03 04:02:50,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:50,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2022-11-03 04:02:50,330 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:02:50,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:02:57,059 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:02:57,059 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:02:57,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833542760] [2022-11-03 04:02:57,059 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 04:02:57,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019782920] [2022-11-03 04:02:57,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019782920] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:02:57,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [470078498] [2022-11-03 04:02:57,062 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-03 04:02:57,062 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 04:02:57,062 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 04:02:57,063 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 04:02:57,063 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 04:02:57,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:57,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:57,173 INFO L356 Elim1Store]: treesize reduction 68, result has 33.3 percent of original size [2022-11-03 04:02:57,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 57 [2022-11-03 04:02:57,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:57,214 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 04:02:57,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 23 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 102 [2022-11-03 04:02:57,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:57,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:57,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:57,339 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 04:02:57,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-03 04:02:57,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:57,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:57,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 30 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 113 [2022-11-03 04:02:57,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:57,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:57,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:57,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:57,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:57,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:57,526 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:02:57,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:57,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:57,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:57,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:57,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:57,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:57,606 INFO L356 Elim1Store]: treesize reduction 166, result has 11.7 percent of original size [2022-11-03 04:02:57,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 34 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 22 case distinctions, treesize of input 434 treesize of output 423 [2022-11-03 04:02:57,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-03 04:02:57,740 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:02:57,768 INFO L356 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-03 04:02:57,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 34 [2022-11-03 04:02:57,849 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 04:02:57,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 54 [2022-11-03 04:02:57,889 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:02:57,916 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 04:02:57,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 34 [2022-11-03 04:02:58,000 INFO L356 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-03 04:02:58,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 54 [2022-11-03 04:02:58,040 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:02:58,109 INFO L356 Elim1Store]: treesize reduction 53, result has 27.4 percent of original size [2022-11-03 04:02:58,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 68 [2022-11-03 04:02:58,216 INFO L356 Elim1Store]: treesize reduction 63, result has 38.8 percent of original size [2022-11-03 04:02:58,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 93 [2022-11-03 04:02:58,267 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 04:02:59,123 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '888#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= |ULTIMATE.start_main_#t~mem17#1| 0) 1 0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8))) |ULTIMATE.start_main_#t~mem17#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-03 04:02:59,124 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 04:02:59,124 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 04:02:59,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2022-11-03 04:02:59,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202212793] [2022-11-03 04:02:59,124 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 04:02:59,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-03 04:02:59,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:02:59,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-03 04:02:59,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=984, Unknown=0, NotChecked=0, Total=1122 [2022-11-03 04:02:59,126 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 29 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:03:14,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:03:14,229 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-11-03 04:03:14,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-03 04:03:14,229 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 04:03:14,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:03:14,230 INFO L225 Difference]: With dead ends: 38 [2022-11-03 04:03:14,230 INFO L226 Difference]: Without dead ends: 36 [2022-11-03 04:03:14,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 21.1s TimeCoverageRelationStatistics Valid=180, Invalid=1298, Unknown=4, NotChecked=0, Total=1482 [2022-11-03 04:03:14,232 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 10 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-03 04:03:14,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 37 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 197 Invalid, 0 Unknown, 65 Unchecked, 1.5s Time] [2022-11-03 04:03:14,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-11-03 04:03:14,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2022-11-03 04:03:14,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 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-03 04:03:14,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2022-11-03 04:03:14,242 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 17 [2022-11-03 04:03:14,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:03:14,242 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2022-11-03 04:03:14,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:03:14,243 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-11-03 04:03:14,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 04:03:14,243 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:03:14,243 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:03:14,283 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 04:03:14,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:03:14,471 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:03:14,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:03:14,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1784474046, now seen corresponding path program 5 times [2022-11-03 04:03:14,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:03:14,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130469920] [2022-11-03 04:03:14,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:03:14,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:03:14,493 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 04:03:14,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [521907271] [2022-11-03 04:03:14,494 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:03:14,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:03:14,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:03:14,495 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:03:14,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 04:03:14,663 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 04:03:14,663 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:03:14,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 04:03:14,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:03:14,738 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 04:03:14,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:03:14,791 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 04:03:14,792 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:03:14,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130469920] [2022-11-03 04:03:14,792 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 04:03:14,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521907271] [2022-11-03 04:03:14,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521907271] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:03:14,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1498887584] [2022-11-03 04:03:14,796 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-03 04:03:14,796 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 04:03:14,797 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 04:03:14,797 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 04:03:14,797 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 04:03:14,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:14,838 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 04:03:14,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 23 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 102 [2022-11-03 04:03:14,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:14,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:14,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:14,942 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 04:03:14,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-03 04:03:14,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:14,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:14,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 39 [2022-11-03 04:03:15,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:15,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:15,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 30 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 113 [2022-11-03 04:03:15,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:15,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:15,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:15,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:15,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:15,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:15,127 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:03:15,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:15,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:15,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:15,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:15,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:15,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:15,200 INFO L356 Elim1Store]: treesize reduction 166, result has 11.7 percent of original size [2022-11-03 04:03:15,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 34 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 22 case distinctions, treesize of input 434 treesize of output 423 [2022-11-03 04:03:15,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-03 04:03:15,334 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:03:15,363 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 04:03:15,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-03 04:03:15,444 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 04:03:15,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 54 [2022-11-03 04:03:15,484 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:03:15,514 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 04:03:15,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-03 04:03:15,574 INFO L356 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-03 04:03:15,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 54 [2022-11-03 04:03:15,592 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:03:15,640 INFO L356 Elim1Store]: treesize reduction 53, result has 27.4 percent of original size [2022-11-03 04:03:15,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 73 [2022-11-03 04:03:15,735 INFO L356 Elim1Store]: treesize reduction 63, result has 38.8 percent of original size [2022-11-03 04:03:15,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 93 [2022-11-03 04:03:15,793 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 04:03:16,221 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1141#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= |ULTIMATE.start_main_#t~mem17#1| 0) 1 0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8))) |ULTIMATE.start_main_#t~mem17#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-03 04:03:16,221 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 04:03:16,222 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 04:03:16,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-11-03 04:03:16,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144602293] [2022-11-03 04:03:16,222 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 04:03:16,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 04:03:16,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:03:16,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 04:03:16,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-11-03 04:03:16,224 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 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-03 04:03:16,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:03:16,414 INFO L93 Difference]: Finished difference Result 82 states and 100 transitions. [2022-11-03 04:03:16,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 04:03:16,417 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-03 04:03:16,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:03:16,423 INFO L225 Difference]: With dead ends: 82 [2022-11-03 04:03:16,423 INFO L226 Difference]: Without dead ends: 61 [2022-11-03 04:03:16,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2022-11-03 04:03:16,425 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 64 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:03:16,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 27 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:03:16,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-03 04:03:16,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 42. [2022-11-03 04:03:16,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 41 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-03 04:03:16,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2022-11-03 04:03:16,448 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 18 [2022-11-03 04:03:16,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:03:16,448 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2022-11-03 04:03:16,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 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-03 04:03:16,449 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-11-03 04:03:16,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 04:03:16,450 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:03:16,450 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:03:16,479 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 04:03:16,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-03 04:03:16,659 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:03:16,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:03:16,660 INFO L85 PathProgramCache]: Analyzing trace with hash -2144309898, now seen corresponding path program 6 times [2022-11-03 04:03:16,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:03:16,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279055943] [2022-11-03 04:03:16,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:03:16,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:03:16,685 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 04:03:16,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [508823120] [2022-11-03 04:03:16,688 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 04:03:16,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:03:16,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:03:16,689 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:03:16,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 04:03:16,759 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 04:03:16,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:03:16,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 04:03:16,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:03:16,830 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-03 04:03:16,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:03:16,888 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-03 04:03:16,888 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:03:16,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279055943] [2022-11-03 04:03:16,889 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 04:03:16,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508823120] [2022-11-03 04:03:16,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508823120] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:03:16,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1687204211] [2022-11-03 04:03:16,891 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-03 04:03:16,891 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 04:03:16,892 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 04:03:16,892 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 04:03:16,892 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 04:03:16,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:16,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:16,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:17,000 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 04:03:17,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-03 04:03:17,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:17,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:17,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 39 [2022-11-03 04:03:17,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:17,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 25 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 98 [2022-11-03 04:03:17,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:17,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:17,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 30 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 108 [2022-11-03 04:03:17,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:17,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:17,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:17,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:17,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:17,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:17,203 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:03:17,204 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:03:17,274 INFO L356 Elim1Store]: treesize reduction 154, result has 18.5 percent of original size [2022-11-03 04:03:17,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 27 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 23 case distinctions, treesize of input 429 treesize of output 424 [2022-11-03 04:03:17,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-03 04:03:17,476 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 04:03:17,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-03 04:03:17,549 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 04:03:17,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 54 [2022-11-03 04:03:17,590 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:03:17,614 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 04:03:17,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-03 04:03:17,685 INFO L356 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-03 04:03:17,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 54 [2022-11-03 04:03:17,708 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:03:17,821 INFO L356 Elim1Store]: treesize reduction 53, result has 27.4 percent of original size [2022-11-03 04:03:17,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 73 [2022-11-03 04:03:17,926 INFO L356 Elim1Store]: treesize reduction 63, result has 38.8 percent of original size [2022-11-03 04:03:17,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 93 [2022-11-03 04:03:17,989 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 04:03:18,479 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1478#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= |ULTIMATE.start_main_#t~mem17#1| 0) 1 0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8))) |ULTIMATE.start_main_#t~mem17#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-03 04:03:18,479 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 04:03:18,479 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 04:03:18,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-11-03 04:03:18,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970254028] [2022-11-03 04:03:18,479 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 04:03:18,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-03 04:03:18,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:03:18,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-03 04:03:18,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-11-03 04:03:18,481 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 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-03 04:03:18,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:03:18,761 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2022-11-03 04:03:18,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 04:03:18,762 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-03 04:03:18,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:03:18,763 INFO L225 Difference]: With dead ends: 72 [2022-11-03 04:03:18,763 INFO L226 Difference]: Without dead ends: 54 [2022-11-03 04:03:18,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 11 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2022-11-03 04:03:18,764 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 45 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:03:18,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 52 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 04:03:18,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-03 04:03:18,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 37. [2022-11-03 04:03:18,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:03:18,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2022-11-03 04:03:18,773 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 19 [2022-11-03 04:03:18,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:03:18,774 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2022-11-03 04:03:18,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 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-03 04:03:18,774 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-11-03 04:03:18,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 04:03:18,775 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:03:18,775 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:03:18,809 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 04:03:18,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:03:18,994 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:03:18,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:03:18,994 INFO L85 PathProgramCache]: Analyzing trace with hash -65478855, now seen corresponding path program 1 times [2022-11-03 04:03:18,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:03:18,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070798637] [2022-11-03 04:03:18,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:03:18,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:03:19,013 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 04:03:19,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1778999171] [2022-11-03 04:03:19,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:03:19,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:03:19,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:03:19,015 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:03:19,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 04:03:19,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:03:19,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 76 conjunts are in the unsatisfiable core [2022-11-03 04:03:19,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:03:19,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-03 04:03:19,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:03:19,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-03 04:03:19,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:19,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 04:03:19,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:19,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2022-11-03 04:03:19,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:19,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2022-11-03 04:03:19,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:19,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 39 [2022-11-03 04:03:19,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:19,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 39 [2022-11-03 04:03:19,522 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:03:19,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:19,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 87 [2022-11-03 04:03:19,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:19,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2022-11-03 04:03:19,866 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:03:19,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:03:33,296 WARN L234 SmtUtils]: Spent 6.32s on a formula simplification. DAG size of input: 76 DAG size of output: 55 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 04:03:51,415 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:03:51,415 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:03:51,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070798637] [2022-11-03 04:03:51,415 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 04:03:51,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778999171] [2022-11-03 04:03:51,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778999171] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:03:51,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1380309544] [2022-11-03 04:03:51,417 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-11-03 04:03:51,417 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 04:03:51,418 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 04:03:51,418 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 04:03:51,418 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 04:03:51,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:51,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:51,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:51,507 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 04:03:51,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-03 04:03:51,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:51,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:51,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 39 [2022-11-03 04:03:51,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:51,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 25 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 98 [2022-11-03 04:03:51,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:51,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:51,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 30 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 113 [2022-11-03 04:03:51,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:51,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:51,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:51,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:51,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:51,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:51,717 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:03:51,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:51,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:51,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:51,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:51,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:51,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:51,784 INFO L356 Elim1Store]: treesize reduction 166, result has 11.7 percent of original size [2022-11-03 04:03:51,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 34 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 22 case distinctions, treesize of input 434 treesize of output 423 [2022-11-03 04:03:51,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-03 04:03:51,913 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:03:51,941 INFO L356 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-03 04:03:51,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 34 [2022-11-03 04:03:52,030 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 04:03:52,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 54 [2022-11-03 04:03:52,065 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:03:52,091 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 04:03:52,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-03 04:03:52,156 INFO L356 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-03 04:03:52,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 54 [2022-11-03 04:03:52,323 INFO L356 Elim1Store]: treesize reduction 53, result has 27.4 percent of original size [2022-11-03 04:03:52,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 68 [2022-11-03 04:03:52,692 INFO L356 Elim1Store]: treesize reduction 63, result has 38.8 percent of original size [2022-11-03 04:03:52,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 93 [2022-11-03 04:03:52,795 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 04:03:55,600 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1827#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (<= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 1) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-03 04:03:55,600 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 04:03:55,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 04:03:55,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 34 [2022-11-03 04:03:55,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069913174] [2022-11-03 04:03:55,601 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 04:03:55,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-03 04:03:55,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:03:55,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-03 04:03:55,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1239, Unknown=0, NotChecked=0, Total=1482 [2022-11-03 04:03:55,602 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:03:58,666 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse64 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse28 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse29 (+ .cse64 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse9 (select .cse28 .cse29))) (let ((.cse11 (+ .cse8 .cse9))) (let ((.cse32 (store .cse28 .cse29 .cse11)) (.cse6 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse41 (select .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse30 (+ .cse8 1)) (.cse37 (+ .cse8 .cse41)) (.cse39 (select .cse28 .cse6)) (.cse26 (+ .cse64 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse33 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse32) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse25 (store .cse28 .cse29 1))) (and (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse11)))) (let ((.cse7 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse4 (+ .cse8 .cse9 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse5 (store .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| .cse4))) (let ((.cse1 (+ (select .cse7 .cse6) (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| .cse5) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse3 (store .cse5 .cse6 .cse1))) (let ((.cse0 (mod .cse4 (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (= .cse0 0)) (= (mod .cse1 (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| .cse0)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0))))))))) (let ((.cse24 (store .cse25 .cse26 1))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse24))) (let ((.cse23 (select .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse19 (select .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse20 (select .cse24 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse21 (select (select (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse13 (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse20 .cse21))))) (let ((.cse18 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse16 (+ .cse19 .cse20 .cse21 (select .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_main_~a~0#1.offset| .cse16))) (let ((.cse12 (+ (select (select (store .cse13 |c_ULTIMATE.start_main_~a~0#1.base| .cse17) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse18 .cse6)))) (let ((.cse14 (store .cse17 .cse6 .cse12))) (let ((.cse15 (mod .cse16 (+ (select (select (store .cse13 |c_ULTIMATE.start_main_~a~0#1.base| .cse14) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= (mod .cse12 (+ (select (select (store .cse13 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~a~0#1.offset| .cse15)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0) (not (= .cse15 0))))))))))))))) (let ((.cse27 (store .cse28 .cse29 (mod .cse9 .cse30)))) (or (= (select .cse27 .cse6) 0) (not (= (select .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (let ((.cse31 (mod (select .cse32 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ .cse33 1)))) (or (not (= .cse31 0)) (= (mod (select .cse32 .cse6) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse32 |c_ULTIMATE.start_main_~a~0#1.offset| .cse31)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0))) (let ((.cse38 (store .cse28 |c_ULTIMATE.start_main_~a~0#1.offset| .cse37))) (let ((.cse34 (+ .cse39 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse38) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse35 (store .cse38 .cse6 .cse34))) (let ((.cse36 (mod .cse37 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse35) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= 0 (mod .cse34 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse35 |c_ULTIMATE.start_main_~a~0#1.offset| .cse36)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))) (not (= .cse36 0))))))) (let ((.cse40 (mod .cse41 .cse30))) (or (not (= .cse40 0)) (= (mod .cse39 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~a~0#1.offset| .cse40)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0))) (let ((.cse49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse37)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse49 .cse41))))) (let ((.cse48 (select .cse44 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse46 (+ .cse8 .cse49 (select .cse48 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse41))) (let ((.cse47 (store .cse48 |c_ULTIMATE.start_main_~a~0#1.offset| .cse46))) (let ((.cse43 (+ (select .cse48 .cse6) (select (select (store .cse44 |c_ULTIMATE.start_main_~a~0#1.base| .cse47) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse45 (store .cse47 .cse6 .cse43))) (let ((.cse42 (mod .cse46 (+ (select (select (store .cse44 |c_ULTIMATE.start_main_~a~0#1.base| .cse45) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (= .cse42 0)) (= (mod .cse43 (+ (select (select (store .cse44 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~a~0#1.offset| .cse42)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0)))))))))) (or (not (= 0 .cse41)) (= .cse39 0)) (let ((.cse50 (store .cse32 .cse26 (+ (select .cse28 .cse26) .cse33)))) (let ((.cse51 (mod (select .cse50 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse50) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= (mod (select .cse50 .cse6) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse50 |c_ULTIMATE.start_main_~a~0#1.offset| .cse51)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0) (not (= .cse51 0))))) (let ((.cse62 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse25))) (let ((.cse63 (select .cse62 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse59 (select .cse63 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse61 (select .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse60 (select (select (store .cse62 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse63 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse59 .cse61))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse53 (store .cse62 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse63 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse59 .cse60 .cse61))))) (let ((.cse58 (select .cse53 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse56 (+ .cse59 (select .cse58 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse60 .cse61))) (let ((.cse57 (store .cse58 |c_ULTIMATE.start_main_~a~0#1.offset| .cse56))) (let ((.cse52 (+ (select .cse58 .cse6) (select (select (store .cse53 |c_ULTIMATE.start_main_~a~0#1.base| .cse57) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse54 (store .cse57 .cse6 .cse52))) (let ((.cse55 (mod .cse56 (+ (select (select (store .cse53 |c_ULTIMATE.start_main_~a~0#1.base| .cse54) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= (mod .cse52 (+ (select (select (store .cse53 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse54 |c_ULTIMATE.start_main_~a~0#1.offset| .cse55)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0) (not (= .cse55 0))))))))))))))))))))) is different from false [2022-11-03 04:04:00,676 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse64 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse28 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse29 (+ .cse64 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse9 (select .cse28 .cse29))) (let ((.cse11 (+ .cse8 .cse9))) (let ((.cse32 (store .cse28 .cse29 .cse11)) (.cse6 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse41 (select .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse30 (+ .cse8 1)) (.cse37 (+ .cse8 .cse41)) (.cse39 (select .cse28 .cse6)) (.cse26 (+ .cse64 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse33 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse32) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse25 (store .cse28 .cse29 1))) (and (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse11)))) (let ((.cse7 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse4 (+ .cse8 .cse9 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse5 (store .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| .cse4))) (let ((.cse1 (+ (select .cse7 .cse6) (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| .cse5) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse3 (store .cse5 .cse6 .cse1))) (let ((.cse0 (mod .cse4 (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (= .cse0 0)) (= (mod .cse1 (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| .cse0)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0))))))))) (let ((.cse24 (store .cse25 .cse26 1))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse24))) (let ((.cse23 (select .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse19 (select .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse20 (select .cse24 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse21 (select (select (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse13 (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse20 .cse21))))) (let ((.cse18 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse16 (+ .cse19 .cse20 .cse21 (select .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_main_~a~0#1.offset| .cse16))) (let ((.cse12 (+ (select (select (store .cse13 |c_ULTIMATE.start_main_~a~0#1.base| .cse17) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse18 .cse6)))) (let ((.cse14 (store .cse17 .cse6 .cse12))) (let ((.cse15 (mod .cse16 (+ (select (select (store .cse13 |c_ULTIMATE.start_main_~a~0#1.base| .cse14) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= (mod .cse12 (+ (select (select (store .cse13 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~a~0#1.offset| .cse15)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0) (not (= .cse15 0))))))))))))))) (let ((.cse27 (store .cse28 .cse29 (mod .cse9 .cse30)))) (or (= (select .cse27 .cse6) 0) (not (= (select .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (let ((.cse31 (mod (select .cse32 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ .cse33 1)))) (or (not (= .cse31 0)) (= (mod (select .cse32 .cse6) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse32 |c_ULTIMATE.start_main_~a~0#1.offset| .cse31)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0))) (let ((.cse38 (store .cse28 |c_ULTIMATE.start_main_~a~0#1.offset| .cse37))) (let ((.cse34 (+ .cse39 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse38) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse35 (store .cse38 .cse6 .cse34))) (let ((.cse36 (mod .cse37 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse35) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= 0 (mod .cse34 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse35 |c_ULTIMATE.start_main_~a~0#1.offset| .cse36)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))) (not (= .cse36 0))))))) (let ((.cse40 (mod .cse41 .cse30))) (or (not (= .cse40 0)) (= (mod .cse39 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~a~0#1.offset| .cse40)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0))) (let ((.cse49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse37)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse49 .cse41))))) (let ((.cse48 (select .cse44 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse46 (+ .cse8 .cse49 (select .cse48 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse41))) (let ((.cse47 (store .cse48 |c_ULTIMATE.start_main_~a~0#1.offset| .cse46))) (let ((.cse43 (+ (select .cse48 .cse6) (select (select (store .cse44 |c_ULTIMATE.start_main_~a~0#1.base| .cse47) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse45 (store .cse47 .cse6 .cse43))) (let ((.cse42 (mod .cse46 (+ (select (select (store .cse44 |c_ULTIMATE.start_main_~a~0#1.base| .cse45) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (= .cse42 0)) (= (mod .cse43 (+ (select (select (store .cse44 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~a~0#1.offset| .cse42)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0)))))))))) (or (not (= 0 .cse41)) (= .cse39 0)) (let ((.cse50 (store .cse32 .cse26 (+ (select .cse28 .cse26) .cse33)))) (let ((.cse51 (mod (select .cse50 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse50) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= (mod (select .cse50 .cse6) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse50 |c_ULTIMATE.start_main_~a~0#1.offset| .cse51)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0) (not (= .cse51 0))))) (let ((.cse62 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse25))) (let ((.cse63 (select .cse62 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse59 (select .cse63 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse61 (select .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse60 (select (select (store .cse62 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse63 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse59 .cse61))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse53 (store .cse62 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse63 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse59 .cse60 .cse61))))) (let ((.cse58 (select .cse53 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse56 (+ .cse59 (select .cse58 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse60 .cse61))) (let ((.cse57 (store .cse58 |c_ULTIMATE.start_main_~a~0#1.offset| .cse56))) (let ((.cse52 (+ (select .cse58 .cse6) (select (select (store .cse53 |c_ULTIMATE.start_main_~a~0#1.base| .cse57) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse54 (store .cse57 .cse6 .cse52))) (let ((.cse55 (mod .cse56 (+ (select (select (store .cse53 |c_ULTIMATE.start_main_~a~0#1.base| .cse54) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= (mod .cse52 (+ (select (select (store .cse53 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse54 |c_ULTIMATE.start_main_~a~0#1.offset| .cse55)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0) (not (= .cse55 0))))))))))))))))))))) is different from true [2022-11-03 04:04:19,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-03 04:04:21,075 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 [] [2022-11-03 04:04:22,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-03 04:04:24,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-03 04:04:25,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-03 04:04:27,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-03 04:05:31,961 WARN L234 SmtUtils]: Spent 24.64s on a formula simplification that was a NOOP. DAG size: 124 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 04:05:35,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-03 04:05:39,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-03 04:05:57,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-03 04:06:00,782 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse45 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse26 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse41 (+ .cse45 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse42 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse44 (select .cse26 .cse41))) (let ((.cse15 (+ .cse45 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse18 (store .cse26 .cse41 (+ .cse42 .cse44))) (.cse43 (mod .cse44 (+ .cse42 1)))) (let ((.cse16 (store .cse26 .cse41 .cse43)) (.cse19 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse18) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse14 (store .cse26 .cse41 1)) (.cse22 (= .cse43 0)) (.cse6 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse21 (< .cse44 0)) (.cse23 (select .cse26 .cse15))) (and (let ((.cse13 (store .cse14 .cse15 1))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse13))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse9 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse10 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse1 (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9 .cse10))))) (let ((.cse7 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse4 (+ .cse8 .cse9 .cse10 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse5 (store .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| .cse4))) (let ((.cse0 (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| .cse5) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse7 .cse6)))) (let ((.cse2 (store .cse5 .cse6 .cse0))) (let ((.cse3 (mod .cse4 (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= (mod .cse0 (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| .cse3)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0) (not (= .cse3 0))))))))))))))) (or (= (select .cse16 .cse6) 0) (not (= (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) (let ((.cse17 (mod (select .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ .cse19 1)))) (or (not (= .cse17 0)) (= (mod (select .cse18 .cse6) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~a~0#1.offset| .cse17)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 2) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))) (let ((.cse20 (store .cse16 .cse15 (mod .cse23 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse16) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))))) (or (= (select .cse20 .cse6) 0) (not (= (select .cse20 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (and .cse21 (not .cse22)))) (let ((.cse24 (store .cse18 .cse15 (+ .cse23 .cse19)))) (let ((.cse25 (mod (select .cse24 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse24) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= (mod (select .cse24 .cse6) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~a~0#1.offset| .cse25)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0) (not (= .cse25 0))))) (= 0 (select .cse26 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select .cse26 .cse6) 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse14))) (let ((.cse38 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse34 (select .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse36 (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse35 (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse36))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse28 (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse35 .cse36))))) (let ((.cse33 (select .cse28 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse31 (+ .cse34 (select .cse33 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse35 .cse36))) (let ((.cse32 (store .cse33 |c_ULTIMATE.start_main_~a~0#1.offset| .cse31))) (let ((.cse27 (+ (select .cse33 .cse6) (select (select (store .cse28 |c_ULTIMATE.start_main_~a~0#1.base| .cse32) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse29 (store .cse32 .cse6 .cse27))) (let ((.cse30 (mod .cse31 (+ (select (select (store .cse28 |c_ULTIMATE.start_main_~a~0#1.base| .cse29) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= (mod .cse27 (+ (select (select (store .cse28 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~a~0#1.offset| .cse30)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0) (not (= .cse30 0)))))))))))))) (let ((.cse39 (let ((.cse40 (store .cse26 .cse41 (+ .cse42 .cse43 1)))) (store .cse40 .cse15 (mod .cse23 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse40) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))))) (or .cse22 (= (select .cse39 .cse6) 0) (not .cse21) (not (= (select .cse39 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))))))))) is different from true [2022-11-03 04:06:02,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-03 04:06:04,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-03 04:06:05,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:06:05,541 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2022-11-03 04:06:05,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-03 04:06:05,542 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-03 04:06:05,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:06:05,542 INFO L225 Difference]: With dead ends: 46 [2022-11-03 04:06:05,542 INFO L226 Difference]: Without dead ends: 30 [2022-11-03 04:06:05,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 127.1s TimeCoverageRelationStatistics Valid=322, Invalid=1569, Unknown=9, NotChecked=170, Total=2070 [2022-11-03 04:06:05,543 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 102 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 35.7s IncrementalHoareTripleChecker+Time [2022-11-03 04:06:05,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 31 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 211 Invalid, 3 Unknown, 17 Unchecked, 35.7s Time] [2022-11-03 04:06:05,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-03 04:06:05,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 23. [2022-11-03 04:06:05,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:06:05,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-11-03 04:06:05,554 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 20 [2022-11-03 04:06:05,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:06:05,554 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-11-03 04:06:05,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:06:05,554 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-11-03 04:06:05,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 04:06:05,555 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:06:05,555 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:06:05,582 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-03 04:06:05,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:06:05,759 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:06:05,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:06:05,760 INFO L85 PathProgramCache]: Analyzing trace with hash -105264649, now seen corresponding path program 7 times [2022-11-03 04:06:05,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:06:05,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184732187] [2022-11-03 04:06:05,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:06:05,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:06:05,778 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 04:06:05,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [450664016] [2022-11-03 04:06:05,779 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 04:06:05,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:06:05,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:06:05,780 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:06:05,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 04:06:05,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:06:05,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 85 conjunts are in the unsatisfiable core [2022-11-03 04:06:05,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:06:05,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:06:05,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-03 04:06:05,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2022-11-03 04:06:05,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:05,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 04:06:06,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:06,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:06,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-03 04:06:06,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:06,142 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:06:06,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:06,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2022-11-03 04:06:06,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:06,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:06,221 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:06:06,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 55 [2022-11-03 04:06:06,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:06,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:06,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 47 [2022-11-03 04:06:06,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:06,397 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:06:06,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:06,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 54 [2022-11-03 04:06:06,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:06,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:06,464 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:06:06,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 55 [2022-11-03 04:06:06,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:06,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:06,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 47 [2022-11-03 04:06:06,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:06,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:06,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 51 [2022-11-03 04:06:06,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:06,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:06,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 49 [2022-11-03 04:06:06,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:06,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2022-11-03 04:06:06,971 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:06:06,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:06:37,337 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:06:37,337 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:06:37,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184732187] [2022-11-03 04:06:37,337 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 04:06:37,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450664016] [2022-11-03 04:06:37,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450664016] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:06:37,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1167147885] [2022-11-03 04:06:37,339 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-03 04:06:37,339 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 04:06:37,339 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 04:06:37,340 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 04:06:37,340 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 04:06:37,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:37,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:37,443 INFO L356 Elim1Store]: treesize reduction 68, result has 33.3 percent of original size [2022-11-03 04:06:37,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 57 [2022-11-03 04:06:37,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:37,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:37,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:37,552 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 04:06:37,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-03 04:06:37,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:37,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 25 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 98 [2022-11-03 04:06:37,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:37,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:37,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 30 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 113 [2022-11-03 04:06:37,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:37,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:37,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:37,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:37,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:37,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:37,745 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:06:37,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:37,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:37,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:37,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:37,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:37,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:37,818 INFO L356 Elim1Store]: treesize reduction 166, result has 11.7 percent of original size [2022-11-03 04:06:37,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 34 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 22 case distinctions, treesize of input 434 treesize of output 423 [2022-11-03 04:06:37,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-03 04:06:37,949 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:06:37,979 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 04:06:37,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-03 04:06:38,065 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 04:06:38,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 54 [2022-11-03 04:06:38,101 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:06:38,126 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 04:06:38,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-03 04:06:38,195 INFO L356 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-03 04:06:38,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 54 [2022-11-03 04:06:38,213 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:06:38,315 INFO L356 Elim1Store]: treesize reduction 53, result has 27.4 percent of original size [2022-11-03 04:06:38,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 73 [2022-11-03 04:06:38,400 INFO L356 Elim1Store]: treesize reduction 63, result has 38.8 percent of original size [2022-11-03 04:06:38,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 93 [2022-11-03 04:06:38,452 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 04:06:39,947 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2124#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= |ULTIMATE.start_main_#t~mem17#1| 0) 1 0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8))) |ULTIMATE.start_main_#t~mem17#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-03 04:06:39,947 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 04:06:39,947 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 04:06:39,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 37 [2022-11-03 04:06:39,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384746568] [2022-11-03 04:06:39,948 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 04:06:39,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-03 04:06:39,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:06:39,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-03 04:06:39,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1526, Unknown=1, NotChecked=0, Total=1722 [2022-11-03 04:06:39,949 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 37 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:27,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:07:27,845 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2022-11-03 04:07:27,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-03 04:07:27,846 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-03 04:07:27,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:07:27,847 INFO L225 Difference]: With dead ends: 47 [2022-11-03 04:07:27,847 INFO L226 Difference]: Without dead ends: 45 [2022-11-03 04:07:27,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 72.8s TimeCoverageRelationStatistics Valid=259, Invalid=1991, Unknown=6, NotChecked=0, Total=2256 [2022-11-03 04:07:27,848 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 16 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 165 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-11-03 04:07:27,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 50 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 340 Invalid, 0 Unknown, 165 Unchecked, 6.8s Time] [2022-11-03 04:07:27,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-03 04:07:27,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-11-03 04:07:27,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 41 states have internal predecessors, (54), 0 states have call successors, (0), 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-03 04:07:27,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2022-11-03 04:07:27,865 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 54 transitions. Word has length 21 [2022-11-03 04:07:27,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:07:27,866 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 54 transitions. [2022-11-03 04:07:27,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:27,866 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 54 transitions. [2022-11-03 04:07:27,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 04:07:27,867 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:07:27,867 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:07:27,894 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 04:07:28,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:07:28,075 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:07:28,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:07:28,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1837045100, now seen corresponding path program 8 times [2022-11-03 04:07:28,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:07:28,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221759677] [2022-11-03 04:07:28,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:07:28,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:07:28,093 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 04:07:28,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1277867064] [2022-11-03 04:07:28,093 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:07:28,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:07:28,094 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:07:28,095 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:07:28,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 04:07:28,336 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 04:07:28,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:07:28,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 04:07:28,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:07:28,448 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-03 04:07:28,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:07:28,549 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-03 04:07:28,549 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:07:28,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221759677] [2022-11-03 04:07:28,549 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 04:07:28,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277867064] [2022-11-03 04:07:28,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277867064] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:07:28,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1316791965] [2022-11-03 04:07:28,551 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-03 04:07:28,551 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 04:07:28,552 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 04:07:28,552 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 04:07:28,552 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 04:07:28,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:28,597 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 04:07:28,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 23 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 102 [2022-11-03 04:07:28,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:28,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:28,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:28,713 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 04:07:28,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-03 04:07:28,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:28,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:28,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 39 [2022-11-03 04:07:28,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:28,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:28,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 30 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 108 [2022-11-03 04:07:28,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:28,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:28,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:28,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:28,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:28,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:28,907 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:07:28,907 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:07:28,995 INFO L356 Elim1Store]: treesize reduction 154, result has 18.5 percent of original size [2022-11-03 04:07:28,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 27 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 23 case distinctions, treesize of input 429 treesize of output 424 [2022-11-03 04:07:29,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-03 04:07:29,122 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 04:07:29,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-03 04:07:29,201 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 04:07:29,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 54 [2022-11-03 04:07:29,246 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:07:29,275 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 04:07:29,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-03 04:07:29,346 INFO L356 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-03 04:07:29,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 54 [2022-11-03 04:07:29,366 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:07:29,440 INFO L356 Elim1Store]: treesize reduction 53, result has 27.4 percent of original size [2022-11-03 04:07:29,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 73 [2022-11-03 04:07:29,854 INFO L356 Elim1Store]: treesize reduction 63, result has 38.8 percent of original size [2022-11-03 04:07:29,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 93 [2022-11-03 04:07:29,911 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 04:07:30,500 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2443#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= |ULTIMATE.start_main_#t~mem17#1| 0) 1 0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8))) |ULTIMATE.start_main_#t~mem17#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-03 04:07:30,500 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 04:07:30,500 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 04:07:30,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2022-11-03 04:07:30,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745446533] [2022-11-03 04:07:30,501 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 04:07:30,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-03 04:07:30,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:07:30,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-03 04:07:30,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2022-11-03 04:07:30,502 INFO L87 Difference]: Start difference. First operand 42 states and 54 transitions. Second operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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-03 04:07:30,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:07:30,884 INFO L93 Difference]: Finished difference Result 112 states and 138 transitions. [2022-11-03 04:07:30,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 04:07:30,884 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Word has length 22 [2022-11-03 04:07:30,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:07:30,886 INFO L225 Difference]: With dead ends: 112 [2022-11-03 04:07:30,886 INFO L226 Difference]: Without dead ends: 84 [2022-11-03 04:07:30,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 34 SyntacticMatches, 14 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=173, Invalid=639, Unknown=0, NotChecked=0, Total=812 [2022-11-03 04:07:30,888 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 60 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:07:30,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 112 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 04:07:30,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-03 04:07:30,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 43. [2022-11-03 04:07:30,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:30,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2022-11-03 04:07:30,906 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 22 [2022-11-03 04:07:30,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:07:30,907 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2022-11-03 04:07:30,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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-03 04:07:30,907 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-11-03 04:07:30,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 04:07:30,907 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:07:30,908 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:07:30,931 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-03 04:07:31,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-03 04:07:31,111 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:07:31,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:07:31,112 INFO L85 PathProgramCache]: Analyzing trace with hash -807483306, now seen corresponding path program 9 times [2022-11-03 04:07:31,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:07:31,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885694810] [2022-11-03 04:07:31,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:07:31,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:07:31,141 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 04:07:31,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1798615714] [2022-11-03 04:07:31,141 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 04:07:31,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:07:31,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:07:31,143 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:07:31,152 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 04:07:31,246 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 04:07:31,246 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:07:31,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 04:07:31,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:07:31,325 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 04:07:31,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:07:31,407 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 04:07:31,407 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:07:31,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885694810] [2022-11-03 04:07:31,407 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 04:07:31,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798615714] [2022-11-03 04:07:31,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798615714] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:07:31,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1556297654] [2022-11-03 04:07:31,409 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-03 04:07:31,409 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 04:07:31,410 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 04:07:31,410 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 04:07:31,410 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 04:07:31,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:31,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:31,527 INFO L356 Elim1Store]: treesize reduction 68, result has 33.3 percent of original size [2022-11-03 04:07:31,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 57 [2022-11-03 04:07:31,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:31,570 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 04:07:31,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 23 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 102 [2022-11-03 04:07:31,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:31,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:31,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:31,697 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 04:07:31,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-03 04:07:31,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:31,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:31,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 30 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 108 [2022-11-03 04:07:31,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:31,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:31,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:31,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:31,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:31,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:31,846 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:07:31,847 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:07:31,914 INFO L356 Elim1Store]: treesize reduction 154, result has 18.5 percent of original size [2022-11-03 04:07:31,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 27 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 23 case distinctions, treesize of input 429 treesize of output 424 [2022-11-03 04:07:32,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-03 04:07:32,053 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 04:07:32,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-03 04:07:32,128 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 04:07:32,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 54 [2022-11-03 04:07:32,157 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:07:32,183 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 04:07:32,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-03 04:07:32,248 INFO L356 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-03 04:07:32,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 54 [2022-11-03 04:07:32,322 INFO L356 Elim1Store]: treesize reduction 53, result has 27.4 percent of original size [2022-11-03 04:07:32,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 68 [2022-11-03 04:07:32,610 INFO L356 Elim1Store]: treesize reduction 63, result has 38.8 percent of original size [2022-11-03 04:07:32,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 93 [2022-11-03 04:07:32,656 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 04:07:33,279 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2879#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= |ULTIMATE.start_main_#t~mem17#1| 0) 1 0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8))) |ULTIMATE.start_main_#t~mem17#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-03 04:07:33,280 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 04:07:33,280 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 04:07:33,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-11-03 04:07:33,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495926052] [2022-11-03 04:07:33,280 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 04:07:33,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 04:07:33,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:07:33,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 04:07:33,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2022-11-03 04:07:33,281 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 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-03 04:07:33,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:07:33,505 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2022-11-03 04:07:33,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 04:07:33,505 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 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) Word has length 23 [2022-11-03 04:07:33,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:07:33,506 INFO L225 Difference]: With dead ends: 93 [2022-11-03 04:07:33,506 INFO L226 Difference]: Without dead ends: 71 [2022-11-03 04:07:33,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 13 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2022-11-03 04:07:33,507 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 86 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:07:33,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 32 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 04:07:33,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-03 04:07:33,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 47. [2022-11-03 04:07:33,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 46 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:33,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2022-11-03 04:07:33,532 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 23 [2022-11-03 04:07:33,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:07:33,532 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2022-11-03 04:07:33,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 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-03 04:07:33,533 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-11-03 04:07:33,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 04:07:33,534 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:07:33,534 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:07:33,561 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-03 04:07:33,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:07:33,739 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:07:33,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:07:33,740 INFO L85 PathProgramCache]: Analyzing trace with hash -607830675, now seen corresponding path program 2 times [2022-11-03 04:07:33,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:07:33,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595628416] [2022-11-03 04:07:33,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:07:33,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:07:33,757 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 04:07:33,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2006355470] [2022-11-03 04:07:33,757 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:07:33,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:07:33,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:07:33,759 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:07:33,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-03 04:07:34,055 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 04:07:34,055 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:07:34,059 WARN L261 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 98 conjunts are in the unsatisfiable core [2022-11-03 04:07:34,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:07:34,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:07:34,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:34,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2022-11-03 04:07:34,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:34,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:34,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 04:07:34,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:34,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:34,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:34,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:34,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-03 04:07:34,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:34,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:34,352 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:07:34,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:34,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:34,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 54 [2022-11-03 04:07:34,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:34,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:34,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:34,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:34,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 49 [2022-11-03 04:07:34,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:34,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:34,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:34,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:34,561 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-11-03 04:07:34,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 62 [2022-11-03 04:07:34,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:34,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:34,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:34,858 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:07:34,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:34,860 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:07:34,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:34,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 59 [2022-11-03 04:07:34,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:34,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:34,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:34,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:34,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 56 [2022-11-03 04:07:35,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:35,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:35,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:35,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:35,234 INFO L356 Elim1Store]: treesize reduction 56, result has 58.8 percent of original size [2022-11-03 04:07:35,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 112 [2022-11-03 04:07:36,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:36,269 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:07:36,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:36,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:36,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:36,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 236 treesize of output 120 [2022-11-03 04:07:36,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:36,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:36,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:36,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:36,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 57 [2022-11-03 04:07:36,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:36,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:36,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:36,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:36,702 INFO L356 Elim1Store]: treesize reduction 50, result has 49.0 percent of original size [2022-11-03 04:07:36,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 88 [2022-11-03 04:07:37,526 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:07:37,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:08:03,548 WARN L234 SmtUtils]: Spent 24.03s on a formula simplification. DAG size of input: 74 DAG size of output: 64 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 04:08:07,698 WARN L855 $PredicateComparison]: unable to prove that (or (not (< 1 c_~N~0)) (let ((.cse46 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse18 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse8 (+ .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse5 (+ .cse46 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse44 (select .cse7 .cse8)) (.cse45 (+ .cse18 1))) (let ((.cse19 (mod .cse44 .cse45)) (.cse6 (select .cse7 .cse5)) (.cse31 (< .cse45 0))) (let ((.cse20 (not .cse31)) (.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse17 (not (< .cse6 0))) (.cse32 (< .cse44 0)) (.cse0 (= .cse19 0))) (and (or .cse0 (and (or (let ((.cse1 (+ .cse18 .cse19 1))) (and (forall ((v_ArrVal_674 Int)) (or (not (<= .cse1 v_ArrVal_674)) (forall ((|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_ArrVal_677 Int)) (let ((.cse2 (store (let ((.cse4 (store .cse7 .cse8 v_ArrVal_674))) (store .cse4 .cse5 (mod .cse6 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse4) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_677))) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) c_~N~0) (= (select .cse2 .cse3) 0) (< 0 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (< |v_ULTIMATE.start_main_~i~0#1_392| c_~N~0))))))) (or (and (forall ((v_ArrVal_674 Int)) (let ((.cse11 (store .cse7 .cse8 v_ArrVal_674))) (let ((.cse12 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse11) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse9 (mod .cse6 (+ .cse12 1)))) (or (= .cse9 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_ArrVal_677 Int)) (let ((.cse10 (store (store .cse11 .cse5 (+ .cse9 .cse12 1)) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_677))) (or (< 0 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|)) (< (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) c_~N~0) (= (select .cse10 .cse3) 0) (not (< |v_ULTIMATE.start_main_~i~0#1_392| c_~N~0))))) (not (<= .cse1 v_ArrVal_674))))))) (forall ((v_ArrVal_674 Int)) (let ((.cse14 (store .cse7 .cse8 v_ArrVal_674))) (let ((.cse16 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse14) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse15 (mod .cse6 (+ .cse16 1)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_ArrVal_677 Int)) (let ((.cse13 (store (store .cse14 .cse5 (+ (- 1) .cse15 (* (- 1) .cse16))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_677))) (or (< 0 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select .cse13 .cse3) 0) (< (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) c_~N~0) (not (< |v_ULTIMATE.start_main_~i~0#1_392| c_~N~0))))) (= .cse15 0) (not (<= .cse1 v_ArrVal_674)))))))) .cse17))) .cse20) (or (and (or (and (forall ((v_ArrVal_674 Int)) (let ((.cse23 (store .cse7 .cse8 v_ArrVal_674))) (let ((.cse24 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse23) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse21 (mod .cse6 (+ .cse24 1)))) (or (not (<= .cse19 (+ v_ArrVal_674 .cse18 1))) (= .cse21 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_ArrVal_677 Int)) (let ((.cse22 (store (store .cse23 .cse5 (+ .cse21 .cse24 1)) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_677))) (or (< 0 (select .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|)) (< (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) c_~N~0) (= (select .cse22 .cse3) 0) (not (< |v_ULTIMATE.start_main_~i~0#1_392| c_~N~0)))))))))) (forall ((v_ArrVal_674 Int)) (let ((.cse26 (store .cse7 .cse8 v_ArrVal_674))) (let ((.cse28 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse26) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse27 (mod .cse6 (+ .cse28 1)))) (or (not (<= .cse19 (+ v_ArrVal_674 .cse18 1))) (forall ((|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_ArrVal_677 Int)) (let ((.cse25 (store (store .cse26 .cse5 (+ (- 1) .cse27 (* (- 1) .cse28))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_677))) (or (< 0 (select .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select .cse25 .cse3) 0) (< (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) c_~N~0) (not (< |v_ULTIMATE.start_main_~i~0#1_392| c_~N~0))))) (= .cse27 0))))))) .cse17) (forall ((v_ArrVal_674 Int)) (or (not (<= .cse19 (+ v_ArrVal_674 .cse18 1))) (forall ((|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_ArrVal_677 Int)) (let ((.cse29 (store (let ((.cse30 (store .cse7 .cse8 v_ArrVal_674))) (store .cse30 .cse5 (mod .cse6 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse30) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_677))) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) c_~N~0) (= (select .cse29 .cse3) 0) (< 0 (select .cse29 |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (< |v_ULTIMATE.start_main_~i~0#1_392| c_~N~0)))))))) .cse31)) (not .cse32)) (or (let ((.cse33 (and (forall ((v_ArrVal_674 Int)) (or (not (<= .cse19 v_ArrVal_674)) (forall ((|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_ArrVal_677 Int)) (let ((.cse34 (store (let ((.cse35 (store .cse7 .cse8 v_ArrVal_674))) (store .cse35 .cse5 (mod .cse6 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse35) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_677))) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) c_~N~0) (= (select .cse34 .cse3) 0) (< 0 (select .cse34 |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (< |v_ULTIMATE.start_main_~i~0#1_392| c_~N~0))))))) (or (and (forall ((v_ArrVal_674 Int)) (let ((.cse37 (store .cse7 .cse8 v_ArrVal_674))) (let ((.cse39 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse37) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse38 (mod .cse6 (+ .cse39 1)))) (or (not (<= .cse19 v_ArrVal_674)) (forall ((|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_ArrVal_677 Int)) (let ((.cse36 (store (store .cse37 .cse5 (+ (- 1) .cse38 (* (- 1) .cse39))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_677))) (or (< 0 (select .cse36 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select .cse36 .cse3) 0) (< (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) c_~N~0) (not (< |v_ULTIMATE.start_main_~i~0#1_392| c_~N~0))))) (= .cse38 0)))))) (forall ((v_ArrVal_674 Int)) (let ((.cse42 (store .cse7 .cse8 v_ArrVal_674))) (let ((.cse43 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse42) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse40 (mod .cse6 (+ .cse43 1)))) (or (not (<= .cse19 v_ArrVal_674)) (= .cse40 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_ArrVal_677 Int)) (let ((.cse41 (store (store .cse42 .cse5 (+ .cse40 .cse43 1)) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_677))) (or (< 0 (select .cse41 |c_ULTIMATE.start_main_~a~0#1.offset|)) (< (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) c_~N~0) (= (select .cse41 .cse3) 0) (not (< |v_ULTIMATE.start_main_~i~0#1_392| c_~N~0))))))))))) .cse17)))) (and (or .cse20 .cse33) (or .cse31 .cse33))) (and .cse32 (not .cse0)))))))))) is different from true [2022-11-03 04:08:18,304 WARN L234 SmtUtils]: Spent 6.89s on a formula simplification. DAG size of input: 119 DAG size of output: 65 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 04:08:34,214 WARN L234 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 80 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 04:08:55,794 WARN L234 SmtUtils]: Spent 12.43s on a formula simplification that was a NOOP. DAG size: 154 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 04:09:12,873 WARN L234 SmtUtils]: Spent 5.25s on a formula simplification that was a NOOP. DAG size: 161 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 04:09:29,464 WARN L855 $PredicateComparison]: unable to prove that (or (not (< 1 c_~N~0)) (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse12 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse15 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (forall ((v_subst_3 Int)) (let ((.cse13 (select .cse15 (+ (* |ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13))))) (let ((.cse4 (let ((.cse8 (let ((.cse11 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse10 (store .cse11 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse12 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse13)))) (store .cse10 .cse2 (+ (select .cse11 .cse2) (select (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| .cse10) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (.cse9 (+ (* 8 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse8 .cse9 (+ (select (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| .cse8) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse8 .cse9)))))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (select (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| .cse4) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse6 (mod .cse0 (+ .cse7 1)))) (or (not (< .cse0 0)) (not (< v_subst_3 c_~N~0)) (forall ((v_ArrVal_674 Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_ArrVal_677 Int)) (let ((.cse1 (store (let ((.cse3 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_674))) (store .cse3 .cse2 (mod (select .cse4 .cse2) (+ (select (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_677))) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) c_~N~0) (< 0 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (< |v_ULTIMATE.start_main_~i~0#1_392| c_~N~0)) (= (select .cse1 .cse2) 0)))) (not (<= (+ .cse6 .cse7 1) v_ArrVal_674)))) (= .cse6 0) (< (+ v_subst_3 1) c_~N~0)))))))) (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0) (not (< |ULTIMATE.start_main_~i~0#1| c_~N~0)))) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0) (not (< |ULTIMATE.start_main_~i~0#1| c_~N~0)) (forall ((v_subst_1 Int)) (or (not (< v_subst_1 c_~N~0)) (< (+ v_subst_1 1) c_~N~0) (forall ((v_ArrVal_674 Int)) (let ((.cse24 (select .cse15 (+ (* |ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse24))))) (let ((.cse18 (let ((.cse20 (let ((.cse23 (select .cse19 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse22 (store .cse23 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse12 (select .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse24)))) (store .cse22 .cse2 (+ (select .cse23 .cse2) (select (select (store .cse19 |c_ULTIMATE.start_main_~a~0#1.base| .cse22) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (.cse21 (+ (* 8 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse20 .cse21 (+ (select (select (store .cse19 |c_ULTIMATE.start_main_~a~0#1.base| .cse20) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse20 .cse21)))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_ArrVal_677 Int)) (let ((.cse16 (store (let ((.cse17 (store .cse18 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_674))) (store .cse17 .cse2 (mod (select .cse18 .cse2) (+ (select (select (store .cse19 |c_ULTIMATE.start_main_~a~0#1.base| .cse17) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_677))) (or (< 0 (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (< (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) c_~N~0) (not (< |v_ULTIMATE.start_main_~i~0#1_392| c_~N~0)) (= (select .cse16 .cse2) 0)))) (not (<= (mod (select .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store .cse19 |c_ULTIMATE.start_main_~a~0#1.base| .cse18) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) v_ArrVal_674))))))))))) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (forall ((v_subst_2 Int)) (let ((.cse36 (select .cse15 (+ (* |ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse36))))) (let ((.cse28 (let ((.cse32 (let ((.cse35 (select .cse29 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse34 (store .cse35 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse12 (select .cse35 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse36)))) (store .cse34 .cse2 (+ (select .cse35 .cse2) (select (select (store .cse29 |c_ULTIMATE.start_main_~a~0#1.base| .cse34) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (.cse33 (+ (* 8 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse32 .cse33 (+ (select (select (store .cse29 |c_ULTIMATE.start_main_~a~0#1.base| .cse32) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse32 .cse33)))))) (let ((.cse25 (select .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse31 (select (select (store .cse29 |c_ULTIMATE.start_main_~a~0#1.base| .cse28) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse30 (mod .cse25 (+ .cse31 1)))) (or (not (< .cse25 0)) (forall ((v_ArrVal_674 Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_ArrVal_677 Int)) (let ((.cse26 (store (let ((.cse27 (store .cse28 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_674))) (store .cse27 .cse2 (mod (select .cse28 .cse2) (+ (select (select (store .cse29 |c_ULTIMATE.start_main_~a~0#1.base| .cse27) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_677))) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) c_~N~0) (not (< |v_ULTIMATE.start_main_~i~0#1_392| c_~N~0)) (< 0 (select .cse26 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select .cse26 .cse2) 0)))) (not (<= .cse30 (+ v_ArrVal_674 .cse31 1))))) (< (+ v_subst_2 1) c_~N~0) (not (< v_subst_2 c_~N~0)) (= .cse30 0)))))))) (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0) (not (< |ULTIMATE.start_main_~i~0#1| c_~N~0)))))))) is different from true [2022-11-03 04:10:15,352 WARN L234 SmtUtils]: Spent 11.20s on a formula simplification that was a NOOP. DAG size: 231 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 04:11:09,386 WARN L234 SmtUtils]: Spent 12.88s on a formula simplification that was a NOOP. DAG size: 237 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 04:11:13,885 WARN L855 $PredicateComparison]: unable to prove that (or (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) (not (< 1 c_~N~0)) (let ((.cse16 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse12 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse15 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse13 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((v_subst_6 Int)) (or (not (< v_subst_6 c_~N~0)) (forall ((v_subst_2 Int)) (let ((.cse14 (select .cse17 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 v_subst_6))))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse14 .cse15))))) (let ((.cse4 (let ((.cse9 (+ (* 8 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (let ((.cse11 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse10 (store .cse11 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse12 .cse13 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse14 .cse15)))) (store .cse10 .cse2 (+ (select (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| .cse10) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse11 .cse2))))))) (store .cse8 .cse9 (+ (select .cse8 .cse9) (select (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| .cse8) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (let ((.cse7 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (select (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| .cse4) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (mod .cse7 (+ .cse6 1)))) (or (< (+ v_subst_2 1) c_~N~0) (not (< v_subst_2 c_~N~0)) (= .cse0 0) (forall ((v_ArrVal_674 Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_ArrVal_677 Int)) (let ((.cse1 (store (let ((.cse3 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_674))) (store .cse3 .cse2 (mod (select .cse4 .cse2) (+ (select (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_677))) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) c_~N~0) (= (select .cse1 .cse2) 0) (< 0 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (< |v_ULTIMATE.start_main_~i~0#1_392| c_~N~0))))) (not (<= .cse0 (+ .cse6 v_ArrVal_674 1))))) (not (< .cse7 0))))))))) (< (+ v_subst_6 1) c_~N~0))) (forall ((v_subst_5 Int)) (or (forall ((v_subst_3 Int)) (let ((.cse29 (select .cse17 (+ (* 8 v_subst_5) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse29 .cse15))))) (let ((.cse23 (let ((.cse25 (let ((.cse28 (select .cse24 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse27 (store .cse28 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse12 .cse13 .cse29 (select .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse15)))) (store .cse27 .cse2 (+ (select (select (store .cse24 |c_ULTIMATE.start_main_~a~0#1.base| .cse27) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse28 .cse2)))))) (.cse26 (+ (* 8 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse25 .cse26 (+ (select (select (store .cse24 |c_ULTIMATE.start_main_~a~0#1.base| .cse25) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse25 .cse26)))))) (let ((.cse18 (select .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse19 (select (select (store .cse24 |c_ULTIMATE.start_main_~a~0#1.base| .cse23) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse20 (mod .cse18 (+ .cse19 1)))) (or (not (< .cse18 0)) (forall ((v_ArrVal_674 Int)) (or (not (<= (+ .cse19 .cse20 1) v_ArrVal_674)) (forall ((|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_ArrVal_677 Int)) (let ((.cse21 (store (let ((.cse22 (store .cse23 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_674))) (store .cse22 .cse2 (mod (select .cse23 .cse2) (+ (select (select (store .cse24 |c_ULTIMATE.start_main_~a~0#1.base| .cse22) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_677))) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) c_~N~0) (< 0 (select .cse21 |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (< |v_ULTIMATE.start_main_~i~0#1_392| c_~N~0)) (= (select .cse21 .cse2) 0)))))) (not (< v_subst_3 c_~N~0)) (= .cse20 0) (< (+ v_subst_3 1) c_~N~0)))))))) (< (+ v_subst_5 1) c_~N~0) (not (< v_subst_5 c_~N~0)))) (forall ((v_subst_4 Int)) (or (< (+ v_subst_4 1) c_~N~0) (forall ((v_subst_1 Int)) (or (not (< v_subst_1 c_~N~0)) (forall ((v_ArrVal_674 Int)) (let ((.cse38 (select .cse17 (+ (* 8 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse38 .cse15))))) (let ((.cse30 (let ((.cse34 (let ((.cse37 (select .cse31 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse36 (store .cse37 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse12 .cse13 .cse38 (select .cse37 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse15)))) (store .cse36 .cse2 (+ (select .cse37 .cse2) (select (select (store .cse31 |c_ULTIMATE.start_main_~a~0#1.base| .cse36) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (.cse35 (+ (* 8 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse34 .cse35 (+ (select (select (store .cse31 |c_ULTIMATE.start_main_~a~0#1.base| .cse34) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse34 .cse35)))))) (or (not (<= (mod (select .cse30 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store .cse31 |c_ULTIMATE.start_main_~a~0#1.base| .cse30) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) v_ArrVal_674)) (forall ((|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_ArrVal_677 Int)) (let ((.cse32 (store (let ((.cse33 (store .cse30 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_674))) (store .cse33 .cse2 (mod (select .cse30 .cse2) (+ (select (select (store .cse31 |c_ULTIMATE.start_main_~a~0#1.base| .cse33) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_677))) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) c_~N~0) (not (< |v_ULTIMATE.start_main_~i~0#1_392| c_~N~0)) (= (select .cse32 .cse2) 0) (< 0 (select .cse32 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))))) (< (+ v_subst_1 1) c_~N~0))) (not (< v_subst_4 c_~N~0)))))))))) is different from true [2022-11-03 04:11:24,355 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse41 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse41))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse13 (select .cse41 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse12 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (let ((.cse16 (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse12 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 (< |c_ULTIMATE.start_main_~i~0#1| 1))) (and (or .cse0 (forall ((v_ArrVal_674 Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_subst_4 Int) (v_subst_1 Int) (v_ArrVal_677 Int)) (let ((.cse11 (select .cse16 (+ (* 8 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse4 (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse12 .cse13))))) (let ((.cse3 (let ((.cse6 (let ((.cse9 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse8 (store .cse9 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse10 .cse11 .cse12 (select .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse13)))) (store .cse8 .cse2 (+ (select .cse9 .cse2) (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse8) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (.cse7 (+ (* 8 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse6 .cse7 (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse6) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse6 .cse7)))))) (let ((.cse1 (store (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_674))) (store .cse5 .cse2 (mod (select .cse3 .cse2) (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse5) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_677))) (or (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_392|) (= (select .cse1 .cse2) 0) (< v_subst_1 |c_ULTIMATE.start_main_~i~0#1|) (< 0 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)) (< v_subst_4 v_subst_1) (not (<= (mod (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) v_ArrVal_674)) (< |v_ULTIMATE.start_main_~i~0#1_392| v_subst_4)))))))) (or (forall ((v_ArrVal_674 Int) (v_subst_6 Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_subst_2 Int) (v_ArrVal_677 Int)) (let ((.cse28 (select .cse16 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 v_subst_6))))) (let ((.cse23 (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse28 .cse12 .cse13))))) (let ((.cse22 (let ((.cse25 (+ (* 8 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse24 (let ((.cse27 (select .cse23 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse26 (store .cse27 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse10 .cse28 .cse12 (select .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse13)))) (store .cse26 .cse2 (+ (select .cse27 .cse2) (select (select (store .cse23 |c_ULTIMATE.start_main_~a~0#1.base| .cse26) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (store .cse24 .cse25 (+ (select .cse24 .cse25) (select (select (store .cse23 |c_ULTIMATE.start_main_~a~0#1.base| .cse24) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (let ((.cse20 (select .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse19 (select (select (store .cse23 |c_ULTIMATE.start_main_~a~0#1.base| .cse22) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse18 (mod .cse20 (+ .cse19 1))) (.cse17 (store (let ((.cse21 (store .cse22 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_674))) (store .cse21 .cse2 (mod (select .cse22 .cse2) (+ (select (select (store .cse23 |c_ULTIMATE.start_main_~a~0#1.base| .cse21) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_677))) (or (< 0 (select .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= .cse18 (+ v_ArrVal_674 .cse19 1))) (= 0 .cse18) (not (< .cse20 0)) (< v_subst_2 |v_ULTIMATE.start_main_~i~0#1_392|) (< |c_ULTIMATE.start_main_~i~0#1| v_subst_6) (< |c_ULTIMATE.start_main_~i~0#1| v_subst_2) (= (select .cse17 .cse2) 0) (< v_subst_6 |v_ULTIMATE.start_main_~i~0#1_392|) (< |v_ULTIMATE.start_main_~i~0#1_392| |c_ULTIMATE.start_main_~i~0#1|)))))))) .cse0) (or (forall ((v_ArrVal_674 Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_677 Int)) (let ((.cse40 (select .cse16 (+ (* 8 v_subst_5) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse35 (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse12 .cse40 .cse13))))) (let ((.cse34 (let ((.cse37 (+ (* 8 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse36 (let ((.cse39 (select .cse35 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse38 (store .cse39 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse10 (select .cse39 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse12 .cse40 .cse13)))) (store .cse38 .cse2 (+ (select (select (store .cse35 |c_ULTIMATE.start_main_~a~0#1.base| .cse38) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse39 .cse2))))))) (store .cse36 .cse37 (+ (select .cse36 .cse37) (select (select (store .cse35 |c_ULTIMATE.start_main_~a~0#1.base| .cse36) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (let ((.cse31 (select .cse34 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse32 (select (select (store .cse35 |c_ULTIMATE.start_main_~a~0#1.base| .cse34) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse30 (mod .cse31 (+ .cse32 1))) (.cse29 (store (let ((.cse33 (store .cse34 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_674))) (store .cse33 .cse2 (mod (select .cse34 .cse2) (+ (select (select (store .cse35 |c_ULTIMATE.start_main_~a~0#1.base| .cse33) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_677))) (or (< 0 (select .cse29 |c_ULTIMATE.start_main_~a~0#1.offset|)) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_392|) (= .cse30 0) (< |v_ULTIMATE.start_main_~i~0#1_392| v_subst_5) (not (< .cse31 0)) (not (<= (+ .cse32 .cse30 1) v_ArrVal_674)) (= (select .cse29 .cse2) 0) (< v_subst_5 v_subst_3) (< v_subst_3 |c_ULTIMATE.start_main_~i~0#1|)))))))) .cse0)))))))) is different from true [2022-11-03 04:11:32,383 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse19 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (.cse20 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_402| Int)) (or (forall ((v_ArrVal_674 Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_677 Int)) (let ((.cse18 (store .cse19 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_402|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse18))) (let ((.cse17 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse12 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse15 (select .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse14 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse13 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 v_subst_5) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse7 (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse14 .cse15))))) (let ((.cse6 (let ((.cse8 (let ((.cse11 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse10 (store .cse11 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse12 .cse13 .cse14 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse15)))) (store .cse10 .cse3 (+ (select (select (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| .cse10) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse11 .cse3)))))) (.cse9 (+ (* 8 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse8 .cse9 (+ (select (select (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| .cse8) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse8 .cse9)))))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (select (select (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| .cse6) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (store (let ((.cse5 (store .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_674))) (store .cse5 .cse3 (mod (select .cse6 .cse3) (+ 1 (select (select (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| .cse5) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_677)) (.cse0 (mod .cse1 (+ .cse4 1)))) (or (= .cse0 0) (not (< .cse1 0)) (= (select .cse2 .cse3) 0) (< |v_ULTIMATE.start_main_~i~0#1_392| v_subst_5) (< 0 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_402| |v_ULTIMATE.start_main_~i~0#1_392|) (< v_subst_5 v_subst_3) (< v_subst_3 |v_ULTIMATE.start_main_~i~0#1_402|) (not (<= (+ .cse4 .cse0 1) v_ArrVal_674)))))))))))))) (< |v_ULTIMATE.start_main_~i~0#1_402| 1) (not (<= .cse20 |v_ULTIMATE.start_main_~i~0#1_402|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_402| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_402| 1) (not (<= .cse20 |v_ULTIMATE.start_main_~i~0#1_402|)) (forall ((v_ArrVal_674 Int) (v_subst_6 Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_subst_2 Int) (v_ArrVal_677 Int)) (let ((.cse38 (store .cse19 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_402|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse38))) (let ((.cse37 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse32 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse34 (select .cse38 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse33 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse34))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse35 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse33 .cse34))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 v_subst_6))))) (let ((.cse27 (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse33 .cse34 .cse35))))) (let ((.cse26 (let ((.cse29 (+ (* 8 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse28 (let ((.cse31 (select .cse27 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse30 (store .cse31 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse32 .cse33 .cse34 .cse35 (select .cse31 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (store .cse30 .cse3 (+ (select .cse31 .cse3) (select (select (store .cse27 |c_ULTIMATE.start_main_~a~0#1.base| .cse30) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (store .cse28 .cse29 (+ (select .cse28 .cse29) (select (select (store .cse27 |c_ULTIMATE.start_main_~a~0#1.base| .cse28) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (let ((.cse24 (select .cse26 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse22 (select (select (store .cse27 |c_ULTIMATE.start_main_~a~0#1.base| .cse26) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse23 (store (let ((.cse25 (store .cse26 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_674))) (store .cse25 .cse3 (mod (select .cse26 .cse3) (+ (select (select (store .cse27 |c_ULTIMATE.start_main_~a~0#1.base| .cse25) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_677)) (.cse21 (mod .cse24 (+ .cse22 1)))) (or (< |v_ULTIMATE.start_main_~i~0#1_402| v_subst_2) (not (<= .cse21 (+ v_ArrVal_674 .cse22 1))) (< |v_ULTIMATE.start_main_~i~0#1_392| |v_ULTIMATE.start_main_~i~0#1_402|) (< v_subst_2 |v_ULTIMATE.start_main_~i~0#1_392|) (= (select .cse23 .cse3) 0) (not (< .cse24 0)) (< |v_ULTIMATE.start_main_~i~0#1_402| v_subst_6) (< 0 (select .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|)) (< v_subst_6 |v_ULTIMATE.start_main_~i~0#1_392|) (= .cse21 0))))))))))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_402| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_402| 1) (forall ((v_ArrVal_674 Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_subst_4 Int) (v_subst_1 Int) (v_ArrVal_677 Int)) (let ((.cse53 (store .cse19 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_402|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse53))) (let ((.cse52 (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse47 (select .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse50 (select .cse53 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse48 (select (select (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse47 .cse50))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse49 (select (select (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse47 .cse48 .cse50))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse41 (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse47 .cse48 .cse49 .cse50))))) (let ((.cse40 (let ((.cse43 (let ((.cse46 (select .cse41 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse45 (store .cse46 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse47 .cse48 .cse49 .cse50)))) (store .cse45 .cse3 (+ (select .cse46 .cse3) (select (select (store .cse41 |c_ULTIMATE.start_main_~a~0#1.base| .cse45) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (.cse44 (+ (* 8 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse43 .cse44 (+ (select (select (store .cse41 |c_ULTIMATE.start_main_~a~0#1.base| .cse43) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse43 .cse44)))))) (let ((.cse39 (store (let ((.cse42 (store .cse40 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_674))) (store .cse42 .cse3 (mod (select .cse40 .cse3) (+ (select (select (store .cse41 |c_ULTIMATE.start_main_~a~0#1.base| .cse42) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_677))) (or (< v_subst_1 |v_ULTIMATE.start_main_~i~0#1_402|) (= (select .cse39 .cse3) 0) (< |v_ULTIMATE.start_main_~i~0#1_402| |v_ULTIMATE.start_main_~i~0#1_392|) (< 0 (select .cse39 |c_ULTIMATE.start_main_~a~0#1.offset|)) (< v_subst_4 v_subst_1) (not (<= (mod (select .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store .cse41 |c_ULTIMATE.start_main_~a~0#1.base| .cse40) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) v_ArrVal_674)) (< |v_ULTIMATE.start_main_~i~0#1_392| v_subst_4)))))))))))) (not (<= .cse20 |v_ULTIMATE.start_main_~i~0#1_402|)))))) is different from false [2022-11-03 04:11:34,399 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse19 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (.cse20 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_402| Int)) (or (forall ((v_ArrVal_674 Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_677 Int)) (let ((.cse18 (store .cse19 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_402|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse18))) (let ((.cse17 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse12 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse15 (select .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse14 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse13 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 v_subst_5) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse7 (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse14 .cse15))))) (let ((.cse6 (let ((.cse8 (let ((.cse11 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse10 (store .cse11 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse12 .cse13 .cse14 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse15)))) (store .cse10 .cse3 (+ (select (select (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| .cse10) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse11 .cse3)))))) (.cse9 (+ (* 8 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse8 .cse9 (+ (select (select (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| .cse8) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse8 .cse9)))))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (select (select (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| .cse6) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (store (let ((.cse5 (store .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_674))) (store .cse5 .cse3 (mod (select .cse6 .cse3) (+ 1 (select (select (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| .cse5) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_677)) (.cse0 (mod .cse1 (+ .cse4 1)))) (or (= .cse0 0) (not (< .cse1 0)) (= (select .cse2 .cse3) 0) (< |v_ULTIMATE.start_main_~i~0#1_392| v_subst_5) (< 0 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_402| |v_ULTIMATE.start_main_~i~0#1_392|) (< v_subst_5 v_subst_3) (< v_subst_3 |v_ULTIMATE.start_main_~i~0#1_402|) (not (<= (+ .cse4 .cse0 1) v_ArrVal_674)))))))))))))) (< |v_ULTIMATE.start_main_~i~0#1_402| 1) (not (<= .cse20 |v_ULTIMATE.start_main_~i~0#1_402|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_402| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_402| 1) (not (<= .cse20 |v_ULTIMATE.start_main_~i~0#1_402|)) (forall ((v_ArrVal_674 Int) (v_subst_6 Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_subst_2 Int) (v_ArrVal_677 Int)) (let ((.cse38 (store .cse19 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_402|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse38))) (let ((.cse37 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse32 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse34 (select .cse38 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse33 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse34))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse35 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse33 .cse34))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 v_subst_6))))) (let ((.cse27 (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse33 .cse34 .cse35))))) (let ((.cse26 (let ((.cse29 (+ (* 8 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse28 (let ((.cse31 (select .cse27 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse30 (store .cse31 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse32 .cse33 .cse34 .cse35 (select .cse31 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (store .cse30 .cse3 (+ (select .cse31 .cse3) (select (select (store .cse27 |c_ULTIMATE.start_main_~a~0#1.base| .cse30) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (store .cse28 .cse29 (+ (select .cse28 .cse29) (select (select (store .cse27 |c_ULTIMATE.start_main_~a~0#1.base| .cse28) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (let ((.cse24 (select .cse26 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse22 (select (select (store .cse27 |c_ULTIMATE.start_main_~a~0#1.base| .cse26) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse23 (store (let ((.cse25 (store .cse26 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_674))) (store .cse25 .cse3 (mod (select .cse26 .cse3) (+ (select (select (store .cse27 |c_ULTIMATE.start_main_~a~0#1.base| .cse25) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_677)) (.cse21 (mod .cse24 (+ .cse22 1)))) (or (< |v_ULTIMATE.start_main_~i~0#1_402| v_subst_2) (not (<= .cse21 (+ v_ArrVal_674 .cse22 1))) (< |v_ULTIMATE.start_main_~i~0#1_392| |v_ULTIMATE.start_main_~i~0#1_402|) (< v_subst_2 |v_ULTIMATE.start_main_~i~0#1_392|) (= (select .cse23 .cse3) 0) (not (< .cse24 0)) (< |v_ULTIMATE.start_main_~i~0#1_402| v_subst_6) (< 0 (select .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|)) (< v_subst_6 |v_ULTIMATE.start_main_~i~0#1_392|) (= .cse21 0))))))))))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_402| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_402| 1) (forall ((v_ArrVal_674 Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_subst_4 Int) (v_subst_1 Int) (v_ArrVal_677 Int)) (let ((.cse53 (store .cse19 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_402|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse53))) (let ((.cse52 (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse47 (select .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse50 (select .cse53 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse48 (select (select (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse47 .cse50))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse49 (select (select (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse47 .cse48 .cse50))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse41 (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse47 .cse48 .cse49 .cse50))))) (let ((.cse40 (let ((.cse43 (let ((.cse46 (select .cse41 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse45 (store .cse46 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse47 .cse48 .cse49 .cse50)))) (store .cse45 .cse3 (+ (select .cse46 .cse3) (select (select (store .cse41 |c_ULTIMATE.start_main_~a~0#1.base| .cse45) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (.cse44 (+ (* 8 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse43 .cse44 (+ (select (select (store .cse41 |c_ULTIMATE.start_main_~a~0#1.base| .cse43) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse43 .cse44)))))) (let ((.cse39 (store (let ((.cse42 (store .cse40 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_674))) (store .cse42 .cse3 (mod (select .cse40 .cse3) (+ (select (select (store .cse41 |c_ULTIMATE.start_main_~a~0#1.base| .cse42) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_677))) (or (< v_subst_1 |v_ULTIMATE.start_main_~i~0#1_402|) (= (select .cse39 .cse3) 0) (< |v_ULTIMATE.start_main_~i~0#1_402| |v_ULTIMATE.start_main_~i~0#1_392|) (< 0 (select .cse39 |c_ULTIMATE.start_main_~a~0#1.offset|)) (< v_subst_4 v_subst_1) (not (<= (mod (select .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store .cse41 |c_ULTIMATE.start_main_~a~0#1.base| .cse40) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) v_ArrVal_674)) (< |v_ULTIMATE.start_main_~i~0#1_392| v_subst_4)))))))))))) (not (<= .cse20 |v_ULTIMATE.start_main_~i~0#1_402|)))))) is different from true [2022-11-03 04:12:54,687 WARN L234 SmtUtils]: Spent 10.31s on a formula simplification that was a NOOP. DAG size: 217 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 04:12:54,778 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 13 refuted. 1 times theorem prover too weak. 0 trivial. 12 not checked. [2022-11-03 04:12:54,779 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:12:54,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595628416] [2022-11-03 04:12:54,779 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 04:12:54,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006355470] [2022-11-03 04:12:54,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006355470] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:12:54,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1671903269] [2022-11-03 04:12:54,781 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-11-03 04:12:54,781 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 04:12:54,782 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 04:12:54,782 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 04:12:54,782 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 04:12:54,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:54,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:54,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:54,883 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 04:12:54,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-03 04:12:54,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:54,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:54,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 39 [2022-11-03 04:12:54,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:54,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 25 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 98 [2022-11-03 04:12:54,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:54,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:54,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 30 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 113 [2022-11-03 04:12:55,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:55,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:55,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:55,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:55,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:55,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:55,043 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:12:55,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:55,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:55,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:55,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:55,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:55,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:55,120 INFO L356 Elim1Store]: treesize reduction 166, result has 11.7 percent of original size [2022-11-03 04:12:55,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 34 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 22 case distinctions, treesize of input 434 treesize of output 423 [2022-11-03 04:12:55,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-03 04:12:55,231 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:12:55,259 INFO L356 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-03 04:12:55,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 34 [2022-11-03 04:12:55,340 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 04:12:55,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 54 [2022-11-03 04:12:55,373 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:12:55,400 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 04:12:55,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-03 04:12:55,469 INFO L356 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-03 04:12:55,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 54 [2022-11-03 04:12:55,488 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:12:55,586 INFO L356 Elim1Store]: treesize reduction 53, result has 27.4 percent of original size [2022-11-03 04:12:55,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 73 [2022-11-03 04:12:55,679 INFO L356 Elim1Store]: treesize reduction 63, result has 38.8 percent of original size [2022-11-03 04:12:55,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 93 [2022-11-03 04:12:55,752 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 04:13:34,599 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3305#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (<= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 1) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-03 04:13:34,599 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 04:13:34,599 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 04:13:34,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 43 [2022-11-03 04:13:34,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437855579] [2022-11-03 04:13:34,600 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 04:13:34,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-03 04:13:34,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:13:34,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-03 04:13:34,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=1506, Unknown=70, NotChecked=430, Total=2256 [2022-11-03 04:13:34,601 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 43 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 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-03 04:13:36,633 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse54 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse55 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse19 (store .cse54 (+ .cse55 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (.cse20 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_402| Int)) (or (forall ((v_ArrVal_674 Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_677 Int)) (let ((.cse18 (store .cse19 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_402|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse18))) (let ((.cse17 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse12 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse15 (select .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse14 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse13 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 v_subst_5) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse7 (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse14 .cse15))))) (let ((.cse6 (let ((.cse8 (let ((.cse11 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse10 (store .cse11 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse12 .cse13 .cse14 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse15)))) (store .cse10 .cse3 (+ (select (select (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| .cse10) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse11 .cse3)))))) (.cse9 (+ (* 8 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse8 .cse9 (+ (select (select (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| .cse8) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse8 .cse9)))))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (select (select (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| .cse6) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (store (let ((.cse5 (store .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_674))) (store .cse5 .cse3 (mod (select .cse6 .cse3) (+ 1 (select (select (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| .cse5) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_677)) (.cse0 (mod .cse1 (+ .cse4 1)))) (or (= .cse0 0) (not (< .cse1 0)) (= (select .cse2 .cse3) 0) (< |v_ULTIMATE.start_main_~i~0#1_392| v_subst_5) (< 0 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_402| |v_ULTIMATE.start_main_~i~0#1_392|) (< v_subst_5 v_subst_3) (< v_subst_3 |v_ULTIMATE.start_main_~i~0#1_402|) (not (<= (+ .cse4 .cse0 1) v_ArrVal_674)))))))))))))) (< |v_ULTIMATE.start_main_~i~0#1_402| 1) (not (<= .cse20 |v_ULTIMATE.start_main_~i~0#1_402|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_402| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_402| 1) (not (<= .cse20 |v_ULTIMATE.start_main_~i~0#1_402|)) (forall ((v_ArrVal_674 Int) (v_subst_6 Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_subst_2 Int) (v_ArrVal_677 Int)) (let ((.cse38 (store .cse19 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_402|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse38))) (let ((.cse37 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse32 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse34 (select .cse38 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse33 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse34))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse35 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse33 .cse34))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 v_subst_6))))) (let ((.cse27 (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse33 .cse34 .cse35))))) (let ((.cse26 (let ((.cse29 (+ (* 8 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse28 (let ((.cse31 (select .cse27 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse30 (store .cse31 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse32 .cse33 .cse34 .cse35 (select .cse31 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (store .cse30 .cse3 (+ (select .cse31 .cse3) (select (select (store .cse27 |c_ULTIMATE.start_main_~a~0#1.base| .cse30) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (store .cse28 .cse29 (+ (select .cse28 .cse29) (select (select (store .cse27 |c_ULTIMATE.start_main_~a~0#1.base| .cse28) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (let ((.cse24 (select .cse26 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse22 (select (select (store .cse27 |c_ULTIMATE.start_main_~a~0#1.base| .cse26) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse23 (store (let ((.cse25 (store .cse26 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_674))) (store .cse25 .cse3 (mod (select .cse26 .cse3) (+ (select (select (store .cse27 |c_ULTIMATE.start_main_~a~0#1.base| .cse25) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_677)) (.cse21 (mod .cse24 (+ .cse22 1)))) (or (< |v_ULTIMATE.start_main_~i~0#1_402| v_subst_2) (not (<= .cse21 (+ v_ArrVal_674 .cse22 1))) (< |v_ULTIMATE.start_main_~i~0#1_392| |v_ULTIMATE.start_main_~i~0#1_402|) (< v_subst_2 |v_ULTIMATE.start_main_~i~0#1_392|) (= (select .cse23 .cse3) 0) (not (< .cse24 0)) (< |v_ULTIMATE.start_main_~i~0#1_402| v_subst_6) (< 0 (select .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|)) (< v_subst_6 |v_ULTIMATE.start_main_~i~0#1_392|) (= .cse21 0))))))))))))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (forall ((|v_ULTIMATE.start_main_~i~0#1_402| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_402| 1) (forall ((v_ArrVal_674 Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_subst_4 Int) (v_subst_1 Int) (v_ArrVal_677 Int)) (let ((.cse53 (store .cse19 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_402|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse53))) (let ((.cse52 (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse47 (select .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse50 (select .cse53 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse48 (select (select (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse47 .cse50))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse49 (select (select (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse47 .cse48 .cse50))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse41 (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse47 .cse48 .cse49 .cse50))))) (let ((.cse40 (let ((.cse43 (let ((.cse46 (select .cse41 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse45 (store .cse46 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse47 .cse48 .cse49 .cse50)))) (store .cse45 .cse3 (+ (select .cse46 .cse3) (select (select (store .cse41 |c_ULTIMATE.start_main_~a~0#1.base| .cse45) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (.cse44 (+ (* 8 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse43 .cse44 (+ (select (select (store .cse41 |c_ULTIMATE.start_main_~a~0#1.base| .cse43) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse43 .cse44)))))) (let ((.cse39 (store (let ((.cse42 (store .cse40 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_674))) (store .cse42 .cse3 (mod (select .cse40 .cse3) (+ (select (select (store .cse41 |c_ULTIMATE.start_main_~a~0#1.base| .cse42) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_677))) (or (< v_subst_1 |v_ULTIMATE.start_main_~i~0#1_402|) (= (select .cse39 .cse3) 0) (< |v_ULTIMATE.start_main_~i~0#1_402| |v_ULTIMATE.start_main_~i~0#1_392|) (< 0 (select .cse39 |c_ULTIMATE.start_main_~a~0#1.offset|)) (< v_subst_4 v_subst_1) (not (<= (mod (select .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store .cse41 |c_ULTIMATE.start_main_~a~0#1.base| .cse40) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) v_ArrVal_674)) (< |v_ULTIMATE.start_main_~i~0#1_392| v_subst_4)))))))))))) (not (<= .cse20 |v_ULTIMATE.start_main_~i~0#1_402|)))) (= (select .cse54 (+ .cse55 |c_ULTIMATE.start_main_~a~0#1.offset| (- 8))) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-11-03 04:13:41,433 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse70 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse21 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse19 (store .cse21 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (.cse20 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse40 (select .cse70 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse56 (select .cse21 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_402| Int)) (or (forall ((v_ArrVal_674 Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_677 Int)) (let ((.cse18 (store .cse19 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_402|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse18))) (let ((.cse17 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse12 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse15 (select .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse14 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse13 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 v_subst_5) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse7 (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse14 .cse15))))) (let ((.cse6 (let ((.cse8 (let ((.cse11 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse10 (store .cse11 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse12 .cse13 .cse14 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse15)))) (store .cse10 .cse3 (+ (select (select (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| .cse10) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse11 .cse3)))))) (.cse9 (+ (* 8 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse8 .cse9 (+ (select (select (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| .cse8) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse8 .cse9)))))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (select (select (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| .cse6) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (store (let ((.cse5 (store .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_674))) (store .cse5 .cse3 (mod (select .cse6 .cse3) (+ 1 (select (select (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| .cse5) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_677)) (.cse0 (mod .cse1 (+ .cse4 1)))) (or (= .cse0 0) (not (< .cse1 0)) (= (select .cse2 .cse3) 0) (< |v_ULTIMATE.start_main_~i~0#1_392| v_subst_5) (< 0 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_402| |v_ULTIMATE.start_main_~i~0#1_392|) (< v_subst_5 v_subst_3) (< v_subst_3 |v_ULTIMATE.start_main_~i~0#1_402|) (not (<= (+ .cse4 .cse0 1) v_ArrVal_674)))))))))))))) (< |v_ULTIMATE.start_main_~i~0#1_402| 1) (not (<= .cse20 |v_ULTIMATE.start_main_~i~0#1_402|)))) (exists ((|v_ULTIMATE.start_main_~i~0#1_374| Int)) (and (= (select .cse21 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_374|) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_374| 1)) (< |v_ULTIMATE.start_main_~i~0#1_374| c_~N~0) (<= 2 |v_ULTIMATE.start_main_~i~0#1_374|))) (forall ((|v_ULTIMATE.start_main_~i~0#1_402| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_402| 1) (not (<= .cse20 |v_ULTIMATE.start_main_~i~0#1_402|)) (forall ((v_ArrVal_674 Int) (v_subst_6 Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_subst_2 Int) (v_ArrVal_677 Int)) (let ((.cse39 (store .cse19 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_402|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse39))) (let ((.cse38 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse33 (select .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse35 (select .cse39 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse34 (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse33 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse36 (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse33 .cse34 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 v_subst_6))))) (let ((.cse28 (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse33 .cse34 .cse35 .cse36))))) (let ((.cse27 (let ((.cse30 (+ (* 8 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse29 (let ((.cse32 (select .cse28 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse31 (store .cse32 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse33 .cse34 .cse35 .cse36 (select .cse32 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (store .cse31 .cse3 (+ (select .cse32 .cse3) (select (select (store .cse28 |c_ULTIMATE.start_main_~a~0#1.base| .cse31) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (store .cse29 .cse30 (+ (select .cse29 .cse30) (select (select (store .cse28 |c_ULTIMATE.start_main_~a~0#1.base| .cse29) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (let ((.cse25 (select .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse23 (select (select (store .cse28 |c_ULTIMATE.start_main_~a~0#1.base| .cse27) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse24 (store (let ((.cse26 (store .cse27 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_674))) (store .cse26 .cse3 (mod (select .cse27 .cse3) (+ (select (select (store .cse28 |c_ULTIMATE.start_main_~a~0#1.base| .cse26) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_677)) (.cse22 (mod .cse25 (+ .cse23 1)))) (or (< |v_ULTIMATE.start_main_~i~0#1_402| v_subst_2) (not (<= .cse22 (+ v_ArrVal_674 .cse23 1))) (< |v_ULTIMATE.start_main_~i~0#1_392| |v_ULTIMATE.start_main_~i~0#1_402|) (< v_subst_2 |v_ULTIMATE.start_main_~i~0#1_392|) (= (select .cse24 .cse3) 0) (not (< .cse25 0)) (< |v_ULTIMATE.start_main_~i~0#1_402| v_subst_6) (< 0 (select .cse24 |c_ULTIMATE.start_main_~a~0#1.offset|)) (< v_subst_6 |v_ULTIMATE.start_main_~i~0#1_392|) (= .cse22 0))))))))))))))) (= (select .cse21 .cse3) 1) (= .cse40 0) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (forall ((|v_ULTIMATE.start_main_~i~0#1_402| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_402| 1) (forall ((v_ArrVal_674 Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_subst_4 Int) (v_subst_1 Int) (v_ArrVal_677 Int)) (let ((.cse55 (store .cse19 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_402|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse53 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse55))) (let ((.cse54 (select .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse49 (select .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse52 (select .cse55 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse50 (select (select (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse49 .cse52))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse51 (select (select (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse49 .cse50 .cse52))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse43 (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse49 .cse50 .cse51 .cse52))))) (let ((.cse42 (let ((.cse45 (let ((.cse48 (select .cse43 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse47 (store .cse48 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse48 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse49 .cse50 .cse51 .cse52)))) (store .cse47 .cse3 (+ (select .cse48 .cse3) (select (select (store .cse43 |c_ULTIMATE.start_main_~a~0#1.base| .cse47) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (.cse46 (+ (* 8 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse45 .cse46 (+ (select (select (store .cse43 |c_ULTIMATE.start_main_~a~0#1.base| .cse45) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse45 .cse46)))))) (let ((.cse41 (store (let ((.cse44 (store .cse42 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_674))) (store .cse44 .cse3 (mod (select .cse42 .cse3) (+ (select (select (store .cse43 |c_ULTIMATE.start_main_~a~0#1.base| .cse44) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_677))) (or (< v_subst_1 |v_ULTIMATE.start_main_~i~0#1_402|) (= (select .cse41 .cse3) 0) (< |v_ULTIMATE.start_main_~i~0#1_402| |v_ULTIMATE.start_main_~i~0#1_392|) (< 0 (select .cse41 |c_ULTIMATE.start_main_~a~0#1.offset|)) (< v_subst_4 v_subst_1) (not (<= (mod (select .cse42 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store .cse43 |c_ULTIMATE.start_main_~a~0#1.base| .cse42) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) v_ArrVal_674)) (< |v_ULTIMATE.start_main_~i~0#1_392| v_subst_4)))))))))))) (not (<= .cse20 |v_ULTIMATE.start_main_~i~0#1_402|)))) (= .cse56 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (or (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) (not (< 1 c_~N~0)) (let ((.cse68 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse40 .cse56))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse71 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse40 .cse68 .cse56))) |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((v_subst_6 Int)) (or (not (< v_subst_6 c_~N~0)) (forall ((v_subst_2 Int)) (let ((.cse69 (select .cse71 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 v_subst_6))))) (let ((.cse61 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse40 .cse68 .cse69 .cse56))))) (let ((.cse60 (let ((.cse65 (+ (* 8 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse64 (let ((.cse67 (select .cse61 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse66 (store .cse67 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse40 .cse68 (select .cse67 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse69 .cse56)))) (store .cse66 .cse3 (+ (select (select (store .cse61 |c_ULTIMATE.start_main_~a~0#1.base| .cse66) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse67 .cse3))))))) (store .cse64 .cse65 (+ (select .cse64 .cse65) (select (select (store .cse61 |c_ULTIMATE.start_main_~a~0#1.base| .cse64) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (let ((.cse63 (select .cse60 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse62 (select (select (store .cse61 |c_ULTIMATE.start_main_~a~0#1.base| .cse60) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse57 (mod .cse63 (+ .cse62 1)))) (or (< (+ v_subst_2 1) c_~N~0) (not (< v_subst_2 c_~N~0)) (= .cse57 0) (forall ((v_ArrVal_674 Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_ArrVal_677 Int)) (let ((.cse58 (store (let ((.cse59 (store .cse60 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_674))) (store .cse59 .cse3 (mod (select .cse60 .cse3) (+ (select (select (store .cse61 |c_ULTIMATE.start_main_~a~0#1.base| .cse59) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_677))) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) c_~N~0) (= (select .cse58 .cse3) 0) (< 0 (select .cse58 |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (< |v_ULTIMATE.start_main_~i~0#1_392| c_~N~0))))) (not (<= .cse57 (+ .cse62 v_ArrVal_674 1))))) (not (< .cse63 0))))))))) (< (+ v_subst_6 1) c_~N~0))) (forall ((v_subst_5 Int)) (or (forall ((v_subst_3 Int)) (let ((.cse83 (select .cse71 (+ (* 8 v_subst_5) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse78 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse40 .cse68 .cse83 .cse56))))) (let ((.cse77 (let ((.cse79 (let ((.cse82 (select .cse78 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse81 (store .cse82 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse40 .cse68 .cse83 (select .cse82 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse56)))) (store .cse81 .cse3 (+ (select (select (store .cse78 |c_ULTIMATE.start_main_~a~0#1.base| .cse81) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse82 .cse3)))))) (.cse80 (+ (* 8 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse79 .cse80 (+ (select (select (store .cse78 |c_ULTIMATE.start_main_~a~0#1.base| .cse79) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse79 .cse80)))))) (let ((.cse72 (select .cse77 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse73 (select (select (store .cse78 |c_ULTIMATE.start_main_~a~0#1.base| .cse77) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse74 (mod .cse72 (+ .cse73 1)))) (or (not (< .cse72 0)) (forall ((v_ArrVal_674 Int)) (or (not (<= (+ .cse73 .cse74 1) v_ArrVal_674)) (forall ((|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_ArrVal_677 Int)) (let ((.cse75 (store (let ((.cse76 (store .cse77 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_674))) (store .cse76 .cse3 (mod (select .cse77 .cse3) (+ (select (select (store .cse78 |c_ULTIMATE.start_main_~a~0#1.base| .cse76) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_677))) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) c_~N~0) (< 0 (select .cse75 |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (< |v_ULTIMATE.start_main_~i~0#1_392| c_~N~0)) (= (select .cse75 .cse3) 0)))))) (not (< v_subst_3 c_~N~0)) (= .cse74 0) (< (+ v_subst_3 1) c_~N~0)))))))) (< (+ v_subst_5 1) c_~N~0) (not (< v_subst_5 c_~N~0)))) (forall ((v_subst_4 Int)) (or (< (+ v_subst_4 1) c_~N~0) (forall ((v_subst_1 Int)) (or (not (< v_subst_1 c_~N~0)) (forall ((v_ArrVal_674 Int)) (let ((.cse92 (select .cse71 (+ (* 8 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse85 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse40 .cse68 .cse92 .cse56))))) (let ((.cse84 (let ((.cse88 (let ((.cse91 (select .cse85 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse90 (store .cse91 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse40 .cse68 .cse92 (select .cse91 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse56)))) (store .cse90 .cse3 (+ (select .cse91 .cse3) (select (select (store .cse85 |c_ULTIMATE.start_main_~a~0#1.base| .cse90) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (.cse89 (+ (* 8 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse88 .cse89 (+ (select (select (store .cse85 |c_ULTIMATE.start_main_~a~0#1.base| .cse88) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse88 .cse89)))))) (or (not (<= (mod (select .cse84 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store .cse85 |c_ULTIMATE.start_main_~a~0#1.base| .cse84) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) v_ArrVal_674)) (forall ((|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_ArrVal_677 Int)) (let ((.cse86 (store (let ((.cse87 (store .cse84 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_674))) (store .cse87 .cse3 (mod (select .cse84 .cse3) (+ (select (select (store .cse85 |c_ULTIMATE.start_main_~a~0#1.base| .cse87) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_677))) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) c_~N~0) (not (< |v_ULTIMATE.start_main_~i~0#1_392| c_~N~0)) (= (select .cse86 .cse3) 0) (< 0 (select .cse86 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))))) (< (+ v_subst_1 1) c_~N~0))) (not (< v_subst_4 c_~N~0))))))))))) is different from false [2022-11-03 04:13:43,453 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse70 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse21 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse19 (store .cse21 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (.cse20 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse40 (select .cse70 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse56 (select .cse21 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_402| Int)) (or (forall ((v_ArrVal_674 Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_677 Int)) (let ((.cse18 (store .cse19 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_402|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse18))) (let ((.cse17 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse12 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse15 (select .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse14 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse13 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 v_subst_5) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse7 (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse14 .cse15))))) (let ((.cse6 (let ((.cse8 (let ((.cse11 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse10 (store .cse11 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse12 .cse13 .cse14 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse15)))) (store .cse10 .cse3 (+ (select (select (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| .cse10) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse11 .cse3)))))) (.cse9 (+ (* 8 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse8 .cse9 (+ (select (select (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| .cse8) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse8 .cse9)))))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (select (select (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| .cse6) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (store (let ((.cse5 (store .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_674))) (store .cse5 .cse3 (mod (select .cse6 .cse3) (+ 1 (select (select (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| .cse5) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_677)) (.cse0 (mod .cse1 (+ .cse4 1)))) (or (= .cse0 0) (not (< .cse1 0)) (= (select .cse2 .cse3) 0) (< |v_ULTIMATE.start_main_~i~0#1_392| v_subst_5) (< 0 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_402| |v_ULTIMATE.start_main_~i~0#1_392|) (< v_subst_5 v_subst_3) (< v_subst_3 |v_ULTIMATE.start_main_~i~0#1_402|) (not (<= (+ .cse4 .cse0 1) v_ArrVal_674)))))))))))))) (< |v_ULTIMATE.start_main_~i~0#1_402| 1) (not (<= .cse20 |v_ULTIMATE.start_main_~i~0#1_402|)))) (exists ((|v_ULTIMATE.start_main_~i~0#1_374| Int)) (and (= (select .cse21 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_374|) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_374| 1)) (< |v_ULTIMATE.start_main_~i~0#1_374| c_~N~0) (<= 2 |v_ULTIMATE.start_main_~i~0#1_374|))) (forall ((|v_ULTIMATE.start_main_~i~0#1_402| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_402| 1) (not (<= .cse20 |v_ULTIMATE.start_main_~i~0#1_402|)) (forall ((v_ArrVal_674 Int) (v_subst_6 Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_subst_2 Int) (v_ArrVal_677 Int)) (let ((.cse39 (store .cse19 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_402|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse39))) (let ((.cse38 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse33 (select .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse35 (select .cse39 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse34 (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse33 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse36 (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse33 .cse34 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 v_subst_6))))) (let ((.cse28 (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse33 .cse34 .cse35 .cse36))))) (let ((.cse27 (let ((.cse30 (+ (* 8 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse29 (let ((.cse32 (select .cse28 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse31 (store .cse32 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse33 .cse34 .cse35 .cse36 (select .cse32 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (store .cse31 .cse3 (+ (select .cse32 .cse3) (select (select (store .cse28 |c_ULTIMATE.start_main_~a~0#1.base| .cse31) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (store .cse29 .cse30 (+ (select .cse29 .cse30) (select (select (store .cse28 |c_ULTIMATE.start_main_~a~0#1.base| .cse29) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (let ((.cse25 (select .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse23 (select (select (store .cse28 |c_ULTIMATE.start_main_~a~0#1.base| .cse27) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse24 (store (let ((.cse26 (store .cse27 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_674))) (store .cse26 .cse3 (mod (select .cse27 .cse3) (+ (select (select (store .cse28 |c_ULTIMATE.start_main_~a~0#1.base| .cse26) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_677)) (.cse22 (mod .cse25 (+ .cse23 1)))) (or (< |v_ULTIMATE.start_main_~i~0#1_402| v_subst_2) (not (<= .cse22 (+ v_ArrVal_674 .cse23 1))) (< |v_ULTIMATE.start_main_~i~0#1_392| |v_ULTIMATE.start_main_~i~0#1_402|) (< v_subst_2 |v_ULTIMATE.start_main_~i~0#1_392|) (= (select .cse24 .cse3) 0) (not (< .cse25 0)) (< |v_ULTIMATE.start_main_~i~0#1_402| v_subst_6) (< 0 (select .cse24 |c_ULTIMATE.start_main_~a~0#1.offset|)) (< v_subst_6 |v_ULTIMATE.start_main_~i~0#1_392|) (= .cse22 0))))))))))))))) (= (select .cse21 .cse3) 1) (= .cse40 0) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (forall ((|v_ULTIMATE.start_main_~i~0#1_402| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_402| 1) (forall ((v_ArrVal_674 Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_subst_4 Int) (v_subst_1 Int) (v_ArrVal_677 Int)) (let ((.cse55 (store .cse19 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_402|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse53 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse55))) (let ((.cse54 (select .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse49 (select .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse52 (select .cse55 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse50 (select (select (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse49 .cse52))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse51 (select (select (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse49 .cse50 .cse52))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse43 (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse49 .cse50 .cse51 .cse52))))) (let ((.cse42 (let ((.cse45 (let ((.cse48 (select .cse43 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse47 (store .cse48 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse48 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse49 .cse50 .cse51 .cse52)))) (store .cse47 .cse3 (+ (select .cse48 .cse3) (select (select (store .cse43 |c_ULTIMATE.start_main_~a~0#1.base| .cse47) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (.cse46 (+ (* 8 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse45 .cse46 (+ (select (select (store .cse43 |c_ULTIMATE.start_main_~a~0#1.base| .cse45) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse45 .cse46)))))) (let ((.cse41 (store (let ((.cse44 (store .cse42 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_674))) (store .cse44 .cse3 (mod (select .cse42 .cse3) (+ (select (select (store .cse43 |c_ULTIMATE.start_main_~a~0#1.base| .cse44) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_677))) (or (< v_subst_1 |v_ULTIMATE.start_main_~i~0#1_402|) (= (select .cse41 .cse3) 0) (< |v_ULTIMATE.start_main_~i~0#1_402| |v_ULTIMATE.start_main_~i~0#1_392|) (< 0 (select .cse41 |c_ULTIMATE.start_main_~a~0#1.offset|)) (< v_subst_4 v_subst_1) (not (<= (mod (select .cse42 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store .cse43 |c_ULTIMATE.start_main_~a~0#1.base| .cse42) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) v_ArrVal_674)) (< |v_ULTIMATE.start_main_~i~0#1_392| v_subst_4)))))))))))) (not (<= .cse20 |v_ULTIMATE.start_main_~i~0#1_402|)))) (= .cse56 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (or (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) (not (< 1 c_~N~0)) (let ((.cse68 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse40 .cse56))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse71 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse40 .cse68 .cse56))) |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((v_subst_6 Int)) (or (not (< v_subst_6 c_~N~0)) (forall ((v_subst_2 Int)) (let ((.cse69 (select .cse71 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 v_subst_6))))) (let ((.cse61 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse40 .cse68 .cse69 .cse56))))) (let ((.cse60 (let ((.cse65 (+ (* 8 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse64 (let ((.cse67 (select .cse61 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse66 (store .cse67 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse40 .cse68 (select .cse67 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse69 .cse56)))) (store .cse66 .cse3 (+ (select (select (store .cse61 |c_ULTIMATE.start_main_~a~0#1.base| .cse66) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse67 .cse3))))))) (store .cse64 .cse65 (+ (select .cse64 .cse65) (select (select (store .cse61 |c_ULTIMATE.start_main_~a~0#1.base| .cse64) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (let ((.cse63 (select .cse60 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse62 (select (select (store .cse61 |c_ULTIMATE.start_main_~a~0#1.base| .cse60) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse57 (mod .cse63 (+ .cse62 1)))) (or (< (+ v_subst_2 1) c_~N~0) (not (< v_subst_2 c_~N~0)) (= .cse57 0) (forall ((v_ArrVal_674 Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_ArrVal_677 Int)) (let ((.cse58 (store (let ((.cse59 (store .cse60 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_674))) (store .cse59 .cse3 (mod (select .cse60 .cse3) (+ (select (select (store .cse61 |c_ULTIMATE.start_main_~a~0#1.base| .cse59) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_677))) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) c_~N~0) (= (select .cse58 .cse3) 0) (< 0 (select .cse58 |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (< |v_ULTIMATE.start_main_~i~0#1_392| c_~N~0))))) (not (<= .cse57 (+ .cse62 v_ArrVal_674 1))))) (not (< .cse63 0))))))))) (< (+ v_subst_6 1) c_~N~0))) (forall ((v_subst_5 Int)) (or (forall ((v_subst_3 Int)) (let ((.cse83 (select .cse71 (+ (* 8 v_subst_5) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse78 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse40 .cse68 .cse83 .cse56))))) (let ((.cse77 (let ((.cse79 (let ((.cse82 (select .cse78 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse81 (store .cse82 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse40 .cse68 .cse83 (select .cse82 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse56)))) (store .cse81 .cse3 (+ (select (select (store .cse78 |c_ULTIMATE.start_main_~a~0#1.base| .cse81) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse82 .cse3)))))) (.cse80 (+ (* 8 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse79 .cse80 (+ (select (select (store .cse78 |c_ULTIMATE.start_main_~a~0#1.base| .cse79) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse79 .cse80)))))) (let ((.cse72 (select .cse77 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse73 (select (select (store .cse78 |c_ULTIMATE.start_main_~a~0#1.base| .cse77) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse74 (mod .cse72 (+ .cse73 1)))) (or (not (< .cse72 0)) (forall ((v_ArrVal_674 Int)) (or (not (<= (+ .cse73 .cse74 1) v_ArrVal_674)) (forall ((|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_ArrVal_677 Int)) (let ((.cse75 (store (let ((.cse76 (store .cse77 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_674))) (store .cse76 .cse3 (mod (select .cse77 .cse3) (+ (select (select (store .cse78 |c_ULTIMATE.start_main_~a~0#1.base| .cse76) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_677))) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) c_~N~0) (< 0 (select .cse75 |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (< |v_ULTIMATE.start_main_~i~0#1_392| c_~N~0)) (= (select .cse75 .cse3) 0)))))) (not (< v_subst_3 c_~N~0)) (= .cse74 0) (< (+ v_subst_3 1) c_~N~0)))))))) (< (+ v_subst_5 1) c_~N~0) (not (< v_subst_5 c_~N~0)))) (forall ((v_subst_4 Int)) (or (< (+ v_subst_4 1) c_~N~0) (forall ((v_subst_1 Int)) (or (not (< v_subst_1 c_~N~0)) (forall ((v_ArrVal_674 Int)) (let ((.cse92 (select .cse71 (+ (* 8 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse85 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse40 .cse68 .cse92 .cse56))))) (let ((.cse84 (let ((.cse88 (let ((.cse91 (select .cse85 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse90 (store .cse91 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse40 .cse68 .cse92 (select .cse91 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse56)))) (store .cse90 .cse3 (+ (select .cse91 .cse3) (select (select (store .cse85 |c_ULTIMATE.start_main_~a~0#1.base| .cse90) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (.cse89 (+ (* 8 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse88 .cse89 (+ (select (select (store .cse85 |c_ULTIMATE.start_main_~a~0#1.base| .cse88) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse88 .cse89)))))) (or (not (<= (mod (select .cse84 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store .cse85 |c_ULTIMATE.start_main_~a~0#1.base| .cse84) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) v_ArrVal_674)) (forall ((|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_ArrVal_677 Int)) (let ((.cse86 (store (let ((.cse87 (store .cse84 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_674))) (store .cse87 .cse3 (mod (select .cse84 .cse3) (+ (select (select (store .cse85 |c_ULTIMATE.start_main_~a~0#1.base| .cse87) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_677))) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) c_~N~0) (not (< |v_ULTIMATE.start_main_~i~0#1_392| c_~N~0)) (= (select .cse86 .cse3) 0) (< 0 (select .cse86 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))))) (< (+ v_subst_1 1) c_~N~0))) (not (< v_subst_4 c_~N~0))))))))))) is different from true [2022-11-03 04:15:20,986 WARN L234 SmtUtils]: Spent 42.98s on a formula simplification. DAG size of input: 177 DAG size of output: 91 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 04:15:22,998 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse21 (not (< 1 c_~N~0))) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (and (or (and (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0) (not (< |ULTIMATE.start_main_~i~0#1| c_~N~0)) (forall ((v_ArrVal_674 Int)) (let ((.cse3 (let ((.cse5 (+ (* |ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse4 .cse5 (+ .cse6 (select .cse4 .cse5)))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_ArrVal_677 Int)) (let ((.cse0 (store (let ((.cse2 (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_674))) (store .cse2 .cse1 (mod (select .cse3 .cse1) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_677))) (or (= (select .cse0 .cse1) 0) (< (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) c_~N~0) (< 0 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (< |v_ULTIMATE.start_main_~i~0#1_392| c_~N~0))))) (not (<= (mod (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) v_ArrVal_674))))))) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (let ((.cse10 (let ((.cse13 (+ (* |ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse4 .cse13 (+ .cse6 (select .cse4 .cse13)))))) (let ((.cse12 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse11 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse10) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse7 (mod .cse12 (+ .cse11 1)))) (or (= .cse7 0) (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0) (not (< |ULTIMATE.start_main_~i~0#1| c_~N~0)) (forall ((v_ArrVal_674 Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_ArrVal_677 Int)) (let ((.cse8 (store (let ((.cse9 (store .cse10 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_674))) (store .cse9 .cse1 (mod (select .cse10 .cse1) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse9) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_677))) (or (= (select .cse8 .cse1) 0) (< (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) c_~N~0) (< 0 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (< |v_ULTIMATE.start_main_~i~0#1_392| c_~N~0))))) (not (<= (+ .cse7 .cse11 1) v_ArrVal_674)))) (not (< .cse12 0))))))) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (let ((.cse17 (let ((.cse20 (+ (* |ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse4 .cse20 (+ .cse6 (select .cse4 .cse20)))))) (let ((.cse19 (select .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse18 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse17) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse14 (mod .cse19 (+ .cse18 1)))) (or (= .cse14 0) (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0) (not (< |ULTIMATE.start_main_~i~0#1| c_~N~0)) (forall ((v_ArrVal_674 Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_ArrVal_677 Int)) (let ((.cse15 (store (let ((.cse16 (store .cse17 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_674))) (store .cse16 .cse1 (mod (select .cse17 .cse1) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse16) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_677))) (or (= (select .cse15 .cse1) 0) (< (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) c_~N~0) (< 0 (select .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (< |v_ULTIMATE.start_main_~i~0#1_392| c_~N~0))))) (not (<= .cse14 (+ v_ArrVal_674 .cse18 1))))) (not (< .cse19 0)))))))) .cse21) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (or (let ((.cse28 (let ((.cse42 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse4 .cse42 (+ .cse6 (select .cse4 .cse42)))))) (let ((.cse30 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse28) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (and (forall ((v_subst_3 Int)) (let ((.cse26 (let ((.cse29 (+ (* 8 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse28 .cse29 (+ .cse30 (select .cse28 .cse29)))))) (let ((.cse22 (select .cse26 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse27 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse26) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse23 (mod .cse22 (+ .cse27 1)))) (or (not (< .cse22 0)) (= .cse23 0) (not (< v_subst_3 c_~N~0)) (forall ((v_ArrVal_674 Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_ArrVal_677 Int)) (let ((.cse24 (store (let ((.cse25 (store .cse26 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_674))) (store .cse25 .cse1 (mod (select .cse26 .cse1) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse25) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_677))) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) c_~N~0) (< 0 (select .cse24 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select .cse24 .cse1) 0) (not (< |v_ULTIMATE.start_main_~i~0#1_392| c_~N~0))))) (not (<= (+ .cse27 .cse23 1) v_ArrVal_674)))) (< (+ v_subst_3 1) c_~N~0)))))) (forall ((v_subst_2 Int)) (let ((.cse36 (let ((.cse37 (+ (* 8 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse28 .cse37 (+ (select .cse28 .cse37) .cse30))))) (let ((.cse32 (select .cse36 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse33 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse36) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse31 (mod .cse32 (+ .cse33 1)))) (or (< (+ v_subst_2 1) c_~N~0) (not (< v_subst_2 c_~N~0)) (= .cse31 0) (not (< .cse32 0)) (forall ((v_ArrVal_674 Int)) (or (not (<= .cse31 (+ v_ArrVal_674 .cse33 1))) (forall ((|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_ArrVal_677 Int)) (let ((.cse34 (store (let ((.cse35 (store .cse36 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_674))) (store .cse35 .cse1 (mod (select .cse36 .cse1) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse35) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_677))) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) c_~N~0) (= (select .cse34 .cse1) 0) (not (< |v_ULTIMATE.start_main_~i~0#1_392| c_~N~0)) (< 0 (select .cse34 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))))))) (forall ((v_subst_1 Int)) (or (not (< v_subst_1 c_~N~0)) (< (+ v_subst_1 1) c_~N~0) (forall ((v_ArrVal_674 Int)) (let ((.cse40 (let ((.cse41 (+ (* 8 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse28 .cse41 (+ .cse30 (select .cse28 .cse41)))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_ArrVal_677 Int)) (let ((.cse38 (store (let ((.cse39 (store .cse40 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_674))) (store .cse39 .cse1 (mod (select .cse40 .cse1) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse39) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_677))) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) c_~N~0) (< 0 (select .cse38 |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (< |v_ULTIMATE.start_main_~i~0#1_392| c_~N~0)) (= (select .cse38 .cse1) 0)))) (not (<= (mod (select .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse40) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) v_ArrVal_674)))))))))) .cse21) (<= 3 c_~N~0) (let ((.cse47 (select .cse4 .cse1))) (let ((.cse45 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse44 (+ .cse6 4)) (.cse43 (= .cse47 4)) (.cse46 (exists ((|v_ULTIMATE.start_main_~i~0#1_378| Int)) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_378| 1)) (< |v_ULTIMATE.start_main_~i~0#1_378| c_~N~0) (= (select .cse4 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_378|) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))))) (or (and .cse43 (= .cse44 .cse45) .cse46 (<= |c_ULTIMATE.start_main_~i~0#1| 1)) (and (= 4 .cse45) (or (and (= .cse47 .cse44) (<= |c_ULTIMATE.start_main_~i~0#1| 2) .cse46) (and .cse43 (or (and (<= |c_ULTIMATE.start_main_~i~0#1| 0) .cse46) (exists ((|v_ULTIMATE.start_main_~i~0#1_382| Int)) (let ((.cse48 (+ |v_ULTIMATE.start_main_~i~0#1_382| 1))) (and (<= c_~N~0 .cse48) (< |v_ULTIMATE.start_main_~i~0#1_382| c_~N~0) (= (select .cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_382|))) (+ .cse6 1)) (<= |c_ULTIMATE.start_main_~i~0#1| .cse48)))) (exists ((|v_ULTIMATE.start_main_~i~0#1_378| Int)) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_378| 1)) (< |v_ULTIMATE.start_main_~i~0#1_378| c_~N~0) (= (select .cse4 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_378|) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (<= |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_378|) (<= 3 |v_ULTIMATE.start_main_~i~0#1_378|)))))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse6 3))) is different from false [2022-11-03 04:15:40,770 WARN L234 SmtUtils]: Spent 13.43s on a formula simplification. DAG size of input: 145 DAG size of output: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 04:15:40,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:15:40,799 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2022-11-03 04:15:40,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-03 04:15:40,800 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 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 24 [2022-11-03 04:15:40,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:15:40,800 INFO L225 Difference]: With dead ends: 55 [2022-11-03 04:15:40,801 INFO L226 Difference]: Without dead ends: 53 [2022-11-03 04:15:40,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 8 IntricatePredicates, 3 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 442.9s TimeCoverageRelationStatistics Valid=308, Invalid=1795, Unknown=91, NotChecked=776, Total=2970 [2022-11-03 04:15:40,802 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 3 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:15:40,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 27 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 127 Unchecked, 0.1s Time] [2022-11-03 04:15:40,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-03 04:15:40,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2022-11-03 04:15:40,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 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-03 04:15:40,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2022-11-03 04:15:40,831 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 24 [2022-11-03 04:15:40,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:15:40,831 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2022-11-03 04:15:40,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 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-03 04:15:40,832 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2022-11-03 04:15:40,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 04:15:40,832 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:15:40,832 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:15:40,838 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-03 04:15:41,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-03 04:15:41,035 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:15:41,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:15:41,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1421873003, now seen corresponding path program 10 times [2022-11-03 04:15:41,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:15:41,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301229959] [2022-11-03 04:15:41,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:15:41,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:15:41,064 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 04:15:41,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1200857939] [2022-11-03 04:15:41,064 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 04:15:41,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:15:41,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:15:41,065 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:15:41,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fc065b-1bf7-49d9-a793-16ba81b67a44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-03 04:15:41,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:15:41,206 WARN L261 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 107 conjunts are in the unsatisfiable core [2022-11-03 04:15:41,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:15:41,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-03 04:15:41,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:15:41,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-03 04:15:41,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:15:41,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2022-11-03 04:15:41,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:15:41,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:15:41,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 48 [2022-11-03 04:15:41,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:15:41,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:15:41,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:15:41,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-03 04:15:41,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:15:41,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:15:41,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:15:41,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 59 [2022-11-03 04:15:41,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:15:41,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:15:41,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:15:41,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:15:41,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:15:41,616 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:15:41,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 62 [2022-11-03 04:15:41,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:15:41,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:15:41,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:15:41,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:15:41,712 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:15:41,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:15:41,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:15:41,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 69 [2022-11-03 04:15:41,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:15:41,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:15:41,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:15:41,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 64 [2022-11-03 04:15:41,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:15:41,957 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:15:41,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:15:41,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:15:41,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 67 [2022-11-03 04:15:42,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:15:42,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:15:42,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:15:42,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:15:42,061 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:15:42,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 69 [2022-11-03 04:15:42,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:15:42,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:15:42,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 47 [2022-11-03 04:15:42,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:15:42,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:15:42,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 49 [2022-11-03 04:15:42,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:15:42,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:15:42,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 75 [2022-11-03 04:15:42,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:15:42,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:15:42,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:15:42,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 58 [2022-11-03 04:15:42,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:15:42,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:15:42,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:15:42,674 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:15:42,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 48 [2022-11-03 04:15:42,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:15:42,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2022-11-03 04:15:42,979 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:15:42,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:16:07,156 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_780 Int)) (= (let ((.cse13 (* 8 |c_ULTIMATE.start_main_~i~0#1|)) (.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse11 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse13 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse10 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse13 16 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse9 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8 .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse13 |c_ULTIMATE.start_main_~a~0#1.offset| 24)))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8 .cse9 .cse10 .cse11))))) (let ((.cse4 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse0 (+ .cse7 .cse8 .cse9 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse10 .cse11))) (mod .cse0 (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 24)) (.cse2 (let ((.cse5 (store (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| .cse0) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_780)) (.cse6 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse5 .cse6 (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| .cse5) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse4 .cse6)))))) (store .cse2 .cse3 (+ (select .cse4 .cse3) (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))))))))) 0)) is different from false [2022-11-03 04:17:16,721 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 34 refuted. 2 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-03 04:17:16,721 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:17:16,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301229959] [2022-11-03 04:17:16,721 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 04:17:16,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200857939] [2022-11-03 04:17:16,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200857939] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:17:16,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [122338179] [2022-11-03 04:17:16,723 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-03 04:17:16,723 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 04:17:16,723 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 04:17:16,723 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 04:17:16,723 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 04:17:16,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:17:16,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:17:16,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:17:16,846 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 04:17:16,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-03 04:17:16,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:17:16,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 25 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 98 [2022-11-03 04:17:16,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:17:16,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:17:16,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 39 [2022-11-03 04:17:16,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:17:16,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:17:16,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 30 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 113 [2022-11-03 04:17:17,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:17:17,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:17:17,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:17:17,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:17:17,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:17:17,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:17:17,032 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:17:17,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:17:17,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:17:17,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:17:17,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:17:17,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:17:17,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:17:17,134 INFO L356 Elim1Store]: treesize reduction 166, result has 11.7 percent of original size [2022-11-03 04:17:17,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 34 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 22 case distinctions, treesize of input 434 treesize of output 423 [2022-11-03 04:17:17,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-03 04:17:17,255 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:17:17,303 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 04:17:17,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-03 04:17:17,428 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 04:17:17,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 54 [2022-11-03 04:17:17,471 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:17:17,519 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 04:17:17,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-03 04:17:17,618 INFO L356 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-03 04:17:17,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 54 [2022-11-03 04:17:17,719 INFO L356 Elim1Store]: treesize reduction 53, result has 27.4 percent of original size [2022-11-03 04:17:17,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 68 [2022-11-03 04:17:17,868 INFO L356 Elim1Store]: treesize reduction 63, result has 38.8 percent of original size [2022-11-03 04:17:17,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 93 [2022-11-03 04:17:17,911 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 04:17:21,238 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3694#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= |ULTIMATE.start_main_#t~mem17#1| 0) 1 0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8))) |ULTIMATE.start_main_#t~mem17#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-03 04:17:21,238 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 04:17:21,238 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 04:17:21,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 45 [2022-11-03 04:17:21,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389422026] [2022-11-03 04:17:21,239 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 04:17:21,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-03 04:17:21,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:17:21,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-03 04:17:21,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=2087, Unknown=10, NotChecked=94, Total=2450 [2022-11-03 04:17:21,241 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 45 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 45 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)