./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/condg.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/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_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/array-fpi/condg.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/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_0dd2335c-c2c5-427d-95ba-c5948f789130/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 2909e53e12aac54327f6ce090ad489c978c1fbcfb0ae8bd4172abe8a99b2cb53 --- 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 03:56:32,625 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 03:56:32,627 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 03:56:32,672 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 03:56:32,672 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 03:56:32,676 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 03:56:32,679 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 03:56:32,683 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 03:56:32,686 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 03:56:32,691 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 03:56:32,693 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 03:56:32,695 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 03:56:32,696 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 03:56:32,699 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 03:56:32,700 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 03:56:32,705 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 03:56:32,707 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 03:56:32,708 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 03:56:32,710 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 03:56:32,718 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 03:56:32,720 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 03:56:32,721 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 03:56:32,725 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 03:56:32,726 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 03:56:32,737 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 03:56:32,738 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 03:56:32,738 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 03:56:32,739 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 03:56:32,741 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 03:56:32,742 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 03:56:32,742 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 03:56:32,744 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 03:56:32,747 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 03:56:32,748 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 03:56:32,749 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 03:56:32,749 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 03:56:32,749 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 03:56:32,750 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 03:56:32,750 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 03:56:32,751 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 03:56:32,751 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 03:56:32,752 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 03:56:32,796 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 03:56:32,796 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 03:56:32,797 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 03:56:32,797 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 03:56:32,798 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 03:56:32,798 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 03:56:32,798 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 03:56:32,799 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 03:56:32,799 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 03:56:32,799 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 03:56:32,800 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 03:56:32,800 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 03:56:32,801 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 03:56:32,801 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 03:56:32,801 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 03:56:32,801 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 03:56:32,802 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 03:56:32,802 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 03:56:32,802 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 03:56:32,803 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 03:56:32,803 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 03:56:32,803 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 03:56:32,803 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 03:56:32,804 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 03:56:32,804 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 03:56:32,804 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 03:56:32,806 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 03:56:32,806 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 03:56:32,806 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 03:56:32,806 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 03:56:32,806 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 03:56:32,807 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 03:56:32,807 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:56:32,807 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 03:56:32,808 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 03:56:32,808 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 03:56:32,808 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 03:56:32,808 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 03:56:32,808 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 03:56:32,809 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 03:56:32,809 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 03:56:32,809 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_0dd2335c-c2c5-427d-95ba-c5948f789130/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_0dd2335c-c2c5-427d-95ba-c5948f789130/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 -> 2909e53e12aac54327f6ce090ad489c978c1fbcfb0ae8bd4172abe8a99b2cb53 [2022-11-03 03:56:33,082 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 03:56:33,103 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 03:56:33,106 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 03:56:33,119 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 03:56:33,120 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 03:56:33,121 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/array-fpi/condg.c [2022-11-03 03:56:33,187 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/data/57cc8e857/f7a8a032bc984401987dfbf3346b811d/FLAG27b452155 [2022-11-03 03:56:33,756 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 03:56:33,757 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/sv-benchmarks/c/array-fpi/condg.c [2022-11-03 03:56:33,773 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/data/57cc8e857/f7a8a032bc984401987dfbf3346b811d/FLAG27b452155 [2022-11-03 03:56:34,096 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/data/57cc8e857/f7a8a032bc984401987dfbf3346b811d [2022-11-03 03:56:34,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 03:56:34,100 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 03:56:34,103 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 03:56:34,104 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 03:56:34,107 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 03:56:34,108 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:56:34" (1/1) ... [2022-11-03 03:56:34,109 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73466f53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:56:34, skipping insertion in model container [2022-11-03 03:56:34,110 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:56:34" (1/1) ... [2022-11-03 03:56:34,117 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 03:56:34,131 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 03:56:34,294 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_0dd2335c-c2c5-427d-95ba-c5948f789130/sv-benchmarks/c/array-fpi/condg.c[588,601] [2022-11-03 03:56:34,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:56:34,344 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 03:56:34,354 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_0dd2335c-c2c5-427d-95ba-c5948f789130/sv-benchmarks/c/array-fpi/condg.c[588,601] [2022-11-03 03:56:34,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:56:34,374 INFO L208 MainTranslator]: Completed translation [2022-11-03 03:56:34,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:56:34 WrapperNode [2022-11-03 03:56:34,374 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 03:56:34,375 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 03:56:34,375 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 03:56:34,375 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 03:56:34,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:56:34" (1/1) ... [2022-11-03 03:56:34,390 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:56:34" (1/1) ... [2022-11-03 03:56:34,409 INFO L138 Inliner]: procedures = 17, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89 [2022-11-03 03:56:34,410 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 03:56:34,410 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 03:56:34,410 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 03:56:34,411 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 03:56:34,419 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:56:34" (1/1) ... [2022-11-03 03:56:34,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:56:34" (1/1) ... [2022-11-03 03:56:34,422 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:56:34" (1/1) ... [2022-11-03 03:56:34,422 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:56:34" (1/1) ... [2022-11-03 03:56:34,428 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:56:34" (1/1) ... [2022-11-03 03:56:34,432 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:56:34" (1/1) ... [2022-11-03 03:56:34,434 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:56:34" (1/1) ... [2022-11-03 03:56:34,435 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:56:34" (1/1) ... [2022-11-03 03:56:34,436 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 03:56:34,437 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 03:56:34,438 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 03:56:34,438 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 03:56:34,439 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:56:34" (1/1) ... [2022-11-03 03:56:34,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:56:34,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:56:34,489 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 03:56:34,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 03:56:34,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 03:56:34,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 03:56:34,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 03:56:34,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 03:56:34,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 03:56:34,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 03:56:34,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 03:56:34,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 03:56:34,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 03:56:34,636 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 03:56:34,638 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 03:56:34,971 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 03:56:35,073 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 03:56:35,073 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-03 03:56:35,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:56:35 BoogieIcfgContainer [2022-11-03 03:56:35,076 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 03:56:35,079 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 03:56:35,079 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 03:56:35,091 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 03:56:35,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 03:56:34" (1/3) ... [2022-11-03 03:56:35,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dc950d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:56:35, skipping insertion in model container [2022-11-03 03:56:35,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:56:34" (2/3) ... [2022-11-03 03:56:35,093 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dc950d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:56:35, skipping insertion in model container [2022-11-03 03:56:35,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:56:35" (3/3) ... [2022-11-03 03:56:35,095 INFO L112 eAbstractionObserver]: Analyzing ICFG condg.c [2022-11-03 03:56:35,118 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 03:56:35,118 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 03:56:35,203 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 03:56:35,215 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;@8c91d43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 03:56:35,215 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 03:56:35,224 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 11 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 03:56:35,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 03:56:35,231 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:56:35,233 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:56:35,234 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:56:35,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:56:35,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1910084069, now seen corresponding path program 1 times [2022-11-03 03:56:35,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:56:35,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117871010] [2022-11-03 03:56:35,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:56:35,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:56:35,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:56:35,630 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 03:56:35,631 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:56:35,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117871010] [2022-11-03 03:56:35,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117871010] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:56:35,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:56:35,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:56:35,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039616921] [2022-11-03 03:56:35,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:56:35,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:56:35,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:56:35,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:56:35,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:56:35,685 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 11 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) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 03:56:35,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:56:35,796 INFO L93 Difference]: Finished difference Result 22 states and 31 transitions. [2022-11-03 03:56:35,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:56:35,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-03 03:56:35,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:56:35,808 INFO L225 Difference]: With dead ends: 22 [2022-11-03 03:56:35,809 INFO L226 Difference]: Without dead ends: 11 [2022-11-03 03:56:35,811 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 03:56:35,817 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:56:35,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:56:35,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-11-03 03:56:35,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-11-03 03:56:35,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 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 03:56:35,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2022-11-03 03:56:35,848 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 8 [2022-11-03 03:56:35,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:56:35,849 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 14 transitions. [2022-11-03 03:56:35,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 03:56:35,850 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2022-11-03 03:56:35,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 03:56:35,850 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:56:35,850 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:56:35,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 03:56:35,851 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:56:35,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:56:35,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1202687252, now seen corresponding path program 1 times [2022-11-03 03:56:35,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:56:35,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392531211] [2022-11-03 03:56:35,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:56:35,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:56:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:56:35,970 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 03:56:35,975 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:56:35,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392531211] [2022-11-03 03:56:35,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392531211] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:56:35,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:56:35,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:56:35,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132474603] [2022-11-03 03:56:35,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:56:35,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:56:35,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:56:35,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:56:35,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:56:35,980 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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 03:56:36,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:56:36,034 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2022-11-03 03:56:36,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:56:36,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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 03:56:36,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:56:36,036 INFO L225 Difference]: With dead ends: 24 [2022-11-03 03:56:36,036 INFO L226 Difference]: Without dead ends: 18 [2022-11-03 03:56:36,038 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 03:56:36,041 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 03:56:36,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 6 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 03:56:36,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-11-03 03:56:36,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 13. [2022-11-03 03:56:36,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 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 03:56:36,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2022-11-03 03:56:36,055 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 9 [2022-11-03 03:56:36,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:56:36,056 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 16 transitions. [2022-11-03 03:56:36,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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 03:56:36,058 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2022-11-03 03:56:36,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 03:56:36,059 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:56:36,059 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:56:36,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 03:56:36,061 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:56:36,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:56:36,066 INFO L85 PathProgramCache]: Analyzing trace with hash 867584416, now seen corresponding path program 1 times [2022-11-03 03:56:36,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:56:36,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281078067] [2022-11-03 03:56:36,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:56:36,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:56:36,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:56:37,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:56:37,354 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:56:37,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281078067] [2022-11-03 03:56:37,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281078067] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:56:37,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082038519] [2022-11-03 03:56:37,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:56:37,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:56:37,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:56:37,362 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:56:37,371 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 03:56:37,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:56:37,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-03 03:56:37,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:56:37,521 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 03:56:37,531 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 03:56:37,562 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 03:56:37,634 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:56:37,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-03 03:56:37,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 88 [2022-11-03 03:56:37,810 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:56:37,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 20 [2022-11-03 03:56:37,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:37,981 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 45 treesize of output 25 [2022-11-03 03:56:38,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:56:38,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:56:38,168 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 5 treesize of output 3 [2022-11-03 03:56:38,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:56:38,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082038519] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:56:38,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1444699362] [2022-11-03 03:56:38,455 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-11-03 03:56:38,456 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:56:38,461 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 03:56:38,466 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 03:56:38,467 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 03:56:38,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:38,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:38,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:38,639 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 03:56:38,640 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 03:56:38,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:38,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:38,700 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 03:56:38,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:38,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-03 03:56:38,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:38,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:38,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-03 03:56:38,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:38,954 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:56:38,955 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:56:39,019 INFO L356 Elim1Store]: treesize reduction 106, result has 20.9 percent of original size [2022-11-03 03:56:39,021 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 331 treesize of output 333 [2022-11-03 03:56:39,241 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 03:56:39,286 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 03:56:39,287 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 03:56:39,384 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 03:56:39,387 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 03:56:39,450 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:56:39,471 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 03:56:39,471 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 33 [2022-11-03 03:56:39,492 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:56:39,504 INFO L356 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2022-11-03 03:56:39,507 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 25 treesize of output 17 [2022-11-03 03:56:39,587 INFO L356 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-03 03:56:39,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 36 treesize of output 58 [2022-11-03 03:56:39,626 INFO L356 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2022-11-03 03:56:39,627 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 35 treesize of output 33 [2022-11-03 03:56:39,656 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 03:56:40,157 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '206#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~mem15#1|) (= |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_assume_abort_if_not_~cond#1|) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= |ULTIMATE.start_main_#t~mem15#1| 0) 1 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 03:56:40,157 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 03:56:40,157 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:56:40,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2022-11-03 03:56:40,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620003088] [2022-11-03 03:56:40,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:56:40,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-03 03:56:40,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:56:40,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-03 03:56:40,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=608, Unknown=3, NotChecked=0, Total=702 [2022-11-03 03:56:40,160 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:56:40,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:56:40,379 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2022-11-03 03:56:40,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 03:56:40,380 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 03:56:40,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:56:40,381 INFO L225 Difference]: With dead ends: 27 [2022-11-03 03:56:40,381 INFO L226 Difference]: Without dead ends: 25 [2022-11-03 03:56:40,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 10 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=97, Invalid=656, Unknown=3, NotChecked=0, Total=756 [2022-11-03 03:56:40,382 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 7 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:56:40,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 25 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 132 Invalid, 0 Unknown, 13 Unchecked, 0.2s Time] [2022-11-03 03:56:40,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-03 03:56:40,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2022-11-03 03:56:40,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 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 03:56:40,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2022-11-03 03:56:40,390 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 28 transitions. Word has length 11 [2022-11-03 03:56:40,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:56:40,391 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 28 transitions. [2022-11-03 03:56:40,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:56:40,391 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2022-11-03 03:56:40,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 03:56:40,392 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:56:40,392 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:56:40,431 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 03:56:40,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:56:40,593 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:56:40,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:56:40,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1750679399, now seen corresponding path program 2 times [2022-11-03 03:56:40,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:56:40,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888849793] [2022-11-03 03:56:40,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:56:40,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:56:40,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:56:40,671 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:56:40,671 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:56:40,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888849793] [2022-11-03 03:56:40,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888849793] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:56:40,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277853934] [2022-11-03 03:56:40,677 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:56:40,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:56:40,678 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:56:40,679 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:56:40,704 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 03:56:40,759 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 03:56:40,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:56:40,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 03:56:40,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:56:40,800 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:56:40,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:56:40,833 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:56:40,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277853934] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:56:40,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [49342523] [2022-11-03 03:56:40,842 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-11-03 03:56:40,842 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:56:40,843 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 03:56:40,843 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 03:56:40,843 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 03:56:40,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:40,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-03 03:56:40,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:40,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:40,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:40,971 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 03:56:40,972 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 03:56:40,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:41,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:41,007 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 03:56:41,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:41,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:41,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 43 [2022-11-03 03:56:41,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:41,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:56:41,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:41,242 INFO L356 Elim1Store]: treesize reduction 110, result has 12.0 percent of original size [2022-11-03 03:56:41,243 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 7 case distinctions, treesize of input 336 treesize of output 332 [2022-11-03 03:56:41,337 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 03:56:41,359 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:56:41,381 INFO L356 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-03 03:56:41,382 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 03:56:41,465 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 03:56:41,466 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 03:56:41,532 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:56:41,554 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 03:56:41,555 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 35 treesize of output 37 [2022-11-03 03:56:41,566 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:56:41,590 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 03:56:41,591 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 36 treesize of output 38 [2022-11-03 03:56:41,692 INFO L356 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-03 03:56:41,693 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 36 treesize of output 58 [2022-11-03 03:56:41,739 INFO L356 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2022-11-03 03:56:41,740 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 35 treesize of output 33 [2022-11-03 03:56:41,793 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 03:56:42,268 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '368#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~mem15#1|) (= |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_assume_abort_if_not_~cond#1|) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= |ULTIMATE.start_main_#t~mem15#1| 0) 1 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 03:56:42,269 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 03:56:42,269 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:56:42,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-11-03 03:56:42,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940406780] [2022-11-03 03:56:42,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:56:42,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 03:56:42,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:56:42,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 03:56:42,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-11-03 03:56:42,270 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 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 03:56:42,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:56:42,381 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2022-11-03 03:56:42,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:56:42,383 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 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) Word has length 12 [2022-11-03 03:56:42,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:56:42,384 INFO L225 Difference]: With dead ends: 51 [2022-11-03 03:56:42,384 INFO L226 Difference]: Without dead ends: 32 [2022-11-03 03:56:42,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 8 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-11-03 03:56:42,385 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 16 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:56:42,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 24 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:56:42,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-03 03:56:42,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 20. [2022-11-03 03:56:42,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:56:42,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2022-11-03 03:56:42,391 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 12 [2022-11-03 03:56:42,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:56:42,391 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-11-03 03:56:42,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 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 03:56:42,392 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-11-03 03:56:42,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 03:56:42,392 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:56:42,392 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:56:42,430 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-03 03:56:42,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:56:42,593 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:56:42,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:56:42,594 INFO L85 PathProgramCache]: Analyzing trace with hash -2081436655, now seen corresponding path program 3 times [2022-11-03 03:56:42,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:56:42,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188170390] [2022-11-03 03:56:42,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:56:42,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:56:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:56:42,674 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:56:42,674 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:56:42,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188170390] [2022-11-03 03:56:42,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188170390] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:56:42,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183659215] [2022-11-03 03:56:42,675 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:56:42,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:56:42,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:56:42,676 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:56:42,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 03:56:42,749 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:56:42,749 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:56:42,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 03:56:42,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:56:42,793 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:56:42,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:56:42,827 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:56:42,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183659215] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:56:42,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1818002382] [2022-11-03 03:56:42,830 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-11-03 03:56:42,830 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:56:42,830 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 03:56:42,830 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 03:56:42,831 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 03:56:42,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:42,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:42,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:42,929 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 03:56:42,929 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 03:56:42,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:42,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-03 03:56:42,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:42,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:42,964 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 03:56:42,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:42,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:42,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-03 03:56:43,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:43,107 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:56:43,108 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:56:43,155 INFO L356 Elim1Store]: treesize reduction 106, result has 20.9 percent of original size [2022-11-03 03:56:43,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 331 treesize of output 333 [2022-11-03 03:56:43,271 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 03:56:43,306 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 03:56:43,306 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 03:56:43,379 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 03:56:43,379 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 03:56:43,439 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:56:43,458 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 03:56:43,459 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 36 treesize of output 38 [2022-11-03 03:56:43,477 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:56:43,489 INFO L356 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2022-11-03 03:56:43,489 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 35 treesize of output 22 [2022-11-03 03:56:43,575 INFO L356 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-03 03:56:43,576 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 36 treesize of output 58 [2022-11-03 03:56:43,614 INFO L356 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2022-11-03 03:56:43,615 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 35 treesize of output 33 [2022-11-03 03:56:43,661 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 03:56:44,107 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '563#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~mem15#1|) (= |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_assume_abort_if_not_~cond#1|) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= |ULTIMATE.start_main_#t~mem15#1| 0) 1 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 03:56:44,107 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 03:56:44,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:56:44,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-03 03:56:44,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513257255] [2022-11-03 03:56:44,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:56:44,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 03:56:44,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:56:44,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 03:56:44,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-11-03 03:56:44,109 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 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 03:56:44,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:56:44,258 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-11-03 03:56:44,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 03:56:44,258 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 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) Word has length 12 [2022-11-03 03:56:44,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:56:44,259 INFO L225 Difference]: With dead ends: 32 [2022-11-03 03:56:44,259 INFO L226 Difference]: Without dead ends: 26 [2022-11-03 03:56:44,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2022-11-03 03:56:44,260 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 35 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:56:44,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 21 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:56:44,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-03 03:56:44,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 16. [2022-11-03 03:56:44,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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 03:56:44,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-11-03 03:56:44,265 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 12 [2022-11-03 03:56:44,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:56:44,265 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-11-03 03:56:44,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 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 03:56:44,265 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-11-03 03:56:44,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 03:56:44,266 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:56:44,266 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:56:44,305 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 03:56:44,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:56:44,477 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:56:44,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:56:44,478 INFO L85 PathProgramCache]: Analyzing trace with hash -900606331, now seen corresponding path program 4 times [2022-11-03 03:56:44,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:56:44,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721478560] [2022-11-03 03:56:44,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:56:44,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:56:44,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:56:45,866 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:56:45,866 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:56:45,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721478560] [2022-11-03 03:56:45,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721478560] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:56:45,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796831059] [2022-11-03 03:56:45,867 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:56:45,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:56:45,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:56:45,871 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:56:45,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 03:56:45,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:56:45,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 55 conjunts are in the unsatisfiable core [2022-11-03 03:56:45,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:56:45,964 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 03:56:45,969 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 03:56:45,989 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 03:56:46,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:46,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 03:56:46,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:46,171 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 47 treesize of output 37 [2022-11-03 03:56:46,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:46,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:46,246 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:56:46,248 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 49 treesize of output 35 [2022-11-03 03:56:46,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 79 [2022-11-03 03:56:46,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:46,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 25 treesize of output 25 [2022-11-03 03:56:46,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-03 03:56:46,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 79 [2022-11-03 03:56:46,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:46,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:46,549 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-03 03:56:46,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 40 [2022-11-03 03:56:46,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-03 03:56:46,698 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:56:46,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:56:46,814 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 5 treesize of output 3 [2022-11-03 03:56:46,920 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 22 treesize of output 20 [2022-11-03 03:56:48,955 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse1 .cse2 (+ (- 1) (select .cse1 .cse2)))))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_129| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_129|)) (forall ((v_ArrVal_187 Int)) (= (select (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_129| 4)) v_ArrVal_187) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) is different from false [2022-11-03 03:56:50,231 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 03:56:50,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796831059] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:56:50,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1518564300] [2022-11-03 03:56:50,234 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-11-03 03:56:50,234 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:56:50,235 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 03:56:50,235 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 03:56:50,235 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 03:56:50,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:50,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:50,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:50,334 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 03:56:50,334 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 03:56:50,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:50,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:50,357 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 03:56:50,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:50,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-03 03:56:50,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:50,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:50,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 43 [2022-11-03 03:56:50,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:50,509 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:56:50,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:50,547 INFO L356 Elim1Store]: treesize reduction 110, result has 12.0 percent of original size [2022-11-03 03:56:50,548 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 7 case distinctions, treesize of input 336 treesize of output 332 [2022-11-03 03:56:50,619 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 03:56:50,652 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 03:56:50,652 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 03:56:50,717 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 03:56:50,717 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 03:56:50,764 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:56:50,792 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 03:56:50,792 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 33 [2022-11-03 03:56:50,806 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:56:50,818 INFO L356 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2022-11-03 03:56:50,818 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 25 treesize of output 17 [2022-11-03 03:56:50,889 INFO L356 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-03 03:56:50,890 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 36 treesize of output 58 [2022-11-03 03:56:50,928 INFO L356 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2022-11-03 03:56:50,928 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 35 treesize of output 33 [2022-11-03 03:56:50,977 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 03:56:51,916 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '758#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~mem15#1|) (= |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_assume_abort_if_not_~cond#1|) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= |ULTIMATE.start_main_#t~mem15#1| 0) 1 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 03:56:51,916 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 03:56:51,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:56:51,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 31 [2022-11-03 03:56:51,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311666786] [2022-11-03 03:56:51,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:56:51,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 03:56:51,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:56:51,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 03:56:51,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1069, Unknown=1, NotChecked=66, Total=1260 [2022-11-03 03:56:51,918 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 31 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:56:52,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:56:52,164 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2022-11-03 03:56:52,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-03 03:56:52,164 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-03 03:56:52,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:56:52,165 INFO L225 Difference]: With dead ends: 32 [2022-11-03 03:56:52,165 INFO L226 Difference]: Without dead ends: 30 [2022-11-03 03:56:52,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 10 SyntacticMatches, 10 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=132, Invalid=1131, Unknown=1, NotChecked=68, Total=1332 [2022-11-03 03:56:52,166 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 8 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:56:52,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 31 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 98 Invalid, 0 Unknown, 118 Unchecked, 0.1s Time] [2022-11-03 03:56:52,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-03 03:56:52,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2022-11-03 03:56:52,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 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 03:56:52,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2022-11-03 03:56:52,178 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 14 [2022-11-03 03:56:52,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:56:52,178 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-11-03 03:56:52,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:56:52,178 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2022-11-03 03:56:52,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 03:56:52,179 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:56:52,180 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:56:52,220 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 03:56:52,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-03 03:56:52,394 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:56:52,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:56:52,395 INFO L85 PathProgramCache]: Analyzing trace with hash 245262410, now seen corresponding path program 5 times [2022-11-03 03:56:52,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:56:52,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790606144] [2022-11-03 03:56:52,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:56:52,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:56:52,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:56:52,497 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 03:56:52,497 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:56:52,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790606144] [2022-11-03 03:56:52,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790606144] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:56:52,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174499666] [2022-11-03 03:56:52,498 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:56:52,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:56:52,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:56:52,499 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:56:52,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 03:56:52,617 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 03:56:52,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:56:52,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 03:56:52,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:56:52,671 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 03:56:52,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:56:52,712 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 03:56:52,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174499666] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:56:52,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1810112810] [2022-11-03 03:56:52,715 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-11-03 03:56:52,716 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:56:52,716 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 03:56:52,716 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 03:56:52,716 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 03:56:52,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:52,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:52,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:52,813 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 03:56:52,813 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 03:56:52,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:52,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-03 03:56:52,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:52,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:52,844 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 03:56:52,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:52,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:52,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 43 [2022-11-03 03:56:52,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:52,991 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:56:52,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:53,028 INFO L356 Elim1Store]: treesize reduction 110, result has 12.0 percent of original size [2022-11-03 03:56:53,028 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 7 case distinctions, treesize of input 336 treesize of output 332 [2022-11-03 03:56:53,099 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 03:56:53,114 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:56:53,134 INFO L356 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-03 03:56:53,134 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 03:56:53,200 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 03:56:53,201 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 03:56:53,245 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:56:53,265 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 03:56:53,265 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 25 treesize of output 32 [2022-11-03 03:56:53,275 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:56:53,296 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 03:56:53,296 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 33 [2022-11-03 03:56:53,385 INFO L356 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-03 03:56:53,385 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 36 treesize of output 58 [2022-11-03 03:56:53,424 INFO L356 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2022-11-03 03:56:53,424 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 35 treesize of output 33 [2022-11-03 03:56:53,465 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 03:56:53,972 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '962#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~mem15#1|) (= |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_assume_abort_if_not_~cond#1|) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= |ULTIMATE.start_main_#t~mem15#1| 0) 1 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 03:56:53,972 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 03:56:53,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:56:53,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2022-11-03 03:56:53,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356954979] [2022-11-03 03:56:53,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:56:53,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 03:56:53,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:56:53,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 03:56:53,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2022-11-03 03:56:53,974 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:56:54,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:56:54,107 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2022-11-03 03:56:54,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 03:56:54,107 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 03:56:54,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:56:54,108 INFO L225 Difference]: With dead ends: 68 [2022-11-03 03:56:54,108 INFO L226 Difference]: Without dead ends: 54 [2022-11-03 03:56:54,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 12 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2022-11-03 03:56:54,109 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 56 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:56:54,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 30 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:56:54,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-03 03:56:54,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 35. [2022-11-03 03:56:54,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 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 03:56:54,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2022-11-03 03:56:54,119 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 15 [2022-11-03 03:56:54,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:56:54,119 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2022-11-03 03:56:54,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:56:54,120 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-11-03 03:56:54,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 03:56:54,120 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:56:54,121 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:56:54,161 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 03:56:54,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:56:54,343 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:56:54,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:56:54,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1631292812, now seen corresponding path program 6 times [2022-11-03 03:56:54,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:56:54,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286241131] [2022-11-03 03:56:54,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:56:54,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:56:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:56:54,460 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 03:56:54,461 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:56:54,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286241131] [2022-11-03 03:56:54,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286241131] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:56:54,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929224276] [2022-11-03 03:56:54,461 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:56:54,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:56:54,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:56:54,467 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:56:54,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 03:56:54,557 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:56:54,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:56:54,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 03:56:54,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:56:54,625 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 03:56:54,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:56:54,676 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 03:56:54,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929224276] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:56:54,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [500698781] [2022-11-03 03:56:54,678 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-11-03 03:56:54,678 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:56:54,679 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 03:56:54,679 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 03:56:54,679 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 03:56:54,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:54,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:54,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:54,768 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 03:56:54,769 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 03:56:54,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:54,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:54,785 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 03:56:54,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:54,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-03 03:56:54,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:54,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:54,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 43 [2022-11-03 03:56:54,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:54,905 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:56:54,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:54,940 INFO L356 Elim1Store]: treesize reduction 110, result has 12.0 percent of original size [2022-11-03 03:56:54,941 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 7 case distinctions, treesize of input 336 treesize of output 332 [2022-11-03 03:56:55,024 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 03:56:55,051 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:56:55,071 INFO L356 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-03 03:56:55,072 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 03:56:55,141 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 03:56:55,142 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 03:56:55,188 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:56:55,207 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 03:56:55,208 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 33 [2022-11-03 03:56:55,222 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:56:55,232 INFO L356 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2022-11-03 03:56:55,233 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 25 treesize of output 17 [2022-11-03 03:56:55,292 INFO L356 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-03 03:56:55,293 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 36 treesize of output 58 [2022-11-03 03:56:55,340 INFO L356 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2022-11-03 03:56:55,340 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 35 treesize of output 33 [2022-11-03 03:56:55,356 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 03:56:55,659 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1233#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~mem15#1|) (= |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_assume_abort_if_not_~cond#1|) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= |ULTIMATE.start_main_#t~mem15#1| 0) 1 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 03:56:55,659 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 03:56:55,659 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:56:55,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-11-03 03:56:55,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904755244] [2022-11-03 03:56:55,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:56:55,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 03:56:55,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:56:55,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 03:56:55,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2022-11-03 03:56:55,661 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:56:55,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:56:55,872 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2022-11-03 03:56:55,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 03:56:55,873 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 03:56:55,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:56:55,873 INFO L225 Difference]: With dead ends: 57 [2022-11-03 03:56:55,874 INFO L226 Difference]: Without dead ends: 47 [2022-11-03 03:56:55,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 9 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=473, Unknown=0, NotChecked=0, Total=600 [2022-11-03 03:56:55,875 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 64 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:56:55,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 51 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:56:55,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-03 03:56:55,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2022-11-03 03:56:55,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 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 03:56:55,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-11-03 03:56:55,883 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 15 [2022-11-03 03:56:55,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:56:55,883 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-11-03 03:56:55,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:56:55,883 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-11-03 03:56:55,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 03:56:55,884 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:56:55,884 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:56:55,912 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 03:56:56,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:56:56,099 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:56:56,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:56:56,099 INFO L85 PathProgramCache]: Analyzing trace with hash 702654167, now seen corresponding path program 1 times [2022-11-03 03:56:56,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:56:56,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858286959] [2022-11-03 03:56:56,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:56:56,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:56:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:56:57,666 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:56:57,666 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:56:57,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858286959] [2022-11-03 03:56:57,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858286959] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:56:57,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544987250] [2022-11-03 03:56:57,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:56:57,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:56:57,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:56:57,671 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:56:57,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 03:56:57,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:56:57,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-03 03:56:57,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:56:57,764 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 03:56:57,769 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 03:56:57,802 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 03:56:57,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:57,840 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 03:56:57,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:57,936 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 03:56:57,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:57,985 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 03:56:58,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:58,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 92 [2022-11-03 03:56:58,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:58,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2022-11-03 03:56:58,175 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 60 treesize of output 47 [2022-11-03 03:56:58,180 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 44 treesize of output 28 [2022-11-03 03:56:58,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:58,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 106 [2022-11-03 03:56:58,353 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 15 treesize of output 11 [2022-11-03 03:56:58,381 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 42 treesize of output 31 [2022-11-03 03:56:58,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:58,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2022-11-03 03:56:58,399 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 9 treesize of output 7 [2022-11-03 03:56:58,909 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:56:58,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:57:00,543 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:57:00,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544987250] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:57:00,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [935027700] [2022-11-03 03:57:00,545 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-03 03:57:00,545 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:57:00,546 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 03:57:00,546 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 03:57:00,546 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 03:57:00,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:00,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-03 03:57:00,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:00,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:00,713 INFO L356 Elim1Store]: treesize reduction 68, result has 33.3 percent of original size [2022-11-03 03:57:00,713 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 03:57:00,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:00,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:00,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:00,811 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 03:57:00,812 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 03:57:00,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:00,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:00,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 43 [2022-11-03 03:57:00,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:00,941 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:57:00,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:00,978 INFO L356 Elim1Store]: treesize reduction 110, result has 12.0 percent of original size [2022-11-03 03:57:00,978 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 7 case distinctions, treesize of input 336 treesize of output 332 [2022-11-03 03:57:01,065 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 03:57:01,080 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:57:01,099 INFO L356 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-03 03:57:01,099 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 03:57:01,175 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 03:57:01,175 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 03:57:01,223 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:57:01,243 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 03:57:01,243 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 25 treesize of output 32 [2022-11-03 03:57:01,253 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:57:01,273 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 03:57:01,274 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 33 [2022-11-03 03:57:01,359 INFO L356 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-03 03:57:01,360 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 36 treesize of output 58 [2022-11-03 03:57:01,396 INFO L356 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2022-11-03 03:57:01,397 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 35 treesize of output 33 [2022-11-03 03:57:01,565 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 03:57:02,674 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1524#(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 03:57:02,675 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 03:57:02,675 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:57:02,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 16] total 41 [2022-11-03 03:57:02,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508469521] [2022-11-03 03:57:02,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:57:02,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-03 03:57:02,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:57:02,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-03 03:57:02,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1857, Unknown=0, NotChecked=0, Total=2070 [2022-11-03 03:57:02,677 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 41 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:57:04,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:57:04,102 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-11-03 03:57:04,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-03 03:57:04,102 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 03:57:04,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:57:04,103 INFO L225 Difference]: With dead ends: 32 [2022-11-03 03:57:04,103 INFO L226 Difference]: Without dead ends: 19 [2022-11-03 03:57:04,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 12 SyntacticMatches, 7 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1061 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=373, Invalid=2933, Unknown=0, NotChecked=0, Total=3306 [2022-11-03 03:57:04,105 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 8 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:57:04,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 41 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 180 Invalid, 0 Unknown, 62 Unchecked, 0.3s Time] [2022-11-03 03:57:04,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-11-03 03:57:04,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-11-03 03:57:04,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:57:04,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-11-03 03:57:04,111 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 17 [2022-11-03 03:57:04,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:57:04,112 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-11-03 03:57:04,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:57:04,112 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-11-03 03:57:04,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 03:57:04,112 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:57:04,113 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:57:04,143 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 03:57:04,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:57:04,323 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:57:04,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:57:04,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1191869440, now seen corresponding path program 7 times [2022-11-03 03:57:04,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:57:04,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491239862] [2022-11-03 03:57:04,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:57:04,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:57:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:57:06,372 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:57:06,372 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:57:06,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491239862] [2022-11-03 03:57:06,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491239862] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:57:06,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560631196] [2022-11-03 03:57:06,372 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:57:06,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:57:06,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:57:06,373 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:57:06,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 03:57:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:57:06,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-03 03:57:06,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:57:06,473 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 03:57:06,478 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 03:57:06,490 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 03:57:06,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:06,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, 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 03:57:06,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:06,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:06,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:06,553 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 41 treesize of output 46 [2022-11-03 03:57:06,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:06,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:06,690 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 54 treesize of output 47 [2022-11-03 03:57:06,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:06,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:06,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:06,767 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:57:06,770 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 48 [2022-11-03 03:57:06,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:06,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:06,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:06,848 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:57:06,849 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 62 treesize of output 49 [2022-11-03 03:57:07,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 101 [2022-11-03 03:57:07,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:07,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:07,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 53 [2022-11-03 03:57:07,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 90 [2022-11-03 03:57:07,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:07,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:07,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:07,175 INFO L356 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2022-11-03 03:57:07,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 38 treesize of output 64 [2022-11-03 03:57:07,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 99 [2022-11-03 03:57:07,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:07,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:07,394 INFO L356 Elim1Store]: treesize reduction 58, result has 35.6 percent of original size [2022-11-03 03:57:07,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 67 [2022-11-03 03:57:07,422 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 50 treesize of output 36 [2022-11-03 03:57:07,559 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:57:07,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:57:07,665 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 5 treesize of output 3 [2022-11-03 03:57:07,748 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 22 treesize of output 20 [2022-11-03 03:57:09,774 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_237| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_237|)) (forall ((v_ArrVal_441 Int) (v_ArrVal_436 Int)) (= (select (store (store .cse0 .cse1 v_ArrVal_436) (+ (* |v_ULTIMATE.start_main_~i~0#1_237| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_441) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (forall ((v_ArrVal_436 Int)) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 .cse1 v_ArrVal_436)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) is different from false [2022-11-03 03:57:09,835 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:57:09,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2022-11-03 03:57:09,848 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 56 treesize of output 54 [2022-11-03 03:57:11,907 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse3 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse2 .cse3 (+ (- 1) (select .cse2 .cse3))))) (.cse1 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_238| Int)) (or (not (<= .cse1 |v_ULTIMATE.start_main_~i~0#1_238|)) (forall ((v_ArrVal_436 Int)) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_238| 4)) v_ArrVal_436)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_238| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_237| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_238| 1) |v_ULTIMATE.start_main_~i~0#1_237|)) (forall ((v_ArrVal_441 Int) (v_ArrVal_436 Int)) (= (select (store (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_238| 4)) v_ArrVal_436) (+ (* |v_ULTIMATE.start_main_~i~0#1_237| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_441) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (not (<= .cse1 |v_ULTIMATE.start_main_~i~0#1_238|)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) is different from false [2022-11-03 03:57:13,956 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_238| Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_238|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_237| Int)) (or (forall ((v_ArrVal_441 Int) (v_ArrVal_436 Int)) (= (select (store (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_238| 4)) v_ArrVal_436) (+ (* |v_ULTIMATE.start_main_~i~0#1_237| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_441) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_238| 1) |v_ULTIMATE.start_main_~i~0#1_237|)))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_238| Int)) (or (forall ((v_ArrVal_436 Int)) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_238| 4)) v_ArrVal_436)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_238|)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) is different from false [2022-11-03 03:57:25,686 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-11-03 03:57:25,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560631196] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:57:25,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [530036872] [2022-11-03 03:57:25,688 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-11-03 03:57:25,689 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:57:25,689 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 03:57:25,689 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 03:57:25,689 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 03:57:25,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:25,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:25,791 INFO L356 Elim1Store]: treesize reduction 68, result has 33.3 percent of original size [2022-11-03 03:57:25,792 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 03:57:25,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:25,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-03 03:57:25,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:25,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:25,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:25,902 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 03:57:25,902 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 03:57:25,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:25,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:25,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-03 03:57:26,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:26,036 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:57:26,036 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:57:26,089 INFO L356 Elim1Store]: treesize reduction 106, result has 20.9 percent of original size [2022-11-03 03:57:26,090 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 331 treesize of output 333 [2022-11-03 03:57:26,177 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 03:57:26,193 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:57:26,222 INFO L356 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-03 03:57:26,223 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 03:57:26,291 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 03:57:26,292 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 03:57:26,337 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:57:26,361 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 03:57:26,362 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 36 treesize of output 38 [2022-11-03 03:57:26,377 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:57:26,389 INFO L356 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2022-11-03 03:57:26,390 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 35 treesize of output 22 [2022-11-03 03:57:26,463 INFO L356 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-03 03:57:26,464 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 36 treesize of output 58 [2022-11-03 03:57:26,496 INFO L356 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2022-11-03 03:57:26,497 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 35 treesize of output 33 [2022-11-03 03:57:26,536 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 03:57:28,046 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1773#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~mem15#1|) (= |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_assume_abort_if_not_~cond#1|) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= |ULTIMATE.start_main_#t~mem15#1| 0) 1 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 03:57:28,046 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 03:57:28,046 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:57:28,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 39 [2022-11-03 03:57:28,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498101294] [2022-11-03 03:57:28,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:57:28,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-03 03:57:28,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:57:28,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-03 03:57:28,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1488, Unknown=4, NotChecked=240, Total=1892 [2022-11-03 03:57:28,049 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 39 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 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 03:57:30,345 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse1 (* c_~N~0 4)) (.cse2 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (+ .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (= .cse6 c_~N~0))) (and (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (or (<= (+ .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| 1) .cse1) (and (= .cse2 1) .cse3)) (<= 12 .cse1) (forall ((|v_ULTIMATE.start_main_~i~0#1_237| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_237|)) (forall ((v_ArrVal_441 Int) (v_ArrVal_436 Int)) (= (select (store (store .cse4 .cse5 v_ArrVal_436) (+ (* |v_ULTIMATE.start_main_~i~0#1_237| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_441) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (<= c_~N~0 3) (= 0 .cse2) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse6 (+ (select .cse4 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 2)) (= .cse6 3) (= (select .cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (forall ((v_ArrVal_436 Int)) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse4 .cse5 v_ArrVal_436)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) .cse3))) is different from false [2022-11-03 03:57:30,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:57:30,500 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-11-03 03:57:30,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-03 03:57:30,500 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 03:57:30,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:57:30,501 INFO L225 Difference]: With dead ends: 38 [2022-11-03 03:57:30,501 INFO L226 Difference]: Without dead ends: 36 [2022-11-03 03:57:30,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 11 SyntacticMatches, 14 SemanticMatches, 45 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 21.9s TimeCoverageRelationStatistics Valid=178, Invalid=1639, Unknown=5, NotChecked=340, Total=2162 [2022-11-03 03:57:30,503 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 4 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 175 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:57:30,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 40 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 157 Invalid, 0 Unknown, 175 Unchecked, 0.2s Time] [2022-11-03 03:57:30,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-11-03 03:57:30,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2022-11-03 03:57:30,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:57:30,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2022-11-03 03:57:30,514 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 17 [2022-11-03 03:57:30,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:57:30,515 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2022-11-03 03:57:30,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 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 03:57:30,515 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-11-03 03:57:30,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 03:57:30,516 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:57:30,516 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:57:30,539 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 03:57:30,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-03 03:57:30,719 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:57:30,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:57:30,719 INFO L85 PathProgramCache]: Analyzing trace with hash -311525881, now seen corresponding path program 8 times [2022-11-03 03:57:30,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:57:30,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768955527] [2022-11-03 03:57:30,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:57:30,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:57:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:57:30,871 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 03:57:30,872 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:57:30,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768955527] [2022-11-03 03:57:30,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768955527] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:57:30,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864276044] [2022-11-03 03:57:30,872 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:57:30,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:57:30,873 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:57:30,875 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:57:30,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 03:57:31,021 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 03:57:31,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:57:31,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 03:57:31,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:57:31,110 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 03:57:31,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:57:31,178 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 03:57:31,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864276044] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:57:31,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [898509070] [2022-11-03 03:57:31,180 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-11-03 03:57:31,180 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:57:31,180 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 03:57:31,181 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 03:57:31,181 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 03:57:31,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:31,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-03 03:57:31,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:31,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:31,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:31,308 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 03:57:31,309 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 03:57:31,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:31,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:31,331 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 03:57:31,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:31,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:31,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 43 [2022-11-03 03:57:31,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:31,480 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:57:31,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:31,525 INFO L356 Elim1Store]: treesize reduction 110, result has 12.0 percent of original size [2022-11-03 03:57:31,526 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 7 case distinctions, treesize of input 336 treesize of output 332 [2022-11-03 03:57:31,596 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 03:57:31,611 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:57:31,631 INFO L356 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-03 03:57:31,632 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 03:57:31,693 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 03:57:31,694 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 03:57:31,733 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:57:31,754 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 03:57:31,755 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 25 treesize of output 32 [2022-11-03 03:57:31,765 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:57:31,787 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 03:57:31,787 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 33 [2022-11-03 03:57:31,865 INFO L356 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-03 03:57:31,865 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 35 treesize of output 57 [2022-11-03 03:57:31,912 INFO L356 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-03 03:57:31,912 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 36 treesize of output 58 [2022-11-03 03:57:31,964 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 03:57:32,564 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2027#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~mem15#1|) (= |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_assume_abort_if_not_~cond#1|) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= |ULTIMATE.start_main_#t~mem15#1| 0) 1 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 03:57:32,564 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 03:57:32,564 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:57:32,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2022-11-03 03:57:32,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315838963] [2022-11-03 03:57:32,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:57:32,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-03 03:57:32,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:57:32,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-03 03:57:32,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2022-11-03 03:57:32,566 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:57:32,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:57:32,746 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2022-11-03 03:57:32,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 03:57:32,747 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-03 03:57:32,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:57:32,749 INFO L225 Difference]: With dead ends: 86 [2022-11-03 03:57:32,749 INFO L226 Difference]: Without dead ends: 70 [2022-11-03 03:57:32,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 27 SyntacticMatches, 16 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2022-11-03 03:57:32,751 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 64 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:57:32,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 57 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:57:32,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-03 03:57:32,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 44. [2022-11-03 03:57:32,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 43 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:57:32,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-11-03 03:57:32,772 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 18 [2022-11-03 03:57:32,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:57:32,772 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-11-03 03:57:32,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:57:32,773 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-11-03 03:57:32,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 03:57:32,773 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:57:32,773 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:57:32,820 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-03 03:57:32,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:57:32,999 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:57:32,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:57:32,999 INFO L85 PathProgramCache]: Analyzing trace with hash 205170097, now seen corresponding path program 9 times [2022-11-03 03:57:32,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:57:32,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888414358] [2022-11-03 03:57:32,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:57:32,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:57:33,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:57:33,151 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 03:57:33,151 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:57:33,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888414358] [2022-11-03 03:57:33,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888414358] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:57:33,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592850836] [2022-11-03 03:57:33,152 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:57:33,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:57:33,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:57:33,153 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:57:33,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 03:57:33,330 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:57:33,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:57:33,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 03:57:33,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:57:33,424 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 03:57:33,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:57:33,507 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 03:57:33,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592850836] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:57:33,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [759171617] [2022-11-03 03:57:33,509 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-11-03 03:57:33,509 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:57:33,509 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 03:57:33,509 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 03:57:33,509 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 03:57:33,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:33,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:33,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:33,624 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 03:57:33,625 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 03:57:33,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:33,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-03 03:57:33,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:33,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:33,663 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 03:57:33,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:33,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:33,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 43 [2022-11-03 03:57:33,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:33,786 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:57:33,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:33,829 INFO L356 Elim1Store]: treesize reduction 110, result has 12.0 percent of original size [2022-11-03 03:57:33,830 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 7 case distinctions, treesize of input 336 treesize of output 332 [2022-11-03 03:57:33,898 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 03:57:33,937 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 03:57:33,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 21 treesize of output 29 [2022-11-03 03:57:34,008 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 03:57:34,008 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 03:57:34,053 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:57:34,073 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 03:57:34,074 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 25 treesize of output 32 [2022-11-03 03:57:34,084 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:57:34,109 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 03:57:34,109 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 33 [2022-11-03 03:57:34,203 INFO L356 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-03 03:57:34,203 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 36 treesize of output 58 [2022-11-03 03:57:34,243 INFO L356 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2022-11-03 03:57:34,243 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 35 treesize of output 33 [2022-11-03 03:57:34,278 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 03:57:34,827 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2365#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~mem15#1|) (= |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_assume_abort_if_not_~cond#1|) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= |ULTIMATE.start_main_#t~mem15#1| 0) 1 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 03:57:34,827 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 03:57:34,827 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:57:34,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-11-03 03:57:34,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828863177] [2022-11-03 03:57:34,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:57:34,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-03 03:57:34,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:57:34,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-03 03:57:34,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2022-11-03 03:57:34,829 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:57:35,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:57:35,124 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2022-11-03 03:57:35,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 03:57:35,124 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-03 03:57:35,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:57:35,125 INFO L225 Difference]: With dead ends: 76 [2022-11-03 03:57:35,125 INFO L226 Difference]: Without dead ends: 62 [2022-11-03 03:57:35,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 27 SyntacticMatches, 16 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2022-11-03 03:57:35,126 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 74 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:57:35,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 105 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:57:35,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-03 03:57:35,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 38. [2022-11-03 03:57:35,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 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 03:57:35,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2022-11-03 03:57:35,139 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 18 [2022-11-03 03:57:35,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:57:35,140 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2022-11-03 03:57:35,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:57:35,140 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-11-03 03:57:35,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 03:57:35,141 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:57:35,141 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:57:35,174 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-03 03:57:35,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:57:35,359 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:57:35,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:57:35,359 INFO L85 PathProgramCache]: Analyzing trace with hash 493013884, now seen corresponding path program 2 times [2022-11-03 03:57:35,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:57:35,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667520532] [2022-11-03 03:57:35,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:57:35,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:57:35,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:57:37,135 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:57:37,136 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:57:37,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667520532] [2022-11-03 03:57:37,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667520532] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:57:37,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519907896] [2022-11-03 03:57:37,136 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:57:37,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:57:37,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:57:37,137 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:57:37,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-03 03:57:37,263 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 03:57:37,263 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:57:37,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-03 03:57:37,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:57:37,313 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 03:57:37,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:37,351 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 21 treesize of output 20 [2022-11-03 03:57:37,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:37,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:37,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:37,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-03 03:57:37,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:37,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-03 03:57:37,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:37,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 23 treesize of output 23 [2022-11-03 03:57:37,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:37,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:37,602 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 03:57:37,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:37,655 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:57:37,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:37,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 95 [2022-11-03 03:57:37,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:37,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2022-11-03 03:57:37,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:37,734 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 41 treesize of output 32 [2022-11-03 03:57:37,740 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 21 treesize of output 13 [2022-11-03 03:57:37,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:37,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:37,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 94 [2022-11-03 03:57:37,871 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 9 treesize of output 7 [2022-11-03 03:57:37,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:37,895 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 63 treesize of output 48 [2022-11-03 03:57:37,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:37,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2022-11-03 03:57:38,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:38,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:38,081 INFO L356 Elim1Store]: treesize reduction 60, result has 48.7 percent of original size [2022-11-03 03:57:38,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 89 treesize of output 139 [2022-11-03 03:57:38,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2022-11-03 03:57:38,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:38,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2022-11-03 03:57:38,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2022-11-03 03:57:38,493 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 5 treesize of output 3 [2022-11-03 03:58:00,816 WARN L234 SmtUtils]: Spent 22.12s on a formula simplification. DAG size of input: 76 DAG size of output: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 03:58:01,352 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 03:58:01,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:58:24,341 WARN L234 SmtUtils]: Spent 14.04s on a formula simplification. DAG size of input: 89 DAG size of output: 88 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 03:58:37,445 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:58:37,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 108 [2022-11-03 03:58:37,481 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:58:37,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 82 [2022-11-03 03:58:37,507 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_654 Int) (v_arrayElimArr_25 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_331| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_649 Int)) (let ((.cse0 (store (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_25) |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_649) .cse1 (+ (- 1) (select .cse2 .cse1)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_331| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_654))) (or (= (select .cse0 .cse1) 0) (< (+ |v_ULTIMATE.start_main_~i~0#1_331| 1) c_~N~0) (not (= (select v_arrayElimArr_25 |ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)) (not (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) (forall ((v_ArrVal_654 Int) (v_arrayElimArr_24 (Array Int Int)) (v_ArrVal_650 Int) (|v_ULTIMATE.start_main_~i~0#1_331| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_24))) (let ((.cse5 (let ((.cse6 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) (let ((.cse3 (store (store .cse5 .cse1 v_ArrVal_650) (+ (* |v_ULTIMATE.start_main_~i~0#1_331| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_654))) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_331| 1) c_~N~0) (not (= (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (= (select .cse3 .cse1) 0) (= (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse5) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))))))) (not (< 1 c_~N~0))) is different from false [2022-11-03 03:58:38,339 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse4 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (.cse5 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_339| Int)) (or (forall ((v_ArrVal_654 Int) (v_ArrVal_641 Int) (v_arrayElimArr_25 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_331| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_649 Int)) (let ((.cse2 (select v_arrayElimArr_25 |ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (store (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_339| 4)) v_ArrVal_641)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_25) |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_649) .cse1 (+ (- 1) (select .cse3 .cse1)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_331| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_654))) (or (= (select .cse0 .cse1) 0) (< (+ |v_ULTIMATE.start_main_~i~0#1_339| 1) .cse2) (< (+ |v_ULTIMATE.start_main_~i~0#1_331| 1) .cse2) (not (< 1 .cse2)) (not (< |v_ULTIMATE.start_main_~i~0#1_339| .cse2)) (not (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) (not (<= .cse5 |v_ULTIMATE.start_main_~i~0#1_339|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_339| Int)) (or (forall ((v_ArrVal_654 Int) (v_ArrVal_641 Int) (v_arrayElimArr_24 (Array Int Int)) (v_ArrVal_650 Int) (|v_ULTIMATE.start_main_~i~0#1_331| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_339| 4)) v_ArrVal_641)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_24))) (let ((.cse8 (let ((.cse9 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse9 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) (let ((.cse6 (store (store .cse8 .cse1 v_ArrVal_650) (+ (* |v_ULTIMATE.start_main_~i~0#1_331| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_654))) (or (not (= (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (= (select .cse6 .cse1) 0) (< (select (select (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| .cse8) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (+ 2 |v_ULTIMATE.start_main_~i~0#1_339|)) (< |v_ULTIMATE.start_main_~i~0#1_331| |v_ULTIMATE.start_main_~i~0#1_339|)))))) (not (<= .cse5 |v_ULTIMATE.start_main_~i~0#1_339|)) (< |v_ULTIMATE.start_main_~i~0#1_339| 1))) (forall ((|v_ULTIMATE.start_main_~i~0#1_339| Int)) (or (forall ((v_ArrVal_654 Int) (v_ArrVal_641 Int) (v_arrayElimArr_24 (Array Int Int)) (v_ArrVal_650 Int) (|v_ULTIMATE.start_main_~i~0#1_331| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_339| 4)) v_ArrVal_641)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_24))) (let ((.cse11 (let ((.cse13 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse13 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) (let ((.cse12 (store (store .cse11 .cse1 v_ArrVal_650) (+ (* |v_ULTIMATE.start_main_~i~0#1_331| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_654))) (or (< |v_ULTIMATE.start_main_~i~0#1_339| (select (select (store .cse10 |c_ULTIMATE.start_main_~a~0#1.base| .cse11) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)) (not (= (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (= (select .cse12 .cse1) 0) (< |v_ULTIMATE.start_main_~i~0#1_331| |v_ULTIMATE.start_main_~i~0#1_339|)))))) (not (<= .cse5 |v_ULTIMATE.start_main_~i~0#1_339|)) (< |v_ULTIMATE.start_main_~i~0#1_339| 1))))) is different from false [2022-11-03 03:58:38,444 INFO L356 Elim1Store]: treesize reduction 63, result has 37.6 percent of original size [2022-11-03 03:58:38,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 184 treesize of output 113 [2022-11-03 03:58:38,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 151 [2022-11-03 03:58:38,489 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:58:38,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 108 [2022-11-03 03:58:38,497 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:58:38,518 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:58:38,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 90 [2022-11-03 03:58:38,663 INFO L356 Elim1Store]: treesize reduction 63, result has 37.6 percent of original size [2022-11-03 03:58:38,664 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 291 treesize of output 139 [2022-11-03 03:58:38,672 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:58:38,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 90 treesize of output 78 [2022-11-03 03:58:38,694 INFO L356 Elim1Store]: treesize reduction 18, result has 21.7 percent of original size [2022-11-03 03:58:38,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 57 [2022-11-03 03:58:38,703 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 5 treesize of output 3 [2022-11-03 03:58:38,739 INFO L356 Elim1Store]: treesize reduction 100, result has 1.0 percent of original size [2022-11-03 03:58:38,739 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 293 treesize of output 1 [2022-11-03 03:58:38,808 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2022-11-03 03:58:38,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519907896] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:58:38,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [634122263] [2022-11-03 03:58:38,810 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-03 03:58:38,810 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:58:38,811 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 03:58:38,811 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 03:58:38,811 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 03:58:38,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:38,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:38,933 INFO L356 Elim1Store]: treesize reduction 68, result has 33.3 percent of original size [2022-11-03 03:58:38,933 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 03:58:38,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:38,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:38,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:39,052 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 03:58:39,052 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 03:58:39,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:39,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-03 03:58:39,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:39,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:39,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 43 [2022-11-03 03:58:39,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:39,190 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:58:39,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:39,238 INFO L356 Elim1Store]: treesize reduction 110, result has 12.0 percent of original size [2022-11-03 03:58:39,238 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 7 case distinctions, treesize of input 336 treesize of output 332 [2022-11-03 03:58:39,318 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 03:58:39,360 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 03:58:39,360 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 03:58:39,442 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 03:58:39,442 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 03:58:39,489 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:58:39,516 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 03:58:39,516 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 25 treesize of output 32 [2022-11-03 03:58:39,526 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:58:39,550 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 03:58:39,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 33 [2022-11-03 03:58:39,631 INFO L356 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-03 03:58:39,631 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 35 treesize of output 57 [2022-11-03 03:58:39,682 INFO L356 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-03 03:58:39,682 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 36 treesize of output 58 [2022-11-03 03:58:39,845 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 03:58:41,140 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2724#(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 03:58:41,140 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 03:58:41,141 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:58:41,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 18] total 45 [2022-11-03 03:58:41,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892656558] [2022-11-03 03:58:41,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:58:41,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-03 03:58:41,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:58:41,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-03 03:58:41,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=1963, Unknown=17, NotChecked=186, Total=2450 [2022-11-03 03:58:41,143 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 45 states, 45 states have (on average 1.2) internal successors, (54), 45 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 03:58:43,175 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse4 (store .cse10 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (.cse5 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_339| Int)) (or (forall ((v_ArrVal_654 Int) (v_ArrVal_641 Int) (v_arrayElimArr_25 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_331| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_649 Int)) (let ((.cse2 (select v_arrayElimArr_25 |ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (store (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_339| 4)) v_ArrVal_641)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_25) |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_649) .cse1 (+ (- 1) (select .cse3 .cse1)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_331| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_654))) (or (= (select .cse0 .cse1) 0) (< (+ |v_ULTIMATE.start_main_~i~0#1_339| 1) .cse2) (< (+ |v_ULTIMATE.start_main_~i~0#1_331| 1) .cse2) (not (< 1 .cse2)) (not (< |v_ULTIMATE.start_main_~i~0#1_339| .cse2)) (not (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) (not (<= .cse5 |v_ULTIMATE.start_main_~i~0#1_339|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_339| Int)) (or (forall ((v_ArrVal_654 Int) (v_ArrVal_641 Int) (v_arrayElimArr_24 (Array Int Int)) (v_ArrVal_650 Int) (|v_ULTIMATE.start_main_~i~0#1_331| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_339| 4)) v_ArrVal_641)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_24))) (let ((.cse8 (let ((.cse9 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse9 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) (let ((.cse6 (store (store .cse8 .cse1 v_ArrVal_650) (+ (* |v_ULTIMATE.start_main_~i~0#1_331| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_654))) (or (not (= (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (= (select .cse6 .cse1) 0) (< (select (select (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| .cse8) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (+ 2 |v_ULTIMATE.start_main_~i~0#1_339|)) (< |v_ULTIMATE.start_main_~i~0#1_331| |v_ULTIMATE.start_main_~i~0#1_339|)))))) (not (<= .cse5 |v_ULTIMATE.start_main_~i~0#1_339|)) (< |v_ULTIMATE.start_main_~i~0#1_339| 1))) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (select .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (forall ((|v_ULTIMATE.start_main_~i~0#1_339| Int)) (or (forall ((v_ArrVal_654 Int) (v_ArrVal_641 Int) (v_arrayElimArr_24 (Array Int Int)) (v_ArrVal_650 Int) (|v_ULTIMATE.start_main_~i~0#1_331| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse11 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_339| 4)) v_ArrVal_641)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_24))) (let ((.cse12 (let ((.cse14 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse14 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) (let ((.cse13 (store (store .cse12 .cse1 v_ArrVal_650) (+ (* |v_ULTIMATE.start_main_~i~0#1_331| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_654))) (or (< |v_ULTIMATE.start_main_~i~0#1_339| (select (select (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| .cse12) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)) (not (= (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (= (select .cse13 .cse1) 0) (< |v_ULTIMATE.start_main_~i~0#1_331| |v_ULTIMATE.start_main_~i~0#1_339|)))))) (not (<= .cse5 |v_ULTIMATE.start_main_~i~0#1_339|)) (< |v_ULTIMATE.start_main_~i~0#1_339| 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 03:58:44,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:58:44,228 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-11-03 03:58:44,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-03 03:58:44,228 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.2) internal successors, (54), 45 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) Word has length 20 [2022-11-03 03:58:44,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:58:44,229 INFO L225 Difference]: With dead ends: 40 [2022-11-03 03:58:44,229 INFO L226 Difference]: Without dead ends: 38 [2022-11-03 03:58:44,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 17 SyntacticMatches, 15 SemanticMatches, 56 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1438 ImplicationChecksByTransitivity, 63.4s TimeCoverageRelationStatistics Valid=395, Invalid=2567, Unknown=20, NotChecked=324, Total=3306 [2022-11-03 03:58:44,230 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 22 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 257 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:58:44,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 45 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 173 Invalid, 0 Unknown, 257 Unchecked, 0.2s Time] [2022-11-03 03:58:44,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-03 03:58:44,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-11-03 03:58:44,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 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 03:58:44,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-11-03 03:58:44,245 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 20 [2022-11-03 03:58:44,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:58:44,246 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-11-03 03:58:44,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.2) internal successors, (54), 45 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 03:58:44,246 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-11-03 03:58:44,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 03:58:44,247 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:58:44,247 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:58:44,274 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-03 03:58:44,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-03 03:58:44,463 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:58:44,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:58:44,463 INFO L85 PathProgramCache]: Analyzing trace with hash -103922907, now seen corresponding path program 10 times [2022-11-03 03:58:44,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:58:44,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685007082] [2022-11-03 03:58:44,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:58:44,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:58:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:58:47,036 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:58:47,036 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:58:47,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685007082] [2022-11-03 03:58:47,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685007082] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:58:47,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078477581] [2022-11-03 03:58:47,037 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:58:47,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:58:47,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:58:47,038 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:58:47,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-03 03:58:47,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:58:47,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 85 conjunts are in the unsatisfiable core [2022-11-03 03:58:47,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:58:47,180 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 03:58:47,187 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 03:58:47,239 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 03:58:47,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:47,299 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 03:58:47,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:47,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:47,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:47,389 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 40 treesize of output 45 [2022-11-03 03:58:47,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:47,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:47,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:47,473 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 03:58:47,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:47,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:47,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:47,623 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 61 treesize of output 57 [2022-11-03 03:58:47,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:47,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:47,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:47,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:47,719 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:58:47,722 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 70 treesize of output 58 [2022-11-03 03:58:47,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:47,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:47,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:47,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:47,810 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:58:47,815 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 81 treesize of output 61 [2022-11-03 03:58:47,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:47,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:47,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:47,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:47,912 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:58:47,913 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 63 treesize of output 59 [2022-11-03 03:58:48,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 99 [2022-11-03 03:58:48,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:48,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:48,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:48,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 58 [2022-11-03 03:58:48,174 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 16 treesize of output 5 [2022-11-03 03:58:48,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 97 [2022-11-03 03:58:48,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:48,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:48,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:48,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:48,320 INFO L356 Elim1Store]: treesize reduction 48, result has 48.9 percent of original size [2022-11-03 03:58:48,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 45 treesize of output 82 [2022-11-03 03:58:48,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:48,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 140 [2022-11-03 03:58:48,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:48,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:48,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:48,734 INFO L356 Elim1Store]: treesize reduction 74, result has 38.8 percent of original size [2022-11-03 03:58:48,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 101 treesize of output 124 [2022-11-03 03:58:48,920 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 16 treesize of output 5 [2022-11-03 03:58:49,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 117 [2022-11-03 03:58:49,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:49,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:49,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:49,124 INFO L356 Elim1Store]: treesize reduction 80, result has 33.9 percent of original size [2022-11-03 03:58:49,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 74 treesize of output 99 [2022-11-03 03:58:49,208 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 81 treesize of output 61 [2022-11-03 03:58:49,451 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:58:49,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:58:49,571 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 5 treesize of output 3 [2022-11-03 03:58:49,663 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 22 treesize of output 20 [2022-11-03 03:59:31,846 WARN L234 SmtUtils]: Spent 10.04s on a formula simplification. DAG size of input: 37 DAG size of output: 34 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 03:59:31,892 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 56 treesize of output 54 [2022-11-03 03:59:31,910 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-11-03 03:59:33,932 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_371| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~0#1_371|)) (forall ((v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_370| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_371| 1) |v_ULTIMATE.start_main_~i~0#1_370|)) (forall ((v_ArrVal_762 Int) (v_ArrVal_767 Int)) (= (select (store (store (store .cse1 .cse2 v_ArrVal_761) (+ (* |v_ULTIMATE.start_main_~i~0#1_371| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_762) (+ (* |v_ULTIMATE.start_main_~i~0#1_370| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_767) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_371| Int)) (or (forall ((v_ArrVal_762 Int) (v_ArrVal_761 Int)) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse1 .cse2 v_ArrVal_761) (+ (* |v_ULTIMATE.start_main_~i~0#1_371| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_762)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (not (<= .cse0 |v_ULTIMATE.start_main_~i~0#1_371|)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) is different from false [2022-11-03 03:59:34,006 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:59:34,014 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:59:34,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 31 [2022-11-03 03:59:34,031 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 538 treesize of output 530 [2022-11-03 03:59:36,339 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse3 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse2 .cse3 (+ (- 1) (select .cse2 .cse3))))) (.cse1 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_372| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_371| Int)) (or (forall ((v_ArrVal_762 Int) (v_ArrVal_761 Int)) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_372| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_761) (+ (* |v_ULTIMATE.start_main_~i~0#1_371| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_762)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_372| 1) |v_ULTIMATE.start_main_~i~0#1_371|)))) (not (<= .cse1 |v_ULTIMATE.start_main_~i~0#1_372|)))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_372| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_371| Int)) (or (forall ((v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_370| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_371| 1) |v_ULTIMATE.start_main_~i~0#1_370|)) (forall ((v_ArrVal_762 Int) (v_ArrVal_767 Int)) (= (select (store (store (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_372| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_761) (+ (* |v_ULTIMATE.start_main_~i~0#1_371| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_762) (+ (* |v_ULTIMATE.start_main_~i~0#1_370| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_767) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_372| 1) |v_ULTIMATE.start_main_~i~0#1_371|)))) (not (<= .cse1 |v_ULTIMATE.start_main_~i~0#1_372|)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) is different from false [2022-11-03 03:59:38,391 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_372| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_371| Int)) (or (forall ((v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_370| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_371| 1) |v_ULTIMATE.start_main_~i~0#1_370|)) (forall ((v_ArrVal_762 Int) (v_ArrVal_767 Int)) (= (select (store (store (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_372| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_761) (+ (* |v_ULTIMATE.start_main_~i~0#1_371| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_762) (+ (* |v_ULTIMATE.start_main_~i~0#1_370| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_767) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_372| 1) |v_ULTIMATE.start_main_~i~0#1_371|)))) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_372|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_372| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_371| Int)) (or (forall ((v_ArrVal_762 Int) (v_ArrVal_761 Int)) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_372| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_761) (+ (* |v_ULTIMATE.start_main_~i~0#1_371| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_762)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_372| 1) |v_ULTIMATE.start_main_~i~0#1_371|)))) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_372|)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) is different from false [2022-11-03 03:59:40,464 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (+ (select .cse4 |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_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse2)))) (let ((.cse1 (let ((.cse3 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (and (= c_~N~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_372| Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_372|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_371| Int)) (or (forall ((v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_370| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_371| 1) |v_ULTIMATE.start_main_~i~0#1_370|)) (forall ((v_ArrVal_762 Int) (v_ArrVal_767 Int)) (= (select (store (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_372| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_761) (+ (* |v_ULTIMATE.start_main_~i~0#1_371| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_762) (+ (* |v_ULTIMATE.start_main_~i~0#1_370| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_767) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_372| 1) |v_ULTIMATE.start_main_~i~0#1_371|)))))) (= .cse2 c_~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_372| Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_372|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_371| Int)) (or (forall ((v_ArrVal_762 Int) (v_ArrVal_761 Int)) (= c_~N~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_372| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_761) (+ (* |v_ULTIMATE.start_main_~i~0#1_371| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_762)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_372| 1) |v_ULTIMATE.start_main_~i~0#1_371|))))))))))) is different from false [2022-11-03 03:59:42,544 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (let ((.cse7 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse6))))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse2)))) (let ((.cse1 (let ((.cse3 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (and (= c_~N~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_372| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_371| Int)) (or (forall ((v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_370| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_371| 1) |v_ULTIMATE.start_main_~i~0#1_370|)) (forall ((v_ArrVal_762 Int) (v_ArrVal_767 Int)) (= (select (store (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_372| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_761) (+ (* |v_ULTIMATE.start_main_~i~0#1_371| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_762) (+ (* |v_ULTIMATE.start_main_~i~0#1_370| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_767) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_372| 1) |v_ULTIMATE.start_main_~i~0#1_371|)))) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_372|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_372| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_371| Int)) (or (forall ((v_ArrVal_762 Int) (v_ArrVal_761 Int)) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_372| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_761) (+ (* |v_ULTIMATE.start_main_~i~0#1_371| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_762)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_372| 1) |v_ULTIMATE.start_main_~i~0#1_371|)))) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_372|)))) (= c_~N~0 .cse2)))))) is different from false [2022-11-03 03:59:44,669 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (let ((.cse8 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (+ .cse5 .cse6 .cse7 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse8 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse2)))) (let ((.cse1 (let ((.cse3 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_372| Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_372|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_371| Int)) (or (forall ((v_ArrVal_762 Int) (v_ArrVal_761 Int)) (= c_~N~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_372| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_761) (+ (* |v_ULTIMATE.start_main_~i~0#1_371| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_762)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_372| 1) |v_ULTIMATE.start_main_~i~0#1_371|)))))) (= c_~N~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (= c_~N~0 .cse2) (forall ((|v_ULTIMATE.start_main_~i~0#1_372| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_371| Int)) (or (forall ((v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_370| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_371| 1) |v_ULTIMATE.start_main_~i~0#1_370|)) (forall ((v_ArrVal_762 Int) (v_ArrVal_767 Int)) (= (select (store (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_372| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_761) (+ (* |v_ULTIMATE.start_main_~i~0#1_371| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_762) (+ (* |v_ULTIMATE.start_main_~i~0#1_370| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_767) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_372| 1) |v_ULTIMATE.start_main_~i~0#1_371|)))) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_372|))))))))) is different from false [2022-11-03 03:59:46,835 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (let ((.cse9 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse8 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse9 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse9 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse5 .cse6 .cse7 .cse8))))))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse0)))) (let ((.cse2 (let ((.cse3 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (and (= c_~N~0 .cse0) (forall ((|v_ULTIMATE.start_main_~i~0#1_372| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_371| Int)) (or (forall ((v_ArrVal_762 Int) (v_ArrVal_761 Int)) (= c_~N~0 (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse2 (+ (* |v_ULTIMATE.start_main_~i~0#1_372| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_761) (+ (* |v_ULTIMATE.start_main_~i~0#1_371| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_762)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_372| 1) |v_ULTIMATE.start_main_~i~0#1_371|)))) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_372|)))) (= c_~N~0 (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|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_372| Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_372|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_371| Int)) (or (forall ((v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_370| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_371| 1) |v_ULTIMATE.start_main_~i~0#1_370|)) (forall ((v_ArrVal_762 Int) (v_ArrVal_767 Int)) (= (select (store (store (store .cse2 (+ (* |v_ULTIMATE.start_main_~i~0#1_372| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_761) (+ (* |v_ULTIMATE.start_main_~i~0#1_371| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_762) (+ (* |v_ULTIMATE.start_main_~i~0#1_370| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_767) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_372| 1) |v_ULTIMATE.start_main_~i~0#1_371|))))))))))) is different from false [2022-11-03 04:00:04,736 WARN L234 SmtUtils]: Spent 17.41s on a formula simplification that was a NOOP. DAG size: 91 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 04:00:29,119 WARN L234 SmtUtils]: Spent 19.53s on a formula simplification. DAG size of input: 96 DAG size of output: 95 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 04:00:47,427 WARN L234 SmtUtils]: Spent 8.59s on a formula simplification that was a NOOP. DAG size: 98 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 04:01:19,249 WARN L234 SmtUtils]: Spent 10.63s on a formula simplification that was a NOOP. DAG size: 100 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 04:01:50,131 WARN L234 SmtUtils]: Spent 11.57s on a formula simplification that was a NOOP. DAG size: 103 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 04:01:50,168 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 17 not checked. [2022-11-03 04:01:50,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078477581] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:01:50,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1377864521] [2022-11-03 04:01:50,170 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-11-03 04:01:50,171 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 04:01:50,171 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 04:01:50,171 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 04:01:50,171 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 04:01:50,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:01:50,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:01:50,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:01:50,296 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 04:01:50,296 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:01:50,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:01:50,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:01:50,326 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:01:50,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:01:50,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-03 04:01:50,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:01:50,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:01:50,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-03 04:01:50,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:01:50,454 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:01:50,455 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:01:50,511 INFO L356 Elim1Store]: treesize reduction 106, result has 20.9 percent of original size [2022-11-03 04:01:50,511 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 331 treesize of output 333 [2022-11-03 04:01:50,661 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:01:50,681 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:01:50,716 INFO L356 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-03 04:01:50,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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:01:50,830 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 04:01:50,830 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:01:50,882 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:01:50,914 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 04:01:50,914 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 36 treesize of output 38 [2022-11-03 04:01:50,933 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:01:50,951 INFO L356 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2022-11-03 04:01:50,952 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 35 treesize of output 22 [2022-11-03 04:01:51,052 INFO L356 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-03 04:01:51,052 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 35 treesize of output 57 [2022-11-03 04:01:51,113 INFO L356 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-03 04:01:51,114 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 36 treesize of output 58 [2022-11-03 04:01:51,164 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 04:01:58,175 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3045#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~mem15#1|) (= |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_assume_abort_if_not_~cond#1|) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= |ULTIMATE.start_main_#t~mem15#1| 0) 1 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:01:58,175 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 04:01:58,175 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:01:58,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 51 [2022-11-03 04:01:58,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338356211] [2022-11-03 04:01:58,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:01:58,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-03 04:01:58,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:01:58,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-03 04:01:58,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=2114, Unknown=36, NotChecked=700, Total=3080 [2022-11-03 04:01:58,179 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 51 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:02:09,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:02:09,581 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2022-11-03 04:02:09,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-03 04:02:09,582 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-03 04:02:09,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:02:09,583 INFO L225 Difference]: With dead ends: 63 [2022-11-03 04:02:09,583 INFO L226 Difference]: Without dead ends: 61 [2022-11-03 04:02:09,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 11 SyntacticMatches, 18 SemanticMatches, 56 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1480 ImplicationChecksByTransitivity, 196.8s TimeCoverageRelationStatistics Valid=247, Invalid=2293, Unknown=38, NotChecked=728, Total=3306 [2022-11-03 04:02:09,585 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 3 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 368 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 04:02:09,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 89 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 355 Invalid, 0 Unknown, 368 Unchecked, 0.5s Time] [2022-11-03 04:02:09,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-03 04:02:09,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2022-11-03 04:02:09,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 51 states have internal predecessors, (60), 0 states have call successors, (0), 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:09,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2022-11-03 04:02:09,610 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 20 [2022-11-03 04:02:09,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:02:09,610 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2022-11-03 04:02:09,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:02:09,611 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2022-11-03 04:02:09,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 04:02:09,612 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:02:09,612 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:02:09,637 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-03 04:02:09,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-03 04:02:09,814 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:02:09,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:02:09,815 INFO L85 PathProgramCache]: Analyzing trace with hash -107876396, now seen corresponding path program 11 times [2022-11-03 04:02:09,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:02:09,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689085] [2022-11-03 04:02:09,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:02:09,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:02:09,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:02:10,034 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 04:02:10,034 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:02:10,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689085] [2022-11-03 04:02:10,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689085] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:02:10,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536570014] [2022-11-03 04:02:10,035 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:02:10,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:02:10,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:02:10,039 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:02:10,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-03 04:02:10,321 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-03 04:02:10,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:02:10,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-03 04:02:10,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:02:10,486 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 04:02:10,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:02:10,619 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 04:02:10,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536570014] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:02:10,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1883855859] [2022-11-03 04:02:10,621 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-11-03 04:02:10,622 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 04:02:10,622 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 04:02:10,622 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 04:02:10,622 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 04:02:10,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:10,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:10,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:10,753 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 04:02:10,753 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:10,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:10,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-03 04:02:10,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:10,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:10,797 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:10,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:10,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:10,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-03 04:02:10,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:10,934 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:02:10,935 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:02:11,001 INFO L356 Elim1Store]: treesize reduction 106, result has 20.9 percent of original size [2022-11-03 04:02:11,002 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 331 treesize of output 333 [2022-11-03 04:02:11,093 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:11,107 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:02:11,140 INFO L356 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-03 04:02:11,141 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:11,242 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 04:02:11,242 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:11,303 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:02:11,338 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 04:02:11,339 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 25 treesize of output 32 [2022-11-03 04:02:11,351 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:02:11,385 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 04:02:11,386 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 33 [2022-11-03 04:02:11,500 INFO L356 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-03 04:02:11,500 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 36 treesize of output 58 [2022-11-03 04:02:11,551 INFO L356 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2022-11-03 04:02:11,552 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 35 treesize of output 33 [2022-11-03 04:02:11,599 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 04:02:12,496 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3403#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~mem15#1|) (= |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_assume_abort_if_not_~cond#1|) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= |ULTIMATE.start_main_#t~mem15#1| 0) 1 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:12,496 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 04:02:12,496 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:02:12,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2022-11-03 04:02:12,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632087386] [2022-11-03 04:02:12,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:02:12,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 04:02:12,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:02:12,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 04:02:12,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2022-11-03 04:02:12,498 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 20 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 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:13,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:02:13,053 INFO L93 Difference]: Finished difference Result 116 states and 129 transitions. [2022-11-03 04:02:13,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-03 04:02:13,054 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 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:02:13,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:02:13,055 INFO L225 Difference]: With dead ends: 116 [2022-11-03 04:02:13,055 INFO L226 Difference]: Without dead ends: 104 [2022-11-03 04:02:13,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 31 SyntacticMatches, 20 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=233, Invalid=957, Unknown=0, NotChecked=0, Total=1190 [2022-11-03 04:02:13,056 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 77 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 04:02:13,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 155 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 04:02:13,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-03 04:02:13,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 55. [2022-11-03 04:02:13,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 54 states have internal predecessors, (63), 0 states have call successors, (0), 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:13,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2022-11-03 04:02:13,087 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 21 [2022-11-03 04:02:13,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:02:13,087 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2022-11-03 04:02:13,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 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:13,088 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-11-03 04:02:13,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 04:02:13,089 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:02:13,089 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:02:13,095 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-03 04:02:13,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-03 04:02:13,295 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:02:13,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:02:13,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1406371200, now seen corresponding path program 3 times [2022-11-03 04:02:13,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:02:13,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420673653] [2022-11-03 04:02:13,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:02:13,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:02:13,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:02:15,424 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:02:15,424 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:02:15,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420673653] [2022-11-03 04:02:15,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420673653] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:02:15,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909103376] [2022-11-03 04:02:15,425 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 04:02:15,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:02:15,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:02:15,426 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:02:15,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-03 04:02:15,541 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 04:02:15,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:02:15,544 WARN L261 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 85 conjunts are in the unsatisfiable core [2022-11-03 04:02:15,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:02:15,553 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:15,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-11-03 04:02:15,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-03 04:02:21,919 INFO L356 Elim1Store]: treesize reduction 112, result has 53.3 percent of original size [2022-11-03 04:02:21,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 50 treesize of output 143 [2022-11-03 04:02:24,331 INFO L356 Elim1Store]: treesize reduction 930, result has 27.0 percent of original size [2022-11-03 04:02:24,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 65 case distinctions, treesize of input 309 treesize of output 541 [2022-11-03 04:02:47,155 WARN L234 SmtUtils]: Spent 9.96s on a formula simplification. DAG size of input: 225 DAG size of output: 133 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 04:02:50,535 INFO L356 Elim1Store]: treesize reduction 1387, result has 24.9 percent of original size [2022-11-03 04:02:50,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 104 case distinctions, treesize of input 559 treesize of output 796 [2022-11-03 04:03:11,972 INFO L356 Elim1Store]: treesize reduction 1485, result has 28.3 percent of original size [2022-11-03 04:03:11,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 15 new quantified variables, introduced 102 case distinctions, treesize of input 324 treesize of output 768 [2022-11-03 04:03:20,510 INFO L356 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2022-11-03 04:03:20,510 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 1168 treesize of output 1111 [2022-11-03 04:03:20,550 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:03:20,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:20,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:20,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:20,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:20,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:20,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:20,729 INFO L356 Elim1Store]: treesize reduction 70, result has 64.6 percent of original size [2022-11-03 04:03:20,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 9 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 1094 treesize of output 947 [2022-11-03 04:03:22,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:22,876 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:03:22,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:22,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 629 treesize of output 439 [2022-11-03 04:03:23,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:23,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:23,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:23,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 56 [2022-11-03 04:03:23,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:23,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:23,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:23,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 55 [2022-11-03 04:03:25,280 INFO L356 Elim1Store]: treesize reduction 309, result has 38.9 percent of original size [2022-11-03 04:03:25,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 761 treesize of output 691 [2022-11-03 04:03:25,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:25,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:25,421 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:03:25,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 531 treesize of output 572 [2022-11-03 04:03:25,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:25,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:25,540 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:03:25,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 489 treesize of output 534 [2022-11-03 04:03:25,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:25,635 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:03:25,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 451 treesize of output 474 [2022-11-03 04:03:25,734 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:03:25,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 421 treesize of output 444 [2022-11-03 04:03:38,837 INFO L356 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2022-11-03 04:03:38,837 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 573 treesize of output 562 [2022-11-03 04:03:38,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:38,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:38,979 INFO L356 Elim1Store]: treesize reduction 62, result has 49.6 percent of original size [2022-11-03 04:03:38,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 545 treesize of output 521 [2022-11-03 04:03:42,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:42,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:42,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:42,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:42,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:42,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:42,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:42,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:42,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 434 treesize of output 318 [2022-11-03 04:03:51,351 INFO L356 Elim1Store]: treesize reduction 301, result has 38.8 percent of original size [2022-11-03 04:03:51,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 1282 treesize of output 1059 [2022-11-03 04:03:51,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:51,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:51,524 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:03:51,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 906 treesize of output 985 [2022-11-03 04:03:51,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:51,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:51,678 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:03:51,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 862 treesize of output 939 [2022-11-03 04:03:51,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:51,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:51,844 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:03:51,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 816 treesize of output 899 [2022-11-03 04:03:51,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:51,984 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:03:51,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 776 treesize of output 818 [2022-11-03 04:03:52,115 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:03:52,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 744 treesize of output 799 [2022-11-03 04:03:52,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:52,246 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:03:52,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 704 treesize of output 721 [2022-11-03 04:03:52,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:52,409 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:03:52,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 668 treesize of output 714 [2022-11-03 04:04:23,195 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Maybe an infinite loop [2022-11-03 04:04:23,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [634560884] [2022-11-03 04:04:23,196 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-03 04:04:23,197 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 04:04:23,197 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 04:04:23,197 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 04:04:23,197 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 04:04:23,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:23,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:23,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:23,287 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 04:04:23,287 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:04:23,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:23,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:23,307 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:04:23,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:23,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-03 04:04:23,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:23,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:23,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-03 04:04:23,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:23,434 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:04:23,434 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:04:23,481 INFO L356 Elim1Store]: treesize reduction 106, result has 20.9 percent of original size [2022-11-03 04:04:23,481 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 331 treesize of output 333 [2022-11-03 04:04:23,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, 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:04:23,586 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:04:23,608 INFO L356 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-03 04:04:23,609 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:04:23,676 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 04:04:23,676 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:04:23,715 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:04:23,736 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 04:04:23,736 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 36 treesize of output 38 [2022-11-03 04:04:23,749 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:04:23,760 INFO L356 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2022-11-03 04:04:23,761 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 35 treesize of output 22 [2022-11-03 04:04:23,835 INFO L356 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-03 04:04:23,836 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 35 treesize of output 57 [2022-11-03 04:04:23,885 INFO L356 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-03 04:04:23,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 36 treesize of output 58 [2022-11-03 04:04:23,958 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 04:04:25,530 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3775#(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:04:25,530 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 04:04:25,530 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-11-03 04:04:25,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2022-11-03 04:04:25,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879602661] [2022-11-03 04:04:25,531 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-11-03 04:04:25,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 04:04:25,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:04:25,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 04:04:25,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1077, Unknown=6, NotChecked=0, Total=1190 [2022-11-03 04:04:25,532 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 20 states, 20 states have (on average 1.15) internal successors, (23), 20 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:04:26,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:04:26,036 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2022-11-03 04:04:26,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-03 04:04:26,036 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.15) internal successors, (23), 20 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:04:26,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:04:26,037 INFO L225 Difference]: With dead ends: 62 [2022-11-03 04:04:26,037 INFO L226 Difference]: Without dead ends: 44 [2022-11-03 04:04:26,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 11 SyntacticMatches, 11 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 30.3s TimeCoverageRelationStatistics Valid=141, Invalid=1413, Unknown=6, NotChecked=0, Total=1560 [2022-11-03 04:04:26,039 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 12 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:04:26,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 26 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 04:04:26,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-03 04:04:26,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2022-11-03 04:04:26,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 38 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:04:26,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-11-03 04:04:26,055 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 23 [2022-11-03 04:04:26,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:04:26,055 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-11-03 04:04:26,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.15) internal successors, (23), 20 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:04:26,056 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-11-03 04:04:26,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 04:04:26,056 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:04:26,057 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:04:26,082 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-03 04:04:26,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-03 04:04:26,261 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:04:26,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:04:26,261 INFO L85 PathProgramCache]: Analyzing trace with hash 709260855, now seen corresponding path program 4 times [2022-11-03 04:04:26,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:04:26,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828603678] [2022-11-03 04:04:26,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:04:26,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:04:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:04:29,809 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:04:29,809 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:04:29,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828603678] [2022-11-03 04:04:29,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828603678] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:04:29,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879522844] [2022-11-03 04:04:29,810 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 04:04:29,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:04:29,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:04:29,815 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:04:29,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-03 04:04:29,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:04:29,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-03 04:04:29,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:04:29,961 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:04:30,002 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 16 treesize of output 12 [2022-11-03 04:04:30,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:30,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 04:04:30,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:30,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:30,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:30,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-03 04:04:30,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:30,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:30,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:30,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-03 04:04:30,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-03 04:04:30,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-03 04:04:30,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-03 04:04:30,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:30,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, 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:04:30,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:30,411 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:04:30,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 95 [2022-11-03 04:04:30,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2022-11-03 04:04:30,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:30,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2022-11-03 04:04:30,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:30,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 96 [2022-11-03 04:04:30,700 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 83 treesize of output 68 [2022-11-03 04:04:30,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:30,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 38 [2022-11-03 04:04:30,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:30,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:30,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:30,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:30,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 132 [2022-11-03 04:04:30,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:30,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 61 [2022-11-03 04:04:30,967 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 89 treesize of output 74 [2022-11-03 04:04:30,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:30,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2022-11-03 04:04:31,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:31,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:31,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:31,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:31,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 130 [2022-11-03 04:04:31,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:31,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 59 [2022-11-03 04:04:31,195 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 55 treesize of output 44 [2022-11-03 04:04:31,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:31,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-11-03 04:04:31,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:31,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2022-11-03 04:04:31,612 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 04:04:31,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:06:09,222 WARN L234 SmtUtils]: Spent 26.07s on a formula simplification that was a NOOP. DAG size: 103 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 04:06:11,317 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse12 (select .cse9 .cse1))) (let ((.cse2 (store .cse9 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (.cse5 (+ (- 1) .cse12)) (.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (+ .cse12 1))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_465| Int)) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_465|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_464| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_465| 1) |v_ULTIMATE.start_main_~i~0#1_464|)) (forall ((v_ArrVal_1041 Int) (v_ArrVal_1039 Int)) (let ((.cse0 (store (store (store .cse2 .cse1 .cse3) (+ (* |v_ULTIMATE.start_main_~i~0#1_465| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1039) (+ (* |v_ULTIMATE.start_main_~i~0#1_464| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1041))) (or (= (select .cse0 .cse1) 0) (not (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_465| Int) (v_ArrVal_1041 Int) (|v_ULTIMATE.start_main_~i~0#1_464| Int) (v_ArrVal_1039 Int)) (let ((.cse4 (store (store (store .cse2 .cse1 .cse5) (+ (* |v_ULTIMATE.start_main_~i~0#1_465| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1039) (+ (* |v_ULTIMATE.start_main_~i~0#1_464| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1041))) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_465| 1) |v_ULTIMATE.start_main_~i~0#1_464|)) (= (select .cse4 .cse1) 0) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_465|)) (not (= (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) (= .cse6 (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|))) (forall ((|v_ULTIMATE.start_main_~i~0#1_465| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_464| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_465| 1) |v_ULTIMATE.start_main_~i~0#1_464|)) (forall ((v_ArrVal_1041 Int) (v_ArrVal_1032 Int) (v_ArrVal_1039 Int)) (let ((.cse7 (store .cse9 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_1032))) (let ((.cse8 (store (store (store .cse7 .cse1 .cse5) (+ (* |v_ULTIMATE.start_main_~i~0#1_465| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1039) (+ (* |v_ULTIMATE.start_main_~i~0#1_464| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1041))) (or (not (= .cse6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (= (select .cse8 .cse1) 0) (not (= 0 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|))))))))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_465|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_465| Int)) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_465|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_464| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_465| 1) |v_ULTIMATE.start_main_~i~0#1_464|)) (forall ((v_ArrVal_1041 Int) (v_ArrVal_1032 Int) (v_ArrVal_1039 Int)) (let ((.cse11 (store .cse9 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_1032))) (let ((.cse10 (store (store (store .cse11 .cse1 .cse3) (+ (* |v_ULTIMATE.start_main_~i~0#1_465| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1039) (+ (* |v_ULTIMATE.start_main_~i~0#1_464| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1041))) (or (not (= 0 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|))) (= 0 (select .cse10 .cse1)) (= .cse6 (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|)))))))))))))) is different from false [2022-11-03 04:06:13,450 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (and (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1028 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1028)))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_465| Int) (v_ArrVal_1041 Int) (|v_ULTIMATE.start_main_~i~0#1_464| Int) (v_ArrVal_1039 Int)) (let ((.cse0 (store (store (store .cse2 .cse1 (+ (- 1) (select .cse3 .cse1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_465| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1039) (+ (* |v_ULTIMATE.start_main_~i~0#1_464| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1041))) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_465| 1) |v_ULTIMATE.start_main_~i~0#1_464|)) (= (select .cse0 .cse1) 0) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_465|)) (not (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) (= v_ArrVal_1028 (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_465| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1028 Int)) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_465|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_464| Int)) (or (forall ((v_ArrVal_1041 Int) (v_ArrVal_1032 Int) (v_ArrVal_1039 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1028)))) (let ((.cse9 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse8 (store .cse9 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_1032))) (let ((.cse6 (store (store (store .cse8 .cse1 (+ (- 1) (select .cse9 .cse1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_465| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1039) (+ (* |v_ULTIMATE.start_main_~i~0#1_464| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1041))) (or (not (= (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (= (select .cse6 .cse1) 0) (not (= (select (select (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| .cse8) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) v_ArrVal_1028)))))))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_465| 1) |v_ULTIMATE.start_main_~i~0#1_464|)))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_465| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1028 Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_464| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_465| 1) |v_ULTIMATE.start_main_~i~0#1_464|)) (forall ((v_ArrVal_1041 Int) (v_ArrVal_1032 Int) (v_ArrVal_1039 Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1028)))) (let ((.cse13 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse12 (store .cse13 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_1032))) (let ((.cse10 (store (store (store .cse12 .cse1 (+ (select .cse13 .cse1) 1)) (+ (* |v_ULTIMATE.start_main_~i~0#1_465| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1039) (+ (* |v_ULTIMATE.start_main_~i~0#1_464| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1041))) (or (= (select .cse10 .cse1) 0) (= (select (select (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| .cse12) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) v_ArrVal_1028) (not (= (select .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))))))))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_465|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_465| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1028 Int)) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_465|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_464| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_465| 1) |v_ULTIMATE.start_main_~i~0#1_464|)) (forall ((v_ArrVal_1041 Int) (v_ArrVal_1039 Int)) (let ((.cse14 (store (store (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1028)) |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse15 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse1 (+ (select .cse15 .cse1) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_465| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1039) (+ (* |v_ULTIMATE.start_main_~i~0#1_464| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1041))) (or (= (select .cse14 .cse1) 0) (not (= (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))))))))) is different from false [2022-11-03 04:06:13,499 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:06:13,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 117 [2022-11-03 04:06:13,532 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:06:13,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 165 treesize of output 144 [2022-11-03 04:06:13,557 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:06:13,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 114 [2022-11-03 04:06:13,579 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:06:13,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 118 [2022-11-03 04:06:13,610 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_465| Int) (v_ArrVal_1041 Int) (v_ArrVal_1032 Int) (|v_ULTIMATE.start_main_~i~0#1_464| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1039 Int) (v_arrayElimArr_52 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_52))) (let ((.cse4 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse3 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_1032))) (let ((.cse0 (store (store (store .cse3 .cse1 (+ (select .cse4 .cse1) 1)) (+ (* |v_ULTIMATE.start_main_~i~0#1_465| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1039) (+ (* |v_ULTIMATE.start_main_~i~0#1_464| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1041))) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_465| 1) |v_ULTIMATE.start_main_~i~0#1_464|)) (not (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_465|)) (= (select .cse0 .cse1) 0) (= (select v_arrayElimArr_52 |ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))))) (forall ((v_arrayElimArr_55 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_465| Int) (v_ArrVal_1041 Int) (v_ArrVal_1032 Int) (|v_ULTIMATE.start_main_~i~0#1_464| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1039 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_55))) (let ((.cse8 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse7 (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_1032))) (let ((.cse5 (store (store (store .cse7 .cse1 (+ (- 1) (select .cse8 .cse1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_465| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1039) (+ (* |v_ULTIMATE.start_main_~i~0#1_464| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1041))) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_465| 1) |v_ULTIMATE.start_main_~i~0#1_464|)) (not (= (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (= (select .cse5 .cse1) 0) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_465|)) (not (= (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select v_arrayElimArr_55 |ULTIMATE.start_main_~#sum~0#1.offset|))))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_465| Int) (v_ArrVal_1041 Int) (|v_ULTIMATE.start_main_~i~0#1_464| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1039 Int) (v_arrayElimArr_53 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_53))) (let ((.cse12 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse11 (store .cse12 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse9 (store (store (store .cse11 .cse1 (+ (- 1) (select .cse12 .cse1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_465| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1039) (+ (* |v_ULTIMATE.start_main_~i~0#1_464| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1041))) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_465| 1) |v_ULTIMATE.start_main_~i~0#1_464|)) (= (select .cse9 .cse1) 0) (not (= (select .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_465|)) (= (select (select (store .cse10 |c_ULTIMATE.start_main_~a~0#1.base| .cse11) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select v_arrayElimArr_53 |ULTIMATE.start_main_~#sum~0#1.offset|)))))))) (forall ((v_arrayElimArr_54 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_465| Int) (v_ArrVal_1041 Int) (|v_ULTIMATE.start_main_~i~0#1_464| Int) (v_ArrVal_1039 Int)) (let ((.cse13 (store (store (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_54) |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse14 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse1 (+ (select .cse14 .cse1) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_465| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1039) (+ (* |v_ULTIMATE.start_main_~i~0#1_464| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1041))) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_465| 1) |v_ULTIMATE.start_main_~i~0#1_464|)) (= (select .cse13 .cse1) 0) (not (= (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_465|))))))) is different from false [2022-11-03 04:06:14,003 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse4 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_arrayElimArr_54 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_465| Int) (v_ArrVal_1041 Int) (|v_ULTIMATE.start_main_~i~0#1_464| Int) (v_ArrVal_1023 Int) (v_ArrVal_1039 Int)) (let ((.cse0 (store (store (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse3 .cse4 v_ArrVal_1023)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_54) |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse1 (+ (select .cse2 .cse1) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_465| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1039) (+ (* |v_ULTIMATE.start_main_~i~0#1_464| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1041))) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_465| 1) |v_ULTIMATE.start_main_~i~0#1_464|)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_465|)) (= (select .cse0 .cse1) 0) (not (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_465| Int) (v_ArrVal_1041 Int) (|v_ULTIMATE.start_main_~i~0#1_464| Int) (v_ArrVal_1023 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1039 Int) (v_arrayElimArr_53 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse3 .cse4 v_ArrVal_1023)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_53))) (let ((.cse8 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse7 (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse5 (store (store (store .cse7 .cse1 (+ (- 1) (select .cse8 .cse1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_465| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1039) (+ (* |v_ULTIMATE.start_main_~i~0#1_464| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1041))) (or (not (= (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_465| 1) |v_ULTIMATE.start_main_~i~0#1_464|)) (= (select .cse5 .cse1) 0) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_465|)) (= (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select v_arrayElimArr_53 |ULTIMATE.start_main_~#sum~0#1.offset|)))))))) (forall ((v_arrayElimArr_55 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_465| Int) (v_ArrVal_1041 Int) (v_ArrVal_1032 Int) (|v_ULTIMATE.start_main_~i~0#1_464| Int) (v_ArrVal_1023 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1039 Int)) (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse3 .cse4 v_ArrVal_1023)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_55))) (let ((.cse12 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse11 (store .cse12 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_1032))) (let ((.cse9 (store (store (store .cse11 .cse1 (+ (- 1) (select .cse12 .cse1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_465| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1039) (+ (* |v_ULTIMATE.start_main_~i~0#1_464| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1041))) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_465| 1) |v_ULTIMATE.start_main_~i~0#1_464|)) (not (= (select .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_465|)) (= (select .cse9 .cse1) 0) (not (= (select (select (store .cse10 |c_ULTIMATE.start_main_~a~0#1.base| .cse11) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select v_arrayElimArr_55 |ULTIMATE.start_main_~#sum~0#1.offset|))))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_465| Int) (v_ArrVal_1041 Int) (v_ArrVal_1032 Int) (|v_ULTIMATE.start_main_~i~0#1_464| Int) (v_ArrVal_1023 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1039 Int) (v_arrayElimArr_52 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse3 .cse4 v_ArrVal_1023)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_52))) (let ((.cse16 (select .cse14 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_1032))) (let ((.cse13 (store (store (store .cse15 .cse1 (+ (select .cse16 .cse1) 1)) (+ (* |v_ULTIMATE.start_main_~i~0#1_465| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1039) (+ (* |v_ULTIMATE.start_main_~i~0#1_464| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1041))) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_465| 1) |v_ULTIMATE.start_main_~i~0#1_464|)) (not (= (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (= (select v_arrayElimArr_52 |ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store .cse14 |c_ULTIMATE.start_main_~a~0#1.base| .cse15) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_465|)) (= (select .cse13 .cse1) 0))))))))) is different from false [2022-11-03 04:06:14,256 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_473| Int)) (or (forall ((v_arrayElimArr_55 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_465| Int) (v_ArrVal_1041 Int) (v_ArrVal_1021 Int) (v_ArrVal_1032 Int) (|v_ULTIMATE.start_main_~i~0#1_464| Int) (v_ArrVal_1023 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1039 Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse5 .cse6 v_ArrVal_1021) (+ (* |v_ULTIMATE.start_main_~i~0#1_473| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1023)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_55))) (let ((.cse4 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_1032))) (let ((.cse0 (store (store (store .cse2 .cse3 (+ (- 1) (select .cse4 .cse3))) (+ (* |v_ULTIMATE.start_main_~i~0#1_465| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1039) (+ (* |v_ULTIMATE.start_main_~i~0#1_464| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1041))) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_465| 1) |v_ULTIMATE.start_main_~i~0#1_464|)) (not (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (= (select v_arrayElimArr_55 |ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_465|)) (= (select .cse0 .cse3) 0))))))) (not (<= .cse7 |v_ULTIMATE.start_main_~i~0#1_473|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_473| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_465| Int) (v_ArrVal_1041 Int) (v_ArrVal_1021 Int) (|v_ULTIMATE.start_main_~i~0#1_464| Int) (v_ArrVal_1023 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1039 Int) (v_arrayElimArr_53 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse5 .cse6 v_ArrVal_1021) (+ (* |v_ULTIMATE.start_main_~i~0#1_473| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1023)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_53))) (let ((.cse11 (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse10 (store .cse11 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse8 (store (store (store .cse10 .cse3 (+ (- 1) (select .cse11 .cse3))) (+ (* |v_ULTIMATE.start_main_~i~0#1_465| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1039) (+ (* |v_ULTIMATE.start_main_~i~0#1_464| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1041))) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_465| 1) |v_ULTIMATE.start_main_~i~0#1_464|)) (not (= (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_465|)) (= (select .cse8 .cse3) 0) (= (select (select (store .cse9 |c_ULTIMATE.start_main_~a~0#1.base| .cse10) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select v_arrayElimArr_53 |ULTIMATE.start_main_~#sum~0#1.offset|)))))))) (not (<= .cse7 |v_ULTIMATE.start_main_~i~0#1_473|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_473| Int)) (or (forall ((v_arrayElimArr_54 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_465| Int) (v_ArrVal_1041 Int) (v_ArrVal_1021 Int) (|v_ULTIMATE.start_main_~i~0#1_464| Int) (v_ArrVal_1023 Int) (v_ArrVal_1039 Int)) (let ((.cse12 (store (store (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse5 .cse6 v_ArrVal_1021) (+ (* |v_ULTIMATE.start_main_~i~0#1_473| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1023)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_54) |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse13 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse3 (+ (select .cse13 .cse3) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_465| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1039) (+ (* |v_ULTIMATE.start_main_~i~0#1_464| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1041))) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_465| 1) |v_ULTIMATE.start_main_~i~0#1_464|)) (= (select .cse12 .cse3) 0) (not (= (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_465|))))) (not (<= .cse7 |v_ULTIMATE.start_main_~i~0#1_473|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_473| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_465| Int) (v_ArrVal_1041 Int) (v_ArrVal_1021 Int) (v_ArrVal_1032 Int) (|v_ULTIMATE.start_main_~i~0#1_464| Int) (v_ArrVal_1023 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1039 Int) (v_arrayElimArr_52 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse5 .cse6 v_ArrVal_1021) (+ (* |v_ULTIMATE.start_main_~i~0#1_473| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1023)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_52))) (let ((.cse17 (select .cse15 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse16 (store .cse17 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_1032))) (let ((.cse14 (store (store (store .cse16 .cse3 (+ (select .cse17 .cse3) 1)) (+ (* |v_ULTIMATE.start_main_~i~0#1_465| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1039) (+ (* |v_ULTIMATE.start_main_~i~0#1_464| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1041))) (or (not (= (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_465| 1) |v_ULTIMATE.start_main_~i~0#1_464|)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_465|)) (= (select (select (store .cse15 |c_ULTIMATE.start_main_~a~0#1.base| .cse16) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select v_arrayElimArr_52 |ULTIMATE.start_main_~#sum~0#1.offset|)) (= (select .cse14 .cse3) 0))))))) (not (<= .cse7 |v_ULTIMATE.start_main_~i~0#1_473|)))))) is different from false [2022-11-03 04:06:14,490 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse6 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_474| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~0#1_474|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_473| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_474| 1) |v_ULTIMATE.start_main_~i~0#1_473|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_465| Int) (v_ArrVal_1041 Int) (v_ArrVal_1021 Int) (|v_ULTIMATE.start_main_~i~0#1_464| Int) (v_ArrVal_1023 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1039 Int) (v_arrayElimArr_53 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse6 (+ (* |v_ULTIMATE.start_main_~i~0#1_474| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1021) (+ (* |v_ULTIMATE.start_main_~i~0#1_473| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1023)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_53))) (let ((.cse5 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse3 (store .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse1 (store (store (store .cse3 .cse4 (+ (- 1) (select .cse5 .cse4))) (+ (* |v_ULTIMATE.start_main_~i~0#1_465| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1039) (+ (* |v_ULTIMATE.start_main_~i~0#1_464| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1041))) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_465| 1) |v_ULTIMATE.start_main_~i~0#1_464|)) (not (= (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_465|)) (= (select v_arrayElimArr_53 |ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)) (= (select .cse1 .cse4) 0))))))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_474| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~0#1_474|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_473| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_474| 1) |v_ULTIMATE.start_main_~i~0#1_473|)) (forall ((v_arrayElimArr_55 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_465| Int) (v_ArrVal_1041 Int) (v_ArrVal_1021 Int) (v_ArrVal_1032 Int) (|v_ULTIMATE.start_main_~i~0#1_464| Int) (v_ArrVal_1023 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1039 Int)) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse6 (+ (* |v_ULTIMATE.start_main_~i~0#1_474| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1021) (+ (* |v_ULTIMATE.start_main_~i~0#1_473| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1023)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_55))) (let ((.cse10 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse9 (store .cse10 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_1032))) (let ((.cse7 (store (store (store .cse9 .cse4 (+ (- 1) (select .cse10 .cse4))) (+ (* |v_ULTIMATE.start_main_~i~0#1_465| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1039) (+ (* |v_ULTIMATE.start_main_~i~0#1_464| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1041))) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_465| 1) |v_ULTIMATE.start_main_~i~0#1_464|)) (= (select .cse7 .cse4) 0) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_465|)) (not (= (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (= (select (select (store .cse8 |c_ULTIMATE.start_main_~a~0#1.base| .cse9) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select v_arrayElimArr_55 |ULTIMATE.start_main_~#sum~0#1.offset|))))))))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_474| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_473| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_474| 1) |v_ULTIMATE.start_main_~i~0#1_473|)) (forall ((v_arrayElimArr_54 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_465| Int) (v_ArrVal_1041 Int) (v_ArrVal_1021 Int) (|v_ULTIMATE.start_main_~i~0#1_464| Int) (v_ArrVal_1023 Int) (v_ArrVal_1039 Int)) (let ((.cse11 (store (store (let ((.cse12 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse6 (+ (* |v_ULTIMATE.start_main_~i~0#1_474| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1021) (+ (* |v_ULTIMATE.start_main_~i~0#1_473| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1023)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_54) |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse12 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse4 (+ (select .cse12 .cse4) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_465| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1039) (+ (* |v_ULTIMATE.start_main_~i~0#1_464| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1041))) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_465| 1) |v_ULTIMATE.start_main_~i~0#1_464|)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_465|)) (= (select .cse11 .cse4) 0) (not (= (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))))) (not (<= .cse0 |v_ULTIMATE.start_main_~i~0#1_474|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_474| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_473| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_465| Int) (v_ArrVal_1041 Int) (v_ArrVal_1021 Int) (v_ArrVal_1032 Int) (|v_ULTIMATE.start_main_~i~0#1_464| Int) (v_ArrVal_1023 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1039 Int) (v_arrayElimArr_52 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse6 (+ (* |v_ULTIMATE.start_main_~i~0#1_474| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1021) (+ (* |v_ULTIMATE.start_main_~i~0#1_473| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1023)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_52))) (let ((.cse16 (select .cse14 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_1032))) (let ((.cse13 (store (store (store .cse15 .cse4 (+ (select .cse16 .cse4) 1)) (+ (* |v_ULTIMATE.start_main_~i~0#1_465| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1039) (+ (* |v_ULTIMATE.start_main_~i~0#1_464| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1041))) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_465| 1) |v_ULTIMATE.start_main_~i~0#1_464|)) (= (select .cse13 .cse4) 0) (= (select (select (store .cse14 |c_ULTIMATE.start_main_~a~0#1.base| .cse15) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select v_arrayElimArr_52 |ULTIMATE.start_main_~#sum~0#1.offset|)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_465|)) (not (= (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))))))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_474| 1) |v_ULTIMATE.start_main_~i~0#1_473|)))) (not (<= .cse0 |v_ULTIMATE.start_main_~i~0#1_474|)))))) is different from false [2022-11-03 04:06:14,642 INFO L356 Elim1Store]: treesize reduction 171, result has 22.6 percent of original size [2022-11-03 04:06:14,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 317 treesize of output 162 [2022-11-03 04:06:14,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 240 treesize of output 226 [2022-11-03 04:06:14,660 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:06:14,660 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:06:14,661 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:06:14,662 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:06:14,667 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 04:06:14,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 65 [2022-11-03 04:06:14,675 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:06:14,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 81 [2022-11-03 04:06:14,748 INFO L356 Elim1Store]: treesize reduction 171, result has 22.6 percent of original size [2022-11-03 04:06:14,748 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 312 treesize of output 157 [2022-11-03 04:06:14,754 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:06:14,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 115 treesize of output 99 [2022-11-03 04:06:14,788 INFO L356 Elim1Store]: treesize reduction 20, result has 53.5 percent of original size [2022-11-03 04:06:14,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 217 treesize of output 216 [2022-11-03 04:06:14,948 INFO L356 Elim1Store]: treesize reduction 171, result has 22.6 percent of original size [2022-11-03 04:06:14,948 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 318 treesize of output 163 [2022-11-03 04:06:14,959 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:06:14,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 103 treesize of output 91 [2022-11-03 04:06:14,979 INFO L356 Elim1Store]: treesize reduction 16, result has 23.8 percent of original size [2022-11-03 04:06:14,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 209 treesize of output 193 [2022-11-03 04:06:15,006 INFO L356 Elim1Store]: treesize reduction 220, result has 0.5 percent of original size [2022-11-03 04:06:15,006 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 446 treesize of output 1 [2022-11-03 04:06:15,063 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 2 times theorem prover too weak. 3 trivial. 17 not checked. [2022-11-03 04:06:15,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879522844] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:06:15,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [523613846] [2022-11-03 04:06:15,065 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-03 04:06:15,065 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 04:06:15,065 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 04:06:15,065 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 04:06:15,065 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 04:06:15,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:15,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-03 04:06:15,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:15,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:15,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:15,189 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 04:06:15,189 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:15,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:15,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:15,208 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:06:15,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:15,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:15,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 43 [2022-11-03 04:06:15,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:15,325 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:06:15,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:15,363 INFO L356 Elim1Store]: treesize reduction 110, result has 12.0 percent of original size [2022-11-03 04:06:15,363 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 7 case distinctions, treesize of input 336 treesize of output 332 [2022-11-03 04:06:15,432 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:15,466 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 04:06:15,466 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:15,532 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 04:06:15,532 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:15,577 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:06:15,600 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 04:06:15,600 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 36 treesize of output 38 [2022-11-03 04:06:15,614 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:06:15,626 INFO L356 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2022-11-03 04:06:15,627 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 35 treesize of output 22 [2022-11-03 04:06:15,698 INFO L356 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-03 04:06:15,698 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 36 treesize of output 58 [2022-11-03 04:06:15,732 INFO L356 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2022-11-03 04:06:15,732 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 35 treesize of output 33 [2022-11-03 04:06:15,815 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 04:06:17,321 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4156#(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:06:17,321 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 04:06:17,321 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:06:17,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17, 19] total 53 [2022-11-03 04:06:17,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547738307] [2022-11-03 04:06:17,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:06:17,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-11-03 04:06:17,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:06:17,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-11-03 04:06:17,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=2329, Unknown=30, NotChecked=630, Total=3306 [2022-11-03 04:06:17,324 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 53 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 0 states have call successors, (0), 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:19,448 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse0 (select .cse5 0)) (.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse10 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse12 (store .cse5 (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (.cse6 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= .cse0 1) (or (<= (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| 1) (* c_~N~0 4)) (and .cse2 (or (not (= .cse3 c_~N~0)) (let ((.cse4 (+ (select .cse5 4) .cse0))) (and (<= .cse4 2) (<= 2 .cse4)))) (<= 1 .cse0))) (= .cse3 0) (<= (+ (div (- |c_ULTIMATE.start_main_~a~0#1.offset|) 4) 1) |c_ULTIMATE.start_main_~i~0#1|) .cse2 (forall ((|v_ULTIMATE.start_main_~i~0#1_474| Int)) (or (not (<= .cse6 |v_ULTIMATE.start_main_~i~0#1_474|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_473| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_474| 1) |v_ULTIMATE.start_main_~i~0#1_473|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_465| Int) (v_ArrVal_1041 Int) (v_ArrVal_1021 Int) (|v_ULTIMATE.start_main_~i~0#1_464| Int) (v_ArrVal_1023 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1039 Int) (v_arrayElimArr_53 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse12 (+ (* |v_ULTIMATE.start_main_~i~0#1_474| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1021) (+ (* |v_ULTIMATE.start_main_~i~0#1_473| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1023)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_53))) (let ((.cse11 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse9 (store .cse11 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse7 (store (store (store .cse9 .cse10 (+ (- 1) (select .cse11 .cse10))) (+ (* |v_ULTIMATE.start_main_~i~0#1_465| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1039) (+ (* |v_ULTIMATE.start_main_~i~0#1_464| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1041))) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_465| 1) |v_ULTIMATE.start_main_~i~0#1_464|)) (not (= (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_465|)) (= (select v_arrayElimArr_53 |ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store .cse8 |c_ULTIMATE.start_main_~a~0#1.base| .cse9) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)) (= (select .cse7 .cse10) 0))))))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_474| Int)) (or (not (<= .cse6 |v_ULTIMATE.start_main_~i~0#1_474|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_473| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_474| 1) |v_ULTIMATE.start_main_~i~0#1_473|)) (forall ((v_arrayElimArr_55 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_465| Int) (v_ArrVal_1041 Int) (v_ArrVal_1021 Int) (v_ArrVal_1032 Int) (|v_ULTIMATE.start_main_~i~0#1_464| Int) (v_ArrVal_1023 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1039 Int)) (let ((.cse14 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse12 (+ (* |v_ULTIMATE.start_main_~i~0#1_474| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1021) (+ (* |v_ULTIMATE.start_main_~i~0#1_473| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1023)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_55))) (let ((.cse16 (select .cse14 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_1032))) (let ((.cse13 (store (store (store .cse15 .cse10 (+ (- 1) (select .cse16 .cse10))) (+ (* |v_ULTIMATE.start_main_~i~0#1_465| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1039) (+ (* |v_ULTIMATE.start_main_~i~0#1_464| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1041))) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_465| 1) |v_ULTIMATE.start_main_~i~0#1_464|)) (= (select .cse13 .cse10) 0) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_465|)) (not (= (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (= (select (select (store .cse14 |c_ULTIMATE.start_main_~a~0#1.base| .cse15) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select v_arrayElimArr_55 |ULTIMATE.start_main_~#sum~0#1.offset|))))))))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_474| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_473| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_474| 1) |v_ULTIMATE.start_main_~i~0#1_473|)) (forall ((v_arrayElimArr_54 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_465| Int) (v_ArrVal_1041 Int) (v_ArrVal_1021 Int) (|v_ULTIMATE.start_main_~i~0#1_464| Int) (v_ArrVal_1023 Int) (v_ArrVal_1039 Int)) (let ((.cse17 (store (store (let ((.cse18 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse12 (+ (* |v_ULTIMATE.start_main_~i~0#1_474| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1021) (+ (* |v_ULTIMATE.start_main_~i~0#1_473| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1023)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_54) |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse18 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse10 (+ (select .cse18 .cse10) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_465| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1039) (+ (* |v_ULTIMATE.start_main_~i~0#1_464| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1041))) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_465| 1) |v_ULTIMATE.start_main_~i~0#1_464|)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_465|)) (= (select .cse17 .cse10) 0) (not (= (select .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))))) (not (<= .cse6 |v_ULTIMATE.start_main_~i~0#1_474|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_474| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_473| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_465| Int) (v_ArrVal_1041 Int) (v_ArrVal_1021 Int) (v_ArrVal_1032 Int) (|v_ULTIMATE.start_main_~i~0#1_464| Int) (v_ArrVal_1023 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1039 Int) (v_arrayElimArr_52 (Array Int Int))) (let ((.cse20 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse12 (+ (* |v_ULTIMATE.start_main_~i~0#1_474| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1021) (+ (* |v_ULTIMATE.start_main_~i~0#1_473| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1023)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_52))) (let ((.cse22 (select .cse20 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse21 (store .cse22 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_1032))) (let ((.cse19 (store (store (store .cse21 .cse10 (+ (select .cse22 .cse10) 1)) (+ (* |v_ULTIMATE.start_main_~i~0#1_465| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1039) (+ (* |v_ULTIMATE.start_main_~i~0#1_464| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1041))) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_465| 1) |v_ULTIMATE.start_main_~i~0#1_464|)) (= (select .cse19 .cse10) 0) (= (select (select (store .cse20 |c_ULTIMATE.start_main_~a~0#1.base| .cse21) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select v_arrayElimArr_52 |ULTIMATE.start_main_~#sum~0#1.offset|)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_465|)) (not (= (select .cse19 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))))))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_474| 1) |v_ULTIMATE.start_main_~i~0#1_473|)))) (not (<= .cse6 |v_ULTIMATE.start_main_~i~0#1_474|)))) (<= |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-11-03 04:06:21,460 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse6 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_473| Int)) (or (forall ((v_arrayElimArr_55 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_465| Int) (v_ArrVal_1041 Int) (v_ArrVal_1021 Int) (v_ArrVal_1032 Int) (|v_ULTIMATE.start_main_~i~0#1_464| Int) (v_ArrVal_1023 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1039 Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse5 .cse6 v_ArrVal_1021) (+ (* |v_ULTIMATE.start_main_~i~0#1_473| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1023)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_55))) (let ((.cse4 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_1032))) (let ((.cse0 (store (store (store .cse2 .cse3 (+ (- 1) (select .cse4 .cse3))) (+ (* |v_ULTIMATE.start_main_~i~0#1_465| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1039) (+ (* |v_ULTIMATE.start_main_~i~0#1_464| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1041))) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_465| 1) |v_ULTIMATE.start_main_~i~0#1_464|)) (not (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (= (select v_arrayElimArr_55 |ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_465|)) (= (select .cse0 .cse3) 0))))))) (not (<= .cse7 |v_ULTIMATE.start_main_~i~0#1_473|)))) (= (select .cse5 0) 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_473| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_465| Int) (v_ArrVal_1041 Int) (v_ArrVal_1021 Int) (|v_ULTIMATE.start_main_~i~0#1_464| Int) (v_ArrVal_1023 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1039 Int) (v_arrayElimArr_53 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse5 .cse6 v_ArrVal_1021) (+ (* |v_ULTIMATE.start_main_~i~0#1_473| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1023)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_53))) (let ((.cse11 (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse10 (store .cse11 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse8 (store (store (store .cse10 .cse3 (+ (- 1) (select .cse11 .cse3))) (+ (* |v_ULTIMATE.start_main_~i~0#1_465| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1039) (+ (* |v_ULTIMATE.start_main_~i~0#1_464| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1041))) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_465| 1) |v_ULTIMATE.start_main_~i~0#1_464|)) (not (= (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_465|)) (= (select .cse8 .cse3) 0) (= (select (select (store .cse9 |c_ULTIMATE.start_main_~a~0#1.base| .cse10) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select v_arrayElimArr_53 |ULTIMATE.start_main_~#sum~0#1.offset|)))))))) (not (<= .cse7 |v_ULTIMATE.start_main_~i~0#1_473|)))) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_473| Int)) (or (forall ((v_arrayElimArr_54 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_465| Int) (v_ArrVal_1041 Int) (v_ArrVal_1021 Int) (|v_ULTIMATE.start_main_~i~0#1_464| Int) (v_ArrVal_1023 Int) (v_ArrVal_1039 Int)) (let ((.cse12 (store (store (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse5 .cse6 v_ArrVal_1021) (+ (* |v_ULTIMATE.start_main_~i~0#1_473| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1023)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_54) |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse13 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse3 (+ (select .cse13 .cse3) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_465| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1039) (+ (* |v_ULTIMATE.start_main_~i~0#1_464| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1041))) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_465| 1) |v_ULTIMATE.start_main_~i~0#1_464|)) (= (select .cse12 .cse3) 0) (not (= (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_465|))))) (not (<= .cse7 |v_ULTIMATE.start_main_~i~0#1_473|)))) (= (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (forall ((|v_ULTIMATE.start_main_~i~0#1_473| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_465| Int) (v_ArrVal_1041 Int) (v_ArrVal_1021 Int) (v_ArrVal_1032 Int) (|v_ULTIMATE.start_main_~i~0#1_464| Int) (v_ArrVal_1023 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1039 Int) (v_arrayElimArr_52 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse5 .cse6 v_ArrVal_1021) (+ (* |v_ULTIMATE.start_main_~i~0#1_473| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1023)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_52))) (let ((.cse17 (select .cse15 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse16 (store .cse17 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_1032))) (let ((.cse14 (store (store (store .cse16 .cse3 (+ (select .cse17 .cse3) 1)) (+ (* |v_ULTIMATE.start_main_~i~0#1_465| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1039) (+ (* |v_ULTIMATE.start_main_~i~0#1_464| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1041))) (or (not (= (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_465| 1) |v_ULTIMATE.start_main_~i~0#1_464|)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_465|)) (= (select (select (store .cse15 |c_ULTIMATE.start_main_~a~0#1.base| .cse16) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select v_arrayElimArr_52 |ULTIMATE.start_main_~#sum~0#1.offset|)) (= (select .cse14 .cse3) 0))))))) (not (<= .cse7 |v_ULTIMATE.start_main_~i~0#1_473|)))) (<= .cse6 8) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select .cse5 .cse3) 1))) is different from false [2022-11-03 04:06:41,527 WARN L234 SmtUtils]: Spent 10.85s on a formula simplification. DAG size of input: 281 DAG size of output: 75 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 04:06:42,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:06:42,677 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2022-11-03 04:06:42,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-03 04:06:42,678 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 0 states have call successors, (0), 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:06:42,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:06:42,678 INFO L225 Difference]: With dead ends: 53 [2022-11-03 04:06:42,678 INFO L226 Difference]: Without dead ends: 51 [2022-11-03 04:06:42,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 20 SyntacticMatches, 14 SemanticMatches, 74 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1995 ImplicationChecksByTransitivity, 129.3s TimeCoverageRelationStatistics Valid=522, Invalid=4034, Unknown=32, NotChecked=1112, Total=5700 [2022-11-03 04:06:42,680 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 30 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 176 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:06:42,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 25 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 209 Invalid, 0 Unknown, 176 Unchecked, 0.2s Time] [2022-11-03 04:06:42,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-03 04:06:42,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 44. [2022-11-03 04:06:42,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 43 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:06:42,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-11-03 04:06:42,706 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 23 [2022-11-03 04:06:42,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:06:42,707 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-11-03 04:06:42,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 0 states have call successors, (0), 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:42,707 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-11-03 04:06:42,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 04:06:42,708 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:06:42,708 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:06:42,740 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-11-03 04:06:42,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-03 04:06:42,930 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:06:42,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:06:42,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1583334326, now seen corresponding path program 12 times [2022-11-03 04:06:42,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:06:42,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049372298] [2022-11-03 04:06:42,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:06:42,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:06:42,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:06:43,126 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-03 04:06:43,127 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:06:43,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049372298] [2022-11-03 04:06:43,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049372298] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:06:43,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704495123] [2022-11-03 04:06:43,129 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 04:06:43,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:06:43,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:06:43,130 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:06:43,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-03 04:06:43,251 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 04:06:43,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:06:43,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-03 04:06:43,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:06:43,470 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 04:06:43,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:06:43,696 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 04:06:43,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704495123] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:06:43,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1856202222] [2022-11-03 04:06:43,698 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-11-03 04:06:43,698 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 04:06:43,698 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 04:06:43,699 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 04:06:43,699 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 04:06:43,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:43,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:43,805 INFO L356 Elim1Store]: treesize reduction 68, result has 33.3 percent of original size [2022-11-03 04:06:43,805 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:43,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:43,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-03 04:06:43,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:43,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:43,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:43,928 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 04:06:43,929 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:43,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:43,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:43,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-03 04:06:44,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:44,029 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:06:44,030 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:06:44,072 INFO L356 Elim1Store]: treesize reduction 106, result has 20.9 percent of original size [2022-11-03 04:06:44,073 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 331 treesize of output 333 [2022-11-03 04:06:44,179 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:44,193 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:06:44,218 INFO L356 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-03 04:06:44,218 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:06:44,289 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 04:06:44,289 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:44,334 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:06:44,357 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 04:06:44,357 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 35 treesize of output 37 [2022-11-03 04:06:44,367 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:06:44,388 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 04:06:44,389 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 36 treesize of output 38 [2022-11-03 04:06:44,463 INFO L356 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-03 04:06:44,463 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 36 treesize of output 58 [2022-11-03 04:06:44,498 INFO L356 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2022-11-03 04:06:44,499 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 35 treesize of output 33 [2022-11-03 04:06:44,533 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 04:06:45,460 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4531#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~mem15#1|) (= |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_assume_abort_if_not_~cond#1|) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= |ULTIMATE.start_main_#t~mem15#1| 0) 1 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:45,460 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 04:06:45,460 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:06:45,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 32 [2022-11-03 04:06:45,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766503323] [2022-11-03 04:06:45,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:06:45,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 04:06:45,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:06:45,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 04:06:45,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1124, Unknown=0, NotChecked=0, Total=1332 [2022-11-03 04:06:45,462 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 32 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:06:46,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:06:46,573 INFO L93 Difference]: Finished difference Result 145 states and 161 transitions. [2022-11-03 04:06:46,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-03 04:06:46,574 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-03 04:06:46,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:06:46,575 INFO L225 Difference]: With dead ends: 145 [2022-11-03 04:06:46,575 INFO L226 Difference]: Without dead ends: 117 [2022-11-03 04:06:46,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 31 SyntacticMatches, 20 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1831 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=525, Invalid=3257, Unknown=0, NotChecked=0, Total=3782 [2022-11-03 04:06:46,578 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 221 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 04:06:46,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 325 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 04:06:46,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-03 04:06:46,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 60. [2022-11-03 04:06:46,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.152542372881356) internal successors, (68), 59 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:06:46,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2022-11-03 04:06:46,597 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 23 [2022-11-03 04:06:46,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:06:46,597 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2022-11-03 04:06:46,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:06:46,597 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2022-11-03 04:06:46,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 04:06:46,598 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:06:46,598 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:06:46,625 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-03 04:06:46,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-03 04:06:46,802 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:06:46,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:06:46,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1713112672, now seen corresponding path program 13 times [2022-11-03 04:06:46,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:06:46,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109458623] [2022-11-03 04:06:46,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:06:46,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:06:46,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:06:50,065 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 1 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:06:50,065 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:06:50,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109458623] [2022-11-03 04:06:50,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109458623] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:06:50,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676169593] [2022-11-03 04:06:50,065 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 04:06:50,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:06:50,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:06:50,066 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:06:50,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd2335c-c2c5-427d-95ba-c5948f789130/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-03 04:06:50,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:06:50,200 WARN L261 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 101 conjunts are in the unsatisfiable core [2022-11-03 04:06:50,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:06:50,214 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:50,219 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:50,228 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:06:50,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:50,249 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:06:50,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:50,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:50,286 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 38 treesize of output 43 [2022-11-03 04:06:50,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:50,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:50,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:50,333 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 45 treesize of output 53 [2022-11-03 04:06:50,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:50,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:50,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:50,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:50,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 62 [2022-11-03 04:06:50,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:50,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:50,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:50,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:50,473 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:06:50,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:50,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:50,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:50,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 70 [2022-11-03 04:06:50,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:50,568 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:06:50,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:50,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:50,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:50,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:50,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:50,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:50,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:50,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 75 [2022-11-03 04:06:50,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:50,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:50,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:50,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:50,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:50,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:50,675 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:06:50,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:50,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 71 [2022-11-03 04:06:50,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:50,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:50,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:50,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:50,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:50,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:50,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:50,784 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:06:50,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:50,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 76 [2022-11-03 04:06:50,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:50,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:50,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:50,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:50,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 73 [2022-11-03 04:06:51,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 100 [2022-11-03 04:06:51,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:51,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:51,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:51,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:51,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 61 [2022-11-03 04:06:51,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 100 [2022-11-03 04:06:51,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:51,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:51,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:51,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:51,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:51,331 INFO L356 Elim1Store]: treesize reduction 64, result has 48.8 percent of original size [2022-11-03 04:06:51,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 94 [2022-11-03 04:06:51,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 156 [2022-11-03 04:06:51,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:51,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:51,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:51,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:51,648 INFO L356 Elim1Store]: treesize reduction 90, result has 40.8 percent of original size [2022-11-03 04:06:51,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 102 treesize of output 124 [2022-11-03 04:06:51,870 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 16 treesize of output 5 [2022-11-03 04:06:52,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 166 [2022-11-03 04:06:52,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:52,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:52,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:52,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:52,332 INFO L356 Elim1Store]: treesize reduction 96, result has 36.8 percent of original size [2022-11-03 04:06:52,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 112 treesize of output 124 [2022-11-03 04:06:52,605 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 16 treesize of output 5 [2022-11-03 04:06:52,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:52,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:52,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:52,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:52,958 INFO L356 Elim1Store]: treesize reduction 204, result has 32.7 percent of original size [2022-11-03 04:06:52,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 115 treesize of output 193 [2022-11-03 04:06:52,984 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 134 treesize of output 113 [2022-11-03 04:06:52,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:52,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:52,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:52,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:52,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 68 [2022-11-03 04:06:53,181 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:06:53,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:06:53,447 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 22 treesize of output 20 [2022-11-03 04:06:55,459 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_541| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_541|)) (forall ((v_ArrVal_1272 Int) (v_ArrVal_1268 Int)) (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1268) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_541| 4)) v_ArrVal_1272) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)) is different from false [2022-11-03 04:06:55,490 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 126 treesize of output 122 [2022-11-03 04:08:17,675 WARN L234 SmtUtils]: Spent 14.03s on a formula simplification. DAG size of input: 47 DAG size of output: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 04:08:17,731 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:08:17,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2022-11-03 04:08:17,745 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 538 treesize of output 530 [2022-11-03 04:08:19,970 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_543| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~0#1_543|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_542| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_541| Int)) (or (forall ((v_ArrVal_1262 Int) (v_ArrVal_1272 Int) (v_ArrVal_1264 Int) (v_ArrVal_1268 Int)) (= (select (store (store (store (store .cse1 .cse2 v_ArrVal_1262) (+ (* |v_ULTIMATE.start_main_~i~0#1_543| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1264) (+ (* |v_ULTIMATE.start_main_~i~0#1_542| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1268) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_541| 4)) v_ArrVal_1272) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_542| 1) |v_ULTIMATE.start_main_~i~0#1_541|)))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_543| 1) |v_ULTIMATE.start_main_~i~0#1_542|)))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_543| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~0#1_543|)) (forall ((v_ArrVal_1262 Int) (v_ArrVal_1264 Int)) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse1 .cse2 v_ArrVal_1262) (+ (* |v_ULTIMATE.start_main_~i~0#1_543| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1264)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) is different from false [2022-11-03 04:08:20,047 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 1082 treesize of output 1074 [2022-11-03 04:08:22,415 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse3 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse2 .cse3 (+ (- 1) (select .cse2 .cse3))))) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_544| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~0#1_544|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_543| Int)) (or (forall ((v_ArrVal_1262 Int) (v_ArrVal_1264 Int)) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_544| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1262) (+ (* |v_ULTIMATE.start_main_~i~0#1_543| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1264)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_544| 1) |v_ULTIMATE.start_main_~i~0#1_543|)))))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_544| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_543| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_542| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_541| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_542| 1) |v_ULTIMATE.start_main_~i~0#1_541|)) (forall ((v_ArrVal_1262 Int) (v_ArrVal_1272 Int) (v_ArrVal_1264 Int) (v_ArrVal_1268 Int)) (= (select (store (store (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_544| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1262) (+ (* |v_ULTIMATE.start_main_~i~0#1_543| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1264) (+ (* |v_ULTIMATE.start_main_~i~0#1_542| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1268) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_541| 4)) v_ArrVal_1272) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_543| 1) |v_ULTIMATE.start_main_~i~0#1_542|)))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_544| 1) |v_ULTIMATE.start_main_~i~0#1_543|)))) (not (<= .cse0 |v_ULTIMATE.start_main_~i~0#1_544|)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) is different from false [2022-11-03 04:08:24,472 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_544| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_543| Int)) (or (forall ((v_ArrVal_1262 Int) (v_ArrVal_1264 Int)) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_544| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1262) (+ (* |v_ULTIMATE.start_main_~i~0#1_543| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1264)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_544| 1) |v_ULTIMATE.start_main_~i~0#1_543|)))) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_544|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_544| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_543| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_542| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_541| Int)) (or (forall ((v_ArrVal_1262 Int) (v_ArrVal_1272 Int) (v_ArrVal_1264 Int) (v_ArrVal_1268 Int)) (= (select (store (store (store (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_544| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1262) (+ (* |v_ULTIMATE.start_main_~i~0#1_543| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1264) (+ (* |v_ULTIMATE.start_main_~i~0#1_542| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1268) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_541| 4)) v_ArrVal_1272) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_542| 1) |v_ULTIMATE.start_main_~i~0#1_541|)))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_543| 1) |v_ULTIMATE.start_main_~i~0#1_542|)))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_544| 1) |v_ULTIMATE.start_main_~i~0#1_543|)))) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_544|)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) is different from false [2022-11-03 04:08:26,542 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (+ (select .cse4 |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_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse2)))) (let ((.cse1 (let ((.cse3 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (and (= c_~N~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_544| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_543| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_542| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_541| Int)) (or (forall ((v_ArrVal_1262 Int) (v_ArrVal_1272 Int) (v_ArrVal_1264 Int) (v_ArrVal_1268 Int)) (= (select (store (store (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_544| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1262) (+ (* |v_ULTIMATE.start_main_~i~0#1_543| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1264) (+ (* |v_ULTIMATE.start_main_~i~0#1_542| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1268) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_541| 4)) v_ArrVal_1272) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_542| 1) |v_ULTIMATE.start_main_~i~0#1_541|)))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_543| 1) |v_ULTIMATE.start_main_~i~0#1_542|)))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_544| 1) |v_ULTIMATE.start_main_~i~0#1_543|)))) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_544|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_544| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_543| Int)) (or (forall ((v_ArrVal_1262 Int) (v_ArrVal_1264 Int)) (= c_~N~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_544| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1262) (+ (* |v_ULTIMATE.start_main_~i~0#1_543| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1264)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_544| 1) |v_ULTIMATE.start_main_~i~0#1_543|)))) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_544|)))) (= .cse2 c_~N~0)))))) is different from false [2022-11-03 04:08:28,629 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (let ((.cse7 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse6))))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse2)))) (let ((.cse0 (let ((.cse3 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_544| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_543| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_542| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_543| 1) |v_ULTIMATE.start_main_~i~0#1_542|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_541| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_542| 1) |v_ULTIMATE.start_main_~i~0#1_541|)) (forall ((v_ArrVal_1262 Int) (v_ArrVal_1272 Int) (v_ArrVal_1264 Int) (v_ArrVal_1268 Int)) (= (select (store (store (store (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_544| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1262) (+ (* |v_ULTIMATE.start_main_~i~0#1_543| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1264) (+ (* |v_ULTIMATE.start_main_~i~0#1_542| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1268) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_541| 4)) v_ArrVal_1272) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_544| 1) |v_ULTIMATE.start_main_~i~0#1_543|)))) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_544|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_544| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_543| Int)) (or (forall ((v_ArrVal_1262 Int) (v_ArrVal_1264 Int)) (= (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_544| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1262) (+ (* |v_ULTIMATE.start_main_~i~0#1_543| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1264)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_544| 1) |v_ULTIMATE.start_main_~i~0#1_543|)))) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_544|)))) (= c_~N~0 (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (= c_~N~0 .cse2)))))) is different from false [2022-11-03 04:08:30,775 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (let ((.cse8 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (+ .cse5 .cse6 .cse7 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse8 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse2)))) (let ((.cse1 (let ((.cse3 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_544| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_543| Int)) (or (forall ((v_ArrVal_1262 Int) (v_ArrVal_1264 Int)) (= c_~N~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_544| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1262) (+ (* |v_ULTIMATE.start_main_~i~0#1_543| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1264)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_544| 1) |v_ULTIMATE.start_main_~i~0#1_543|)))) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_544|)))) (= c_~N~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (= c_~N~0 .cse2) (forall ((|v_ULTIMATE.start_main_~i~0#1_544| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_543| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_544| 1) |v_ULTIMATE.start_main_~i~0#1_543|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_542| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_541| Int)) (or (forall ((v_ArrVal_1262 Int) (v_ArrVal_1272 Int) (v_ArrVal_1264 Int) (v_ArrVal_1268 Int)) (= (select (store (store (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_544| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1262) (+ (* |v_ULTIMATE.start_main_~i~0#1_543| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1264) (+ (* |v_ULTIMATE.start_main_~i~0#1_542| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1268) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_541| 4)) v_ArrVal_1272) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_542| 1) |v_ULTIMATE.start_main_~i~0#1_541|)))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_543| 1) |v_ULTIMATE.start_main_~i~0#1_542|)))))) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_544|))))))))) is different from false [2022-11-03 04:08:33,001 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (let ((.cse9 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse8 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse9 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse9 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse5 .cse6 .cse7 .cse8))))))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse2)))) (let ((.cse1 (let ((.cse3 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_544| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_543| Int)) (or (forall ((v_ArrVal_1262 Int) (v_ArrVal_1264 Int)) (= c_~N~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_544| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1262) (+ (* |v_ULTIMATE.start_main_~i~0#1_543| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1264)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_544| 1) |v_ULTIMATE.start_main_~i~0#1_543|)))) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_544|)))) (= c_~N~0 .cse2) (= c_~N~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_544| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_543| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_542| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_543| 1) |v_ULTIMATE.start_main_~i~0#1_542|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_541| Int)) (or (forall ((v_ArrVal_1262 Int) (v_ArrVal_1272 Int) (v_ArrVal_1264 Int) (v_ArrVal_1268 Int)) (= (select (store (store (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_544| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1262) (+ (* |v_ULTIMATE.start_main_~i~0#1_543| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1264) (+ (* |v_ULTIMATE.start_main_~i~0#1_542| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1268) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_541| 4)) v_ArrVal_1272) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_542| 1) |v_ULTIMATE.start_main_~i~0#1_541|)))))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_544| 1) |v_ULTIMATE.start_main_~i~0#1_543|)))) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_544|))))))))) is different from false [2022-11-03 04:08:35,281 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (let ((.cse10 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse6 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse7 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse10 |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse9 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse10 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse10 12 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6 .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse10 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse6 .cse7 .cse8 .cse9)))))))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse2)))) (let ((.cse1 (let ((.cse3 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (and (= (select (select (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_544| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_543| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_544| 1) |v_ULTIMATE.start_main_~i~0#1_543|)) (forall ((v_ArrVal_1262 Int) (v_ArrVal_1264 Int)) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_544| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1262) (+ (* |v_ULTIMATE.start_main_~i~0#1_543| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1264)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_544|)))) (= c_~N~0 .cse2) (forall ((|v_ULTIMATE.start_main_~i~0#1_544| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_543| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_542| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_541| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_542| 1) |v_ULTIMATE.start_main_~i~0#1_541|)) (forall ((v_ArrVal_1262 Int) (v_ArrVal_1272 Int) (v_ArrVal_1264 Int) (v_ArrVal_1268 Int)) (= (select (store (store (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_544| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1262) (+ (* |v_ULTIMATE.start_main_~i~0#1_543| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1264) (+ (* |v_ULTIMATE.start_main_~i~0#1_542| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1268) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_541| 4)) v_ArrVal_1272) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_543| 1) |v_ULTIMATE.start_main_~i~0#1_542|)))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_544| 1) |v_ULTIMATE.start_main_~i~0#1_543|)))) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_544|))))))))) is different from false [2022-11-03 04:08:54,205 WARN L234 SmtUtils]: Spent 18.16s on a formula simplification that was a NOOP. DAG size: 108 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 04:09:43,035 WARN L234 SmtUtils]: Spent 23.08s on a formula simplification. DAG size of input: 111 DAG size of output: 110 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 04:10:17,687 WARN L234 SmtUtils]: Spent 12.23s on a formula simplification that was a NOOP. DAG size: 113 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 04:10:58,975 WARN L234 SmtUtils]: Spent 15.39s on a formula simplification that was a NOOP. DAG size: 115 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)