./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/res2o.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a 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_9da67339-815d-47c7-832e-4864df5d8e36/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da67339-815d-47c7-832e-4864df5d8e36/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da67339-815d-47c7-832e-4864df5d8e36/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da67339-815d-47c7-832e-4864df5d8e36/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/array-fpi/res2o.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da67339-815d-47c7-832e-4864df5d8e36/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da67339-815d-47c7-832e-4864df5d8e36/bin/utaipan-ByfvJB40ur --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 c8f420e2027982da4f1bb18a6387f830c2a1e2f24637d0451d3246965ba37a6d --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-26 00:25:58,939 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 00:25:58,941 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 00:25:58,962 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 00:25:58,963 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 00:25:58,964 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 00:25:58,965 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 00:25:58,967 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 00:25:58,969 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 00:25:58,970 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 00:25:58,971 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 00:25:58,972 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 00:25:58,973 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 00:25:58,974 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 00:25:58,975 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 00:25:58,976 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 00:25:58,977 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 00:25:58,978 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 00:25:58,980 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 00:25:58,982 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 00:25:58,983 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 00:25:58,988 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 00:25:58,989 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 00:25:58,990 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 00:25:58,994 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 00:25:58,994 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 00:25:58,994 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 00:25:58,995 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 00:25:58,996 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 00:25:58,997 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 00:25:58,997 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 00:25:58,998 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 00:25:59,001 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 00:25:59,002 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 00:25:59,003 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 00:25:59,004 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 00:25:59,005 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 00:25:59,005 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 00:25:59,005 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 00:25:59,006 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 00:25:59,007 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 00:25:59,010 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da67339-815d-47c7-832e-4864df5d8e36/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-26 00:25:59,053 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 00:25:59,053 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 00:25:59,053 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 00:25:59,054 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 00:25:59,054 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 00:25:59,055 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 00:25:59,055 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 00:25:59,055 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 00:25:59,055 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 00:25:59,055 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 00:25:59,056 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 00:25:59,056 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 00:25:59,056 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 00:25:59,056 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 00:25:59,057 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 00:25:59,057 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 00:25:59,057 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 00:25:59,057 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 00:25:59,058 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 00:25:59,058 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 00:25:59,058 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 00:25:59,063 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 00:25:59,064 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 00:25:59,064 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-26 00:25:59,065 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 00:25:59,065 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-26 00:25:59,065 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 00:25:59,066 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-26 00:25:59,066 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 00:25:59,067 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-26 00:25:59,067 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 00:25:59,067 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 00:25:59,067 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:25:59,068 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 00:25:59,068 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 00:25:59,068 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 00:25:59,069 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-26 00:25:59,069 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 00:25:59,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 00:25:59,070 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-26 00:25:59,070 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 00:25:59,070 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_9da67339-815d-47c7-832e-4864df5d8e36/bin/utaipan-ByfvJB40ur/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_9da67339-815d-47c7-832e-4864df5d8e36/bin/utaipan-ByfvJB40ur 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 -> c8f420e2027982da4f1bb18a6387f830c2a1e2f24637d0451d3246965ba37a6d [2022-11-26 00:25:59,348 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 00:25:59,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 00:25:59,373 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 00:25:59,375 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 00:25:59,375 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 00:25:59,376 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da67339-815d-47c7-832e-4864df5d8e36/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/array-fpi/res2o.c [2022-11-26 00:26:02,427 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 00:26:02,615 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 00:26:02,615 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da67339-815d-47c7-832e-4864df5d8e36/sv-benchmarks/c/array-fpi/res2o.c [2022-11-26 00:26:02,622 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da67339-815d-47c7-832e-4864df5d8e36/bin/utaipan-ByfvJB40ur/data/b9d7d5433/41bed695168d41178e4d276fefbcbaec/FLAG7004dcece [2022-11-26 00:26:02,645 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da67339-815d-47c7-832e-4864df5d8e36/bin/utaipan-ByfvJB40ur/data/b9d7d5433/41bed695168d41178e4d276fefbcbaec [2022-11-26 00:26:02,651 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 00:26:02,653 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 00:26:02,658 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 00:26:02,658 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 00:26:02,662 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 00:26:02,663 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:26:02" (1/1) ... [2022-11-26 00:26:02,665 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@628bb0b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:26:02, skipping insertion in model container [2022-11-26 00:26:02,666 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:26:02" (1/1) ... [2022-11-26 00:26:02,673 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 00:26:02,694 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:26:02,891 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da67339-815d-47c7-832e-4864df5d8e36/sv-benchmarks/c/array-fpi/res2o.c[588,601] [2022-11-26 00:26:02,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:26:02,955 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 00:26:02,976 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da67339-815d-47c7-832e-4864df5d8e36/sv-benchmarks/c/array-fpi/res2o.c[588,601] [2022-11-26 00:26:03,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:26:03,025 INFO L208 MainTranslator]: Completed translation [2022-11-26 00:26:03,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:26:03 WrapperNode [2022-11-26 00:26:03,026 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 00:26:03,027 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 00:26:03,027 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 00:26:03,027 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 00:26:03,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:26:03" (1/1) ... [2022-11-26 00:26:03,058 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:26:03" (1/1) ... [2022-11-26 00:26:03,093 INFO L138 Inliner]: procedures = 17, calls = 37, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 121 [2022-11-26 00:26:03,093 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 00:26:03,094 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 00:26:03,094 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 00:26:03,095 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 00:26:03,105 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:26:03" (1/1) ... [2022-11-26 00:26:03,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:26:03" (1/1) ... [2022-11-26 00:26:03,116 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:26:03" (1/1) ... [2022-11-26 00:26:03,116 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:26:03" (1/1) ... [2022-11-26 00:26:03,135 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:26:03" (1/1) ... [2022-11-26 00:26:03,143 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:26:03" (1/1) ... [2022-11-26 00:26:03,147 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:26:03" (1/1) ... [2022-11-26 00:26:03,149 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:26:03" (1/1) ... [2022-11-26 00:26:03,156 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 00:26:03,159 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 00:26:03,160 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 00:26:03,160 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 00:26:03,161 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:26:03" (1/1) ... [2022-11-26 00:26:03,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:26:03,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da67339-815d-47c7-832e-4864df5d8e36/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:26:03,207 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da67339-815d-47c7-832e-4864df5d8e36/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 00:26:03,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da67339-815d-47c7-832e-4864df5d8e36/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 00:26:03,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 00:26:03,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-26 00:26:03,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-26 00:26:03,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-26 00:26:03,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-26 00:26:03,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 00:26:03,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 00:26:03,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-26 00:26:03,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-26 00:26:03,368 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 00:26:03,370 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 00:26:03,652 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 00:26:03,712 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 00:26:03,713 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-26 00:26:03,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:26:03 BoogieIcfgContainer [2022-11-26 00:26:03,716 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 00:26:03,718 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 00:26:03,718 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 00:26:03,722 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 00:26:03,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:26:02" (1/3) ... [2022-11-26 00:26:03,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d1145da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:26:03, skipping insertion in model container [2022-11-26 00:26:03,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:26:03" (2/3) ... [2022-11-26 00:26:03,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d1145da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:26:03, skipping insertion in model container [2022-11-26 00:26:03,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:26:03" (3/3) ... [2022-11-26 00:26:03,725 INFO L112 eAbstractionObserver]: Analyzing ICFG res2o.c [2022-11-26 00:26:03,745 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 00:26:03,746 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-26 00:26:03,798 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 00:26:03,806 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;@8929a3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 00:26:03,806 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-26 00:26:03,810 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 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-26 00:26:03,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-26 00:26:03,817 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:26:03,820 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:26:03,821 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:26:03,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:26:03,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1251409213, now seen corresponding path program 1 times [2022-11-26 00:26:03,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:26:03,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157015796] [2022-11-26 00:26:03,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:26:03,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:26:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:26:04,188 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-26 00:26:04,189 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:26:04,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157015796] [2022-11-26 00:26:04,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157015796] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:26:04,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:26:04,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:26:04,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293188751] [2022-11-26 00:26:04,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:26:04,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:26:04,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:26:04,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:26:04,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:26:04,233 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:26:04,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:26:04,294 INFO L93 Difference]: Finished difference Result 26 states and 39 transitions. [2022-11-26 00:26:04,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:26:04,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-26 00:26:04,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:26:04,306 INFO L225 Difference]: With dead ends: 26 [2022-11-26 00:26:04,306 INFO L226 Difference]: Without dead ends: 12 [2022-11-26 00:26:04,308 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-26 00:26:04,312 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:26:04,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:26:04,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-11-26 00:26:04,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-11-26 00:26:04,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.5454545454545454) 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-26 00:26:04,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2022-11-26 00:26:04,346 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 17 transitions. Word has length 10 [2022-11-26 00:26:04,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:26:04,346 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 17 transitions. [2022-11-26 00:26:04,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:26:04,347 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2022-11-26 00:26:04,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-26 00:26:04,348 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:26:04,348 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:26:04,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 00:26:04,348 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:26:04,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:26:04,349 INFO L85 PathProgramCache]: Analyzing trace with hash -28237853, now seen corresponding path program 1 times [2022-11-26 00:26:04,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:26:04,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007691977] [2022-11-26 00:26:04,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:26:04,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:26:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:26:04,571 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-26 00:26:04,571 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:26:04,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007691977] [2022-11-26 00:26:04,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007691977] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:26:04,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:26:04,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:26:04,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652909448] [2022-11-26 00:26:04,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:26:04,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:26:04,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:26:04,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:26:04,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:26:04,576 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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-26 00:26:04,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:26:04,660 INFO L93 Difference]: Finished difference Result 24 states and 37 transitions. [2022-11-26 00:26:04,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:26:04,663 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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-26 00:26:04,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:26:04,663 INFO L225 Difference]: With dead ends: 24 [2022-11-26 00:26:04,664 INFO L226 Difference]: Without dead ends: 17 [2022-11-26 00:26:04,664 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-26 00:26:04,665 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 13 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:26:04,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:26:04,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-11-26 00:26:04,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-11-26 00:26:04,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.375) internal successors, (22), 16 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-26 00:26:04,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2022-11-26 00:26:04,672 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 11 [2022-11-26 00:26:04,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:26:04,672 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2022-11-26 00:26:04,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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-26 00:26:04,673 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2022-11-26 00:26:04,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-26 00:26:04,673 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:26:04,673 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:26:04,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-26 00:26:04,674 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:26:04,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:26:04,679 INFO L85 PathProgramCache]: Analyzing trace with hash -807325923, now seen corresponding path program 1 times [2022-11-26 00:26:04,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:26:04,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792598532] [2022-11-26 00:26:04,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:26:04,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:26:04,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:26:07,492 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:26:07,492 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:26:07,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792598532] [2022-11-26 00:26:07,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792598532] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:26:07,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162695215] [2022-11-26 00:26:07,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:26:07,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:26:07,518 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da67339-815d-47c7-832e-4864df5d8e36/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:26:07,523 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da67339-815d-47c7-832e-4864df5d8e36/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:26:07,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da67339-815d-47c7-832e-4864df5d8e36/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-26 00:26:07,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:26:07,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-26 00:26:07,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:26:07,784 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-26 00:26:07,785 INFO L350 Elim1Store]: Elim1 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 40 treesize of output 34 [2022-11-26 00:26:07,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-26 00:26:07,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-26 00:26:08,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 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-26 00:26:08,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-26 00:26:08,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-26 00:26:08,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 46 [2022-11-26 00:26:09,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 48 [2022-11-26 00:26:09,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 51 treesize of output 19 [2022-11-26 00:26:09,438 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:26:09,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:26:16,506 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:26:16,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162695215] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:26:16,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [453869255] [2022-11-26 00:26:16,537 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-11-26 00:26:16,538 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:26:16,541 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:26:16,548 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:26:16,549 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:26:16,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:16,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:16,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:16,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:16,892 INFO L321 Elim1Store]: treesize reduction 250, result has 21.1 percent of original size [2022-11-26 00:26:16,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 11 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 90 [2022-11-26 00:26:16,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:16,978 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-26 00:26:16,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 30 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 112 [2022-11-26 00:26:17,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:17,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:17,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:17,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:17,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:17,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:17,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:17,451 INFO L321 Elim1Store]: treesize reduction 303, result has 18.8 percent of original size [2022-11-26 00:26:17,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 14 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 68 treesize of output 121 [2022-11-26 00:26:17,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:17,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:17,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 39 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 123 [2022-11-26 00:26:17,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:17,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:17,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:17,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:17,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:17,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:17,815 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:26:17,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:17,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:17,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:17,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:17,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:17,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:17,908 INFO L321 Elim1Store]: treesize reduction 214, result has 11.9 percent of original size [2022-11-26 00:26:17,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 41 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 25 case distinctions, treesize of input 616 treesize of output 604 [2022-11-26 00:26:18,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-26 00:26:18,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-26 00:26:18,190 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-26 00:26:18,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 77 [2022-11-26 00:26:18,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-26 00:26:18,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-26 00:26:18,306 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-26 00:26:18,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 77 [2022-11-26 00:26:18,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-26 00:26:18,383 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:26:18,407 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-26 00:26:18,407 INFO L350 Elim1Store]: Elim1 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-26 00:26:18,493 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 00:26:18,494 INFO L350 Elim1Store]: Elim1 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-26 00:26:18,584 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:26:18,612 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-26 00:26:18,612 INFO L350 Elim1Store]: Elim1 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-26 00:26:18,710 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 00:26:18,710 INFO L350 Elim1Store]: Elim1 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-26 00:26:18,770 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:26:18,798 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-26 00:26:18,798 INFO L350 Elim1Store]: Elim1 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-26 00:26:18,882 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 00:26:18,882 INFO L350 Elim1Store]: Elim1 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-26 00:26:18,905 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:26:19,805 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '281#(and (<= 0 ~N~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem20#1|) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (<= |ULTIMATE.start_main_#t~mem20#1| (* 3 ~N~0)) 1 0)) (= |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|) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= |ULTIMATE.start_main_~b~0#1.offset| 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) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-26 00:26:19,805 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:26:19,806 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:26:19,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 39 [2022-11-26 00:26:19,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422032059] [2022-11-26 00:26:19,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:26:19,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-26 00:26:19,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:26:19,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-26 00:26:19,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1562, Unknown=1, NotChecked=0, Total=1806 [2022-11-26 00:26:19,815 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 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-26 00:26:21,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:26:21,420 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-11-26 00:26:21,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-26 00:26:21,421 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-26 00:26:21,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:26:21,421 INFO L225 Difference]: With dead ends: 25 [2022-11-26 00:26:21,421 INFO L226 Difference]: Without dead ends: 22 [2022-11-26 00:26:21,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1092 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=363, Invalid=2086, Unknown=1, NotChecked=0, Total=2450 [2022-11-26 00:26:21,424 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 7 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-26 00:26:21,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 45 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-26 00:26:21,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-11-26 00:26:21,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-11-26 00:26:21,432 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-26 00:26:21,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2022-11-26 00:26:21,433 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 28 transitions. Word has length 16 [2022-11-26 00:26:21,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:26:21,434 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 28 transitions. [2022-11-26 00:26:21,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 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-26 00:26:21,434 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2022-11-26 00:26:21,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-26 00:26:21,435 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:26:21,435 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:26:21,444 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da67339-815d-47c7-832e-4864df5d8e36/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-26 00:26:21,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da67339-815d-47c7-832e-4864df5d8e36/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:26:21,645 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:26:21,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:26:21,645 INFO L85 PathProgramCache]: Analyzing trace with hash 185398045, now seen corresponding path program 2 times [2022-11-26 00:26:21,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:26:21,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364431650] [2022-11-26 00:26:21,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:26:21,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:26:21,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:26:21,754 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 00:26:21,754 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:26:21,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364431650] [2022-11-26 00:26:21,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364431650] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:26:21,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514206258] [2022-11-26 00:26:21,755 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:26:21,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:26:21,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da67339-815d-47c7-832e-4864df5d8e36/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:26:21,757 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da67339-815d-47c7-832e-4864df5d8e36/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:26:21,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da67339-815d-47c7-832e-4864df5d8e36/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-26 00:26:21,851 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-26 00:26:21,851 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:26:21,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-26 00:26:21,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:26:21,922 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 00:26:21,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:26:21,982 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 00:26:21,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514206258] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:26:21,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [904083637] [2022-11-26 00:26:21,985 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-11-26 00:26:21,985 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:26:21,985 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:26:21,986 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:26:21,986 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:26:22,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:22,074 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-26 00:26:22,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 30 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 112 [2022-11-26 00:26:22,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:22,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:22,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:22,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:22,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:22,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:22,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:22,403 INFO L321 Elim1Store]: treesize reduction 303, result has 18.8 percent of original size [2022-11-26 00:26:22,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 14 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 68 treesize of output 121 [2022-11-26 00:26:22,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:22,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:22,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:22,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:22,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 25 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 57 [2022-11-26 00:26:22,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:22,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:22,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 39 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 123 [2022-11-26 00:26:22,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:22,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:22,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:22,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:22,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:22,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:22,778 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:26:22,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:22,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:22,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:22,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:22,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:22,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:22,862 INFO L321 Elim1Store]: treesize reduction 214, result has 11.9 percent of original size [2022-11-26 00:26:22,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 41 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 25 case distinctions, treesize of input 616 treesize of output 604 [2022-11-26 00:26:23,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-26 00:26:23,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-26 00:26:23,118 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-26 00:26:23,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 77 [2022-11-26 00:26:23,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-26 00:26:23,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-26 00:26:23,233 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-26 00:26:23,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 77 [2022-11-26 00:26:23,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-26 00:26:23,290 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:26:23,316 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-26 00:26:23,317 INFO L350 Elim1Store]: Elim1 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-26 00:26:23,398 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 00:26:23,399 INFO L350 Elim1Store]: Elim1 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-26 00:26:23,459 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:26:23,485 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-26 00:26:23,486 INFO L350 Elim1Store]: Elim1 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-26 00:26:23,578 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 00:26:23,579 INFO L350 Elim1Store]: Elim1 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-26 00:26:23,643 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:26:23,666 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-26 00:26:23,667 INFO L350 Elim1Store]: Elim1 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-26 00:26:23,755 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 00:26:23,755 INFO L350 Elim1Store]: Elim1 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-26 00:26:23,792 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:26:24,364 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '485#(and (<= 0 ~N~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem20#1|) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (<= |ULTIMATE.start_main_#t~mem20#1| (* 3 ~N~0)) 1 0)) (= |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|) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= |ULTIMATE.start_main_~b~0#1.offset| 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) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-26 00:26:24,364 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:26:24,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:26:24,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-26 00:26:24,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971441094] [2022-11-26 00:26:24,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:26:24,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-26 00:26:24,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:26:24,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-26 00:26:24,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-11-26 00:26:24,366 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 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-26 00:26:24,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:26:24,520 INFO L93 Difference]: Finished difference Result 57 states and 77 transitions. [2022-11-26 00:26:24,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-26 00:26:24,524 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 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-26 00:26:24,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:26:24,525 INFO L225 Difference]: With dead ends: 57 [2022-11-26 00:26:24,525 INFO L226 Difference]: Without dead ends: 31 [2022-11-26 00:26:24,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 32 SyntacticMatches, 11 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-11-26 00:26:24,526 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 24 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:26:24,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 12 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:26:24,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-26 00:26:24,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2022-11-26 00:26:24,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 0 states have call successors, (0), 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-26 00:26:24,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2022-11-26 00:26:24,536 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 17 [2022-11-26 00:26:24,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:26:24,536 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2022-11-26 00:26:24,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 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-26 00:26:24,537 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2022-11-26 00:26:24,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-26 00:26:24,537 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:26:24,537 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:26:24,549 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da67339-815d-47c7-832e-4864df5d8e36/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-26 00:26:24,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da67339-815d-47c7-832e-4864df5d8e36/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:26:24,745 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:26:24,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:26:24,746 INFO L85 PathProgramCache]: Analyzing trace with hash 795195426, now seen corresponding path program 3 times [2022-11-26 00:26:24,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:26:24,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862683949] [2022-11-26 00:26:24,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:26:24,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:26:24,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:26:24,862 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-26 00:26:24,862 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:26:24,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862683949] [2022-11-26 00:26:24,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862683949] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:26:24,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092276827] [2022-11-26 00:26:24,863 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-26 00:26:24,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:26:24,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da67339-815d-47c7-832e-4864df5d8e36/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:26:24,864 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da67339-815d-47c7-832e-4864df5d8e36/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:26:24,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da67339-815d-47c7-832e-4864df5d8e36/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-26 00:26:24,952 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-26 00:26:24,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:26:24,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-26 00:26:24,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:26:25,019 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-26 00:26:25,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:26:25,074 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-26 00:26:25,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092276827] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:26:25,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1662883911] [2022-11-26 00:26:25,077 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-11-26 00:26:25,078 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:26:25,078 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:26:25,078 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:26:25,079 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:26:25,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:25,144 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-26 00:26:25,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 30 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 112 [2022-11-26 00:26:25,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:25,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:25,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:25,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:25,401 INFO L321 Elim1Store]: treesize reduction 250, result has 21.1 percent of original size [2022-11-26 00:26:25,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 11 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 90 [2022-11-26 00:26:25,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:25,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:25,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:25,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:25,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:25,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:25,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:25,728 INFO L321 Elim1Store]: treesize reduction 303, result has 18.8 percent of original size [2022-11-26 00:26:25,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 14 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 68 treesize of output 121 [2022-11-26 00:26:25,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:25,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:25,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 39 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 123 [2022-11-26 00:26:26,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:26,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:26,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:26,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:26,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:26,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:26,048 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:26:26,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:26,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:26,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:26,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:26,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:26,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:26,129 INFO L321 Elim1Store]: treesize reduction 214, result has 11.9 percent of original size [2022-11-26 00:26:26,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 41 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 25 case distinctions, treesize of input 616 treesize of output 604 [2022-11-26 00:26:26,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-26 00:26:26,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-26 00:26:26,351 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-26 00:26:26,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 77 [2022-11-26 00:26:26,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-26 00:26:26,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-26 00:26:26,465 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-26 00:26:26,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 77 [2022-11-26 00:26:26,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-26 00:26:26,563 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:26:26,593 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-26 00:26:26,593 INFO L350 Elim1Store]: Elim1 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-26 00:26:26,672 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 00:26:26,673 INFO L350 Elim1Store]: Elim1 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-26 00:26:26,756 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:26:26,781 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-26 00:26:26,782 INFO L350 Elim1Store]: Elim1 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-26 00:26:26,870 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 00:26:26,871 INFO L350 Elim1Store]: Elim1 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-26 00:26:26,938 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:26:26,964 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-26 00:26:26,965 INFO L350 Elim1Store]: Elim1 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-26 00:26:27,070 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 00:26:27,070 INFO L350 Elim1Store]: Elim1 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-26 00:26:27,106 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:26:27,683 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '761#(and (<= 0 ~N~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem20#1|) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (<= |ULTIMATE.start_main_#t~mem20#1| (* 3 ~N~0)) 1 0)) (= |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|) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= |ULTIMATE.start_main_~b~0#1.offset| 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) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-26 00:26:27,683 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:26:27,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:26:27,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-26 00:26:27,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131861524] [2022-11-26 00:26:27,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:26:27,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-26 00:26:27,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:26:27,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-26 00:26:27,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-11-26 00:26:27,685 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:26:27,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:26:27,901 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-11-26 00:26:27,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-26 00:26:27,902 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-26 00:26:27,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:26:27,903 INFO L225 Difference]: With dead ends: 28 [2022-11-26 00:26:27,903 INFO L226 Difference]: Without dead ends: 23 [2022-11-26 00:26:27,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 42 SyntacticMatches, 11 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2022-11-26 00:26:27,905 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 13 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:26:27,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 10 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:26:27,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-26 00:26:27,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-11-26 00:26:27,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 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-26 00:26:27,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-11-26 00:26:27,913 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 20 [2022-11-26 00:26:27,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:26:27,913 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-11-26 00:26:27,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:26:27,913 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-11-26 00:26:27,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-26 00:26:27,914 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:26:27,914 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:26:27,920 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da67339-815d-47c7-832e-4864df5d8e36/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-26 00:26:28,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da67339-815d-47c7-832e-4864df5d8e36/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:26:28,132 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:26:28,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:26:28,133 INFO L85 PathProgramCache]: Analyzing trace with hash -418289731, now seen corresponding path program 4 times [2022-11-26 00:26:28,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:26:28,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175829978] [2022-11-26 00:26:28,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:26:28,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:26:28,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:26:31,747 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-26 00:26:31,747 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:26:31,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175829978] [2022-11-26 00:26:31,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175829978] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:26:31,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009828805] [2022-11-26 00:26:31,747 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-26 00:26:31,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:26:31,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da67339-815d-47c7-832e-4864df5d8e36/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:26:31,749 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da67339-815d-47c7-832e-4864df5d8e36/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:26:31,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da67339-815d-47c7-832e-4864df5d8e36/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-26 00:26:31,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:26:31,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 96 conjunts are in the unsatisfiable core [2022-11-26 00:26:31,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:26:31,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-26 00:26:31,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:31,913 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-26 00:26:31,914 INFO L350 Elim1Store]: Elim1 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 45 treesize of output 39 [2022-11-26 00:26:32,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-26 00:26:32,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:32,135 INFO L350 Elim1Store]: Elim1 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 28 treesize of output 30 [2022-11-26 00:26:32,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:32,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:32,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 40 treesize of output 45 [2022-11-26 00:26:32,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:32,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:32,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:32,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 52 [2022-11-26 00:26:32,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:32,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:32,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:32,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 67 [2022-11-26 00:26:33,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:33,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:33,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:33,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:33,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 74 [2022-11-26 00:26:33,416 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:26:33,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:33,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:33,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:33,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:33,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 9 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 87 [2022-11-26 00:26:33,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:33,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:33,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:33,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 80 [2022-11-26 00:26:34,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:34,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:34,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:34,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 82 [2022-11-26 00:26:34,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:34,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:34,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 8 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 81 [2022-11-26 00:26:34,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:34,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:34,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 8 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 82 [2022-11-26 00:26:34,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:34,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 81 [2022-11-26 00:26:35,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:35,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 31 [2022-11-26 00:26:35,318 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-26 00:26:35,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:27:21,102 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_345 Int) (v_ArrVal_343 Int) (v_ArrVal_342 Int) (v_ArrVal_353 Int) (v_ArrVal_352 Int) (v_ArrVal_340 Int) (v_ArrVal_350 Int) (v_ArrVal_347 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 4))) (let ((.cse0 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_340)))) (store .cse3 |c_ULTIMATE.start_main_~c~0#1.base| (store (store (select .cse3 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_342) .cse2 v_ArrVal_343))))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_353 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_353)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse2)) (+ (* c_~N~0 3) 1)) (not (<= v_ArrVal_350 (+ v_ArrVal_347 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_347)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (not (<= v_ArrVal_343 1)) (not (<= v_ArrVal_340 1)) (not (<= v_ArrVal_352 (+ v_ArrVal_350 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_350)) |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))))) (not (<= v_ArrVal_345 (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (<= v_ArrVal_342 1)) (not (<= v_ArrVal_353 (+ v_ArrVal_352 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_352)) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (<= v_ArrVal_347 (+ v_ArrVal_345 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_345)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))))))))) is different from false [2022-11-26 00:28:50,497 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 13 refuted. 3 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-26 00:28:50,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009828805] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:28:50,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [997271022] [2022-11-26 00:28:50,500 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-11-26 00:28:50,500 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:28:50,501 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:28:50,501 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:28:50,501 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:28:50,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:28:50,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:28:50,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:28:50,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:28:50,768 INFO L321 Elim1Store]: treesize reduction 250, result has 21.1 percent of original size [2022-11-26 00:28:50,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 11 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 90 [2022-11-26 00:28:50,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:28:50,817 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-26 00:28:50,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 30 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 112 [2022-11-26 00:28:50,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:28:50,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:28:50,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:28:50,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:28:50,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:28:50,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:28:50,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:28:51,103 INFO L321 Elim1Store]: treesize reduction 303, result has 18.8 percent of original size [2022-11-26 00:28:51,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 14 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 68 treesize of output 121 [2022-11-26 00:28:51,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:28:51,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:28:51,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 39 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 123 [2022-11-26 00:28:51,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:28:51,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:28:51,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:28:51,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:28:51,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:28:51,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:28:51,386 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:28:51,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:28:51,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:28:51,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:28:51,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:28:51,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:28:51,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:28:51,465 INFO L321 Elim1Store]: treesize reduction 214, result has 11.9 percent of original size [2022-11-26 00:28:51,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 41 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 25 case distinctions, treesize of input 616 treesize of output 604 [2022-11-26 00:28:51,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-26 00:28:51,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-26 00:28:51,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 73 [2022-11-26 00:28:51,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-26 00:28:51,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-26 00:28:51,748 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-26 00:28:51,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 77 [2022-11-26 00:28:51,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-26 00:28:51,820 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:28:51,845 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-26 00:28:51,845 INFO L350 Elim1Store]: Elim1 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-26 00:28:51,935 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 00:28:51,935 INFO L350 Elim1Store]: Elim1 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-26 00:28:51,987 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:28:52,013 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-26 00:28:52,014 INFO L350 Elim1Store]: Elim1 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-26 00:28:52,091 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 00:28:52,091 INFO L350 Elim1Store]: Elim1 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-26 00:28:52,152 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:28:52,176 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-26 00:28:52,177 INFO L350 Elim1Store]: Elim1 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-26 00:28:52,264 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 00:28:52,265 INFO L350 Elim1Store]: Elim1 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-26 00:28:52,299 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:28:54,982 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1044#(and (<= 0 ~N~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem20#1|) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (<= |ULTIMATE.start_main_#t~mem20#1| (* 3 ~N~0)) 1 0)) (= |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|) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= |ULTIMATE.start_main_~b~0#1.offset| 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) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-26 00:28:54,982 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:28:54,982 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:28:54,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 57 [2022-11-26 00:28:54,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760834103] [2022-11-26 00:28:54,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:28:54,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-11-26 00:28:54,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:28:54,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-11-26 00:28:54,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=3179, Unknown=46, NotChecked=116, Total=3660 [2022-11-26 00:28:54,986 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 57 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 57 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-26 00:30:06,239 WARN L233 SmtUtils]: Spent 37.79s on a formula simplification. DAG size of input: 190 DAG size of output: 182 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:30:08,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:30:11,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:30:13,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 00:30:14,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:30:16,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:30:18,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 00:30:20,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:30:23,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 00:30:31,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:31:42,815 WARN L233 SmtUtils]: Spent 37.93s on a formula simplification. DAG size of input: 251 DAG size of output: 187 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:31:44,851 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse10 (* 3 |c_ULTIMATE.start_main_~i~0#1|)) (.cse2 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 4)) (.cse14 (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse3 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (and (forall ((v_ArrVal_345 Int) (v_ArrVal_343 Int) (v_ArrVal_342 Int) (v_ArrVal_353 Int) (v_ArrVal_352 Int) (v_ArrVal_340 Int) (v_ArrVal_350 Int) (v_ArrVal_347 Int)) (let ((.cse0 (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse6 (+ .cse7 |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_340)))) (store .cse5 |c_ULTIMATE.start_main_~c~0#1.base| (store (store (select .cse5 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_342) .cse2 v_ArrVal_343))))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_353 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_353)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse2)) (+ (* c_~N~0 3) 1)) (not (<= v_ArrVal_350 (+ v_ArrVal_347 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_347)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (not (<= v_ArrVal_343 1)) (not (<= v_ArrVal_340 1)) (not (<= v_ArrVal_352 (+ v_ArrVal_350 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_350)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)))) (not (<= v_ArrVal_345 (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (<= v_ArrVal_342 1)) (not (<= v_ArrVal_353 (+ v_ArrVal_352 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_352)) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (<= v_ArrVal_347 (+ v_ArrVal_345 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_345)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))))))) (forall ((v_ArrVal_335 Int) (v_ArrVal_345 Int) (v_ArrVal_333 Int) (v_ArrVal_343 Int) (v_ArrVal_342 Int) (v_ArrVal_353 Int) (v_ArrVal_352 Int) (v_ArrVal_340 Int) (v_ArrVal_350 Int) (v_ArrVal_338 Int) (v_ArrVal_347 Int)) (let ((.cse8 (let ((.cse11 (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse13 .cse14 v_ArrVal_333) (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_335)))) (store .cse12 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse12 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_338) .cse3 v_ArrVal_340))))) (store .cse11 |c_ULTIMATE.start_main_~c~0#1.base| (store (store (select .cse11 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_342) .cse2 v_ArrVal_343))))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_333 1)) (not (<= v_ArrVal_343 1)) (not (<= v_ArrVal_347 (+ v_ArrVal_345 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_345)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (< (+ v_ArrVal_353 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_353)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse2)) (+ 7 .cse10)) (not (<= v_ArrVal_340 1)) (not (<= v_ArrVal_350 (+ v_ArrVal_347 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_347)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (not (<= v_ArrVal_345 (+ (select (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_342 1)) (not (<= v_ArrVal_352 (+ v_ArrVal_350 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_350)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)))) (not (<= v_ArrVal_335 1)) (not (<= v_ArrVal_338 1)) (not (<= v_ArrVal_353 (+ v_ArrVal_352 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_352)) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))))))) (<= (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (forall ((v_ArrVal_335 Int) (v_ArrVal_345 Int) (v_ArrVal_343 Int) (v_ArrVal_342 Int) (v_ArrVal_353 Int) (v_ArrVal_352 Int) (v_ArrVal_340 Int) (v_ArrVal_350 Int) (v_ArrVal_338 Int) (v_ArrVal_347 Int)) (let ((.cse15 (let ((.cse17 (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse13 .cse14 v_ArrVal_335)))) (store .cse18 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse18 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_338) .cse3 v_ArrVal_340))))) (store .cse17 |c_ULTIMATE.start_main_~c~0#1.base| (store (store (select .cse17 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_342) .cse2 v_ArrVal_343))))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_347 (+ v_ArrVal_345 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_345)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (not (<= v_ArrVal_352 (+ v_ArrVal_350 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_350)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)))) (not (<= v_ArrVal_343 1)) (not (<= v_ArrVal_350 (+ v_ArrVal_347 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_347)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (not (<= v_ArrVal_340 1)) (not (<= v_ArrVal_353 (+ v_ArrVal_352 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_352)) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (< (+ (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_353)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse2) v_ArrVal_353) (+ .cse10 4)) (not (<= v_ArrVal_342 1)) (not (<= v_ArrVal_335 1)) (not (<= v_ArrVal_338 1)) (not (<= v_ArrVal_345 (+ (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse15 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (<= (select .cse13 .cse4) 1) (< 1 c_~N~0) (<= (+ |c_ULTIMATE.start_main_~b~0#1.base| 2) |c_ULTIMATE.start_main_~#sum~0#1.base|) (<= (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_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (= |c_ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= (select .cse6 .cse3) 1) (<= (select .cse6 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))))) is different from false [2022-11-26 00:31:47,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:31:48,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:31:52,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:31:54,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 00:31:56,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:32:08,058 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* c_~N~0 3) 1)) (.cse4 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 4))) (and (forall ((v_ArrVal_345 Int) (v_ArrVal_343 Int) (v_ArrVal_342 Int) (v_ArrVal_353 Int) (v_ArrVal_352 Int) (v_ArrVal_340 Int) (v_ArrVal_350 Int) (v_ArrVal_347 Int)) (let ((.cse0 (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_340)))) (store .cse6 |c_ULTIMATE.start_main_~c~0#1.base| (store (store (select .cse6 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_342) .cse2 v_ArrVal_343))))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_353 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_353)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse2)) .cse3) (not (<= v_ArrVal_350 (+ v_ArrVal_347 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_347)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (not (<= v_ArrVal_343 1)) (not (<= v_ArrVal_340 1)) (not (<= v_ArrVal_352 (+ v_ArrVal_350 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_350)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse4)))) (not (<= v_ArrVal_345 (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (<= v_ArrVal_342 1)) (not (<= v_ArrVal_353 (+ v_ArrVal_352 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_352)) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (<= v_ArrVal_347 (+ v_ArrVal_345 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_345)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)))))))) (forall ((v_ArrVal_345 Int) (v_ArrVal_343 Int) (v_ArrVal_342 Int) (v_ArrVal_353 Int) (v_ArrVal_352 Int) (v_ArrVal_350 Int) (v_ArrVal_347 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_342) .cse2 v_ArrVal_343)))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_350 (+ (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_347)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_347))) (< (+ v_ArrVal_353 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_353)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse2)) .cse3) (not (<= v_ArrVal_352 (+ v_ArrVal_350 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_350)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse4)))) (not (<= v_ArrVal_343 1)) (not (<= v_ArrVal_345 (+ (select (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_353 (+ v_ArrVal_352 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_352)) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (<= v_ArrVal_342 1)) (not (<= v_ArrVal_347 (+ v_ArrVal_345 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_345)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)))))))))) is different from false [2022-11-26 00:32:10,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:33:23,390 WARN L233 SmtUtils]: Spent 34.03s on a formula simplification. DAG size of input: 239 DAG size of output: 192 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:33:26,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:33:28,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:33:30,425 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 4)) (.cse3 (+ (* c_~N~0 3) 1)) (.cse4 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (and (forall ((v_ArrVal_345 Int) (v_ArrVal_343 Int) (v_ArrVal_342 Int) (v_ArrVal_353 Int) (v_ArrVal_352 Int) (v_ArrVal_350 Int) (v_ArrVal_347 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| (store (store .cse6 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_342) .cse2 v_ArrVal_343)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_350 (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_347)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_347))) (< (+ v_ArrVal_353 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_353)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse2)) .cse3) (not (<= v_ArrVal_352 (+ v_ArrVal_350 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_350)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse4)))) (not (<= v_ArrVal_343 1)) (not (<= v_ArrVal_345 (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_353 (+ v_ArrVal_352 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_352)) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (<= v_ArrVal_342 1)) (not (<= v_ArrVal_347 (+ v_ArrVal_345 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_345)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)))))))) (forall ((v_ArrVal_345 Int) (v_ArrVal_343 Int) (v_ArrVal_342 Int) (v_ArrVal_353 Int) (v_ArrVal_352 Int) (v_ArrVal_350 Int) (v_ArrVal_347 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse9 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store .cse6 (+ .cse9 |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_342) (+ .cse9 |c_ULTIMATE.start_main_~c~0#1.offset| 4) v_ArrVal_343))))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_345 (+ (select (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_343 1)) (not (<= v_ArrVal_353 (+ v_ArrVal_352 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_352)) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (< (+ v_ArrVal_353 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_353)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse2)) .cse3) (not (<= v_ArrVal_350 (+ (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_347)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_347))) (not (<= v_ArrVal_352 (+ v_ArrVal_350 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_350)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse4)))) (not (<= v_ArrVal_342 1)) (not (<= v_ArrVal_347 (+ v_ArrVal_345 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_345)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)))))))))) is different from false [2022-11-26 00:33:32,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:33:34,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:33:36,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:33:39,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:33:49,272 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 191 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:33:51,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:33:53,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 00:33:55,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 00:33:57,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:33:59,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 00:34:01,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:34:03,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:34:05,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:34:07,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 00:34:09,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:34:12,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:34:14,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:34:16,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:34:18,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:34:20,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:34:22,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:34:25,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:34:28,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:34:31,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:34:33,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:34:36,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:34:38,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:34:41,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:35:48,284 WARN L233 SmtUtils]: Spent 18.65s on a formula simplification. DAG size of input: 224 DAG size of output: 204 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:35:50,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:36:16,672 WARN L233 SmtUtils]: Spent 6.72s on a formula simplification that was a NOOP. DAG size: 193 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:36:19,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 00:36:21,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 00:36:23,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 00:36:25,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 00:36:27,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 00:36:29,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 00:36:31,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 00:36:34,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 00:36:36,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 00:36:38,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 00:36:40,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 00:36:42,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 00:36:44,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 00:36:46,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 00:36:49,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 00:36:51,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 00:36:53,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 00:36:55,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 00:36:57,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 00:36:59,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 00:37:01,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 00:37:03,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 00:37:05,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 00:37:07,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 00:37:09,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 00:37:21,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:37:21,136 INFO L93 Difference]: Finished difference Result 77 states and 102 transitions. [2022-11-26 00:37:21,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-11-26 00:37:21,137 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 57 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) Word has length 22 [2022-11-26 00:37:21,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:37:21,139 INFO L225 Difference]: With dead ends: 77 [2022-11-26 00:37:21,140 INFO L226 Difference]: Without dead ends: 73 [2022-11-26 00:37:21,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 16 SyntacticMatches, 11 SemanticMatches, 92 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2532 ImplicationChecksByTransitivity, 486.6s TimeCoverageRelationStatistics Valid=823, Invalid=7092, Unknown=111, NotChecked=716, Total=8742 [2022-11-26 00:37:21,143 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 11 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 117 mSolverCounterUnsat, 63 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 153.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 63 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 158.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:37:21,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 53 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 756 Invalid, 63 Unknown, 60 Unchecked, 158.0s Time] [2022-11-26 00:37:21,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-26 00:37:21,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 43. [2022-11-26 00:37:21,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 42 states have internal predecessors, (57), 0 states have call successors, (0), 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-26 00:37:21,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2022-11-26 00:37:21,177 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 57 transitions. Word has length 22 [2022-11-26 00:37:21,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:37:21,178 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 57 transitions. [2022-11-26 00:37:21,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 57 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-26 00:37:21,178 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2022-11-26 00:37:21,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-26 00:37:21,179 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:37:21,179 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:37:21,186 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da67339-815d-47c7-832e-4864df5d8e36/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-26 00:37:21,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da67339-815d-47c7-832e-4864df5d8e36/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:37:21,386 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:37:21,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:37:21,386 INFO L85 PathProgramCache]: Analyzing trace with hash -166007597, now seen corresponding path program 5 times [2022-11-26 00:37:21,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:37:21,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908335804] [2022-11-26 00:37:21,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:37:21,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:37:21,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:37:21,527 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-26 00:37:21,527 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:37:21,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908335804] [2022-11-26 00:37:21,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908335804] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:37:21,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662892210] [2022-11-26 00:37:21,528 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:37:21,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:37:21,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da67339-815d-47c7-832e-4864df5d8e36/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:37:21,530 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da67339-815d-47c7-832e-4864df5d8e36/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:37:21,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da67339-815d-47c7-832e-4864df5d8e36/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-26 00:37:21,728 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-26 00:37:21,728 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:37:21,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-26 00:37:21,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:37:21,809 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-26 00:37:21,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:37:21,881 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-26 00:37:21,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662892210] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:37:21,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1064639187] [2022-11-26 00:37:21,883 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-11-26 00:37:21,883 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:37:21,884 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:37:21,884 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:37:21,884 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:37:21,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:21,937 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-26 00:37:21,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 30 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 112 [2022-11-26 00:37:21,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:21,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:21,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:21,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:22,206 INFO L321 Elim1Store]: treesize reduction 250, result has 21.1 percent of original size [2022-11-26 00:37:22,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 11 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 90 [2022-11-26 00:37:22,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:22,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:22,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:22,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:22,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:22,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:22,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:22,534 INFO L321 Elim1Store]: treesize reduction 303, result has 18.8 percent of original size [2022-11-26 00:37:22,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 14 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 68 treesize of output 121 [2022-11-26 00:37:22,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:22,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:22,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 39 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 123 [2022-11-26 00:37:22,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:22,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:22,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:22,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:22,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:22,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:22,839 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:37:22,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:22,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:22,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:22,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:22,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:22,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:22,925 INFO L321 Elim1Store]: treesize reduction 214, result has 11.9 percent of original size [2022-11-26 00:37:22,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 41 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 25 case distinctions, treesize of input 616 treesize of output 604 [2022-11-26 00:37:23,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-26 00:37:23,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-26 00:37:23,132 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-26 00:37:23,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 77 [2022-11-26 00:37:23,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-26 00:37:23,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-26 00:37:23,228 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-26 00:37:23,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 77 [2022-11-26 00:37:23,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-26 00:37:23,299 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:37:23,329 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-26 00:37:23,330 INFO L350 Elim1Store]: Elim1 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-26 00:37:23,407 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 00:37:23,407 INFO L350 Elim1Store]: Elim1 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-26 00:37:23,462 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:37:23,496 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-26 00:37:23,496 INFO L350 Elim1Store]: Elim1 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-26 00:37:23,586 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 00:37:23,586 INFO L350 Elim1Store]: Elim1 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-26 00:37:23,642 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:37:23,668 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-26 00:37:23,668 INFO L350 Elim1Store]: Elim1 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-26 00:37:23,737 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 00:37:23,737 INFO L350 Elim1Store]: Elim1 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-26 00:37:23,757 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:37:24,344 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1487#(and (<= 0 ~N~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem20#1|) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (<= |ULTIMATE.start_main_#t~mem20#1| (* 3 ~N~0)) 1 0)) (= |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|) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= |ULTIMATE.start_main_~b~0#1.offset| 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) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-26 00:37:24,344 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:37:24,344 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:37:24,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-11-26 00:37:24,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942448847] [2022-11-26 00:37:24,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:37:24,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-26 00:37:24,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:37:24,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-26 00:37:24,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-11-26 00:37:24,346 INFO L87 Difference]: Start difference. First operand 43 states and 57 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:37:24,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:37:24,599 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2022-11-26 00:37:24,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-26 00:37:24,601 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-26 00:37:24,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:37:24,601 INFO L225 Difference]: With dead ends: 85 [2022-11-26 00:37:24,601 INFO L226 Difference]: Without dead ends: 49 [2022-11-26 00:37:24,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 13 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2022-11-26 00:37:24,602 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 17 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:37:24,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 14 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:37:24,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-26 00:37:24,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2022-11-26 00:37:24,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 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-26 00:37:24,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2022-11-26 00:37:24,625 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 23 [2022-11-26 00:37:24,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:37:24,626 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2022-11-26 00:37:24,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:37:24,626 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2022-11-26 00:37:24,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-26 00:37:24,627 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:37:24,627 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:37:24,638 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da67339-815d-47c7-832e-4864df5d8e36/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-26 00:37:24,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da67339-815d-47c7-832e-4864df5d8e36/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-26 00:37:24,833 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:37:24,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:37:24,833 INFO L85 PathProgramCache]: Analyzing trace with hash 678555894, now seen corresponding path program 6 times [2022-11-26 00:37:24,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:37:24,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189994563] [2022-11-26 00:37:24,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:37:24,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:37:24,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:37:24,995 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-26 00:37:24,995 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:37:24,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189994563] [2022-11-26 00:37:24,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189994563] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:37:24,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006259425] [2022-11-26 00:37:24,995 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-26 00:37:24,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:37:24,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da67339-815d-47c7-832e-4864df5d8e36/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:37:24,997 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da67339-815d-47c7-832e-4864df5d8e36/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:37:25,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da67339-815d-47c7-832e-4864df5d8e36/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-26 00:37:25,103 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-26 00:37:25,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:37:25,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-26 00:37:25,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:37:25,175 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-26 00:37:25,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:37:25,250 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-26 00:37:25,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006259425] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:37:25,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1422752962] [2022-11-26 00:37:25,253 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-11-26 00:37:25,253 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:37:25,253 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:37:25,253 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:37:25,253 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:37:25,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:25,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:25,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:25,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:25,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:25,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:25,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:25,525 INFO L321 Elim1Store]: treesize reduction 303, result has 18.8 percent of original size [2022-11-26 00:37:25,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 14 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 68 treesize of output 121 [2022-11-26 00:37:25,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:25,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 32 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 108 [2022-11-26 00:37:25,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:25,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:25,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:25,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:25,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 25 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 57 [2022-11-26 00:37:25,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:25,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:25,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 39 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 118 [2022-11-26 00:37:25,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:25,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:25,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:25,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:25,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:25,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:25,890 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:37:25,891 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:37:25,976 INFO L321 Elim1Store]: treesize reduction 186, result has 18.4 percent of original size [2022-11-26 00:37:25,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 34 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 26 case distinctions, treesize of input 611 treesize of output 605 [2022-11-26 00:37:26,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-26 00:37:26,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-26 00:37:26,317 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-26 00:37:26,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 77 [2022-11-26 00:37:26,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-26 00:37:26,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-26 00:37:26,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 73 [2022-11-26 00:37:26,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-26 00:37:26,473 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-26 00:37:26,473 INFO L350 Elim1Store]: Elim1 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-26 00:37:26,563 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 00:37:26,564 INFO L350 Elim1Store]: Elim1 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-26 00:37:26,615 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:37:26,648 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-26 00:37:26,648 INFO L350 Elim1Store]: Elim1 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-26 00:37:26,734 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 00:37:26,735 INFO L350 Elim1Store]: Elim1 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-26 00:37:26,781 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:37:26,803 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-26 00:37:26,803 INFO L350 Elim1Store]: Elim1 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-26 00:37:26,897 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 00:37:26,897 INFO L350 Elim1Store]: Elim1 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-26 00:37:26,931 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:37:27,553 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1890#(and (<= 0 ~N~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem20#1|) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (<= |ULTIMATE.start_main_#t~mem20#1| (* 3 ~N~0)) 1 0)) (= |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|) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= |ULTIMATE.start_main_~b~0#1.offset| 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) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-26 00:37:27,553 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:37:27,553 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:37:27,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-11-26 00:37:27,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429473443] [2022-11-26 00:37:27,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:37:27,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-26 00:37:27,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:37:27,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-26 00:37:27,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2022-11-26 00:37:27,555 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:37:27,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:37:27,792 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-11-26 00:37:27,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-26 00:37:27,793 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-26 00:37:27,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:37:27,794 INFO L225 Difference]: With dead ends: 46 [2022-11-26 00:37:27,794 INFO L226 Difference]: Without dead ends: 34 [2022-11-26 00:37:27,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 52 SyntacticMatches, 15 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2022-11-26 00:37:27,795 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 15 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:37:27,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 14 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:37:27,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-26 00:37:27,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2022-11-26 00:37:27,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 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-26 00:37:27,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-11-26 00:37:27,812 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 25 [2022-11-26 00:37:27,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:37:27,812 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-11-26 00:37:27,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:37:27,812 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-11-26 00:37:27,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-26 00:37:27,813 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:37:27,813 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:37:27,820 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da67339-815d-47c7-832e-4864df5d8e36/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-26 00:37:28,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da67339-815d-47c7-832e-4864df5d8e36/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-26 00:37:28,019 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:37:28,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:37:28,020 INFO L85 PathProgramCache]: Analyzing trace with hash 596492701, now seen corresponding path program 7 times [2022-11-26 00:37:28,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:37:28,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878110898] [2022-11-26 00:37:28,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:37:28,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:37:28,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:37:33,522 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:37:33,522 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:37:33,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878110898] [2022-11-26 00:37:33,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878110898] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:37:33,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804980996] [2022-11-26 00:37:33,522 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-26 00:37:33,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:37:33,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da67339-815d-47c7-832e-4864df5d8e36/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:37:33,524 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da67339-815d-47c7-832e-4864df5d8e36/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:37:33,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da67339-815d-47c7-832e-4864df5d8e36/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-26 00:37:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:37:33,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 127 conjunts are in the unsatisfiable core [2022-11-26 00:37:33,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:37:33,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-26 00:37:33,696 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-26 00:37:33,697 INFO L350 Elim1Store]: Elim1 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 40 treesize of output 34 [2022-11-26 00:37:33,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-26 00:37:33,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:33,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 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-26 00:37:34,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:34,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:34,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-26 00:37:34,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:34,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:34,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 57 [2022-11-26 00:37:34,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:34,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:34,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:34,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 53 treesize of output 64 [2022-11-26 00:37:34,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:34,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:34,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:34,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:34,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 76 [2022-11-26 00:37:35,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:35,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:35,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:35,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:35,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 86 [2022-11-26 00:37:35,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:35,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:35,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:35,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:35,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:35,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 13 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 98 [2022-11-26 00:37:35,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:35,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:35,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:35,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:35,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:35,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:35,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 15 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 110 [2022-11-26 00:37:36,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:36,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:36,018 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:37:36,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:36,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:36,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:36,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:36,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 15 disjoint index pairs (out of 55 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 123 [2022-11-26 00:37:36,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:36,243 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:37:36,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:36,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:36,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:36,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:36,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:36,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 15 disjoint index pairs (out of 55 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 126 [2022-11-26 00:37:36,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:36,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:36,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:36,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:36,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 15 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 116 [2022-11-26 00:37:36,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:36,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:36,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:36,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:36,936 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:37:36,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:36,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 15 disjoint index pairs (out of 55 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 122 [2022-11-26 00:37:37,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:37,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:37,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:37,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:37,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 15 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 118 [2022-11-26 00:37:37,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:37,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:37,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 12 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 115 [2022-11-26 00:37:38,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:38,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:38,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 12 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 116 [2022-11-26 00:37:38,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:38,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:38,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 12 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 117 [2022-11-26 00:37:38,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 9 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 114 [2022-11-26 00:37:39,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 9 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 43 [2022-11-26 00:37:39,362 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:37:39,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:40:19,331 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_665 Int) (v_ArrVal_664 Int) (v_ArrVal_675 Int) (v_ArrVal_674 Int) (v_ArrVal_662 Int) (v_ArrVal_672 Int) (v_ArrVal_670 Int) (v_ArrVal_680 Int) (v_ArrVal_667 Int) (v_ArrVal_677 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_662) (+ .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| 4) v_ArrVal_664))))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_664 1)) (not (<= v_ArrVal_670 (+ v_ArrVal_667 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_667)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= v_ArrVal_680 (+ v_ArrVal_677 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_677)) |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 4))))) (not (<= v_ArrVal_675 (+ v_ArrVal_674 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_674)) |c_ULTIMATE.start_main_~b~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|))))) (not (<= v_ArrVal_667 (+ v_ArrVal_665 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_665)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (not (<= v_ArrVal_662 1)) (not (<= v_ArrVal_672 (+ v_ArrVal_670 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_670)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (< (+ v_ArrVal_680 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_680)) |c_ULTIMATE.start_main_~c~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~c~0#1.offset|))) (+ (* c_~N~0 3) 1)) (not (<= v_ArrVal_665 (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (<= v_ArrVal_677 (+ v_ArrVal_675 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_675)) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (<= v_ArrVal_674 (+ v_ArrVal_672 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_672)) |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))))))))) is different from false [2022-11-26 00:40:22,461 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_665 Int) (v_ArrVal_664 Int) (v_ArrVal_675 Int) (v_ArrVal_674 Int) (v_ArrVal_662 Int) (v_ArrVal_672 Int) (v_ArrVal_660 Int) (v_ArrVal_670 Int) (v_ArrVal_680 Int) (v_ArrVal_667 Int) (v_ArrVal_677 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_660) (+ .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| 4) v_ArrVal_662) (+ .cse2 8 |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_664))))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_660 1)) (not (<= v_ArrVal_665 (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_664 1)) (not (<= v_ArrVal_674 (+ v_ArrVal_672 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_672)) |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))))) (not (<= v_ArrVal_667 (+ v_ArrVal_665 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_665)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (< (+ v_ArrVal_680 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_680)) |c_ULTIMATE.start_main_~c~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~c~0#1.offset|))) (+ (* c_~N~0 3) 1)) (not (<= v_ArrVal_670 (+ v_ArrVal_667 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_667)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= v_ArrVal_677 (+ v_ArrVal_675 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_675)) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (<= v_ArrVal_675 (+ v_ArrVal_674 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_674)) |c_ULTIMATE.start_main_~b~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|))))) (not (<= v_ArrVal_680 (+ v_ArrVal_677 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_677)) |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 4))))) (not (<= v_ArrVal_672 (+ v_ArrVal_670 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_670)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (not (<= v_ArrVal_662 1)))))) is different from false